Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
The initial 0/1 convergent is included: u is natural, not necessarily positive. Comparison denominators are strictly smaller and positive. Signed competitors are represented by an arbitrary difference rp−rn. Approximation inequalities are proved from the trace, never stored as assumptions in Convergent.
Exact theorem in conservative defined notation
∀ t. ∀ h. ∀ e. ∀ k. ∀ u. ∀ U. ∀ v. ∀ V. ∀ q. ∀ s. ConvergentMatrixTrace(t,h,e,k,u,U,v,V) → ListCell(s,q,t) → ∃ x. ∃ y. ConvergentMatrixTrace(s,x,y,S k,q · u + v,q · U + V,u,U)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 51 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.
Named ingredients (2)
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–12
03Establish hzL13–19
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply cf convergent state code exists.
- L13
have hz : ∃ z. ConvergentMatrixCode(s,q · u + v,q · U + V,u,U,z)Definitions: ConvergentMatrixCode(s,q · u + v,q · U + V,u,U,z)Original native command in the exact edition - L14
specialize cf_convergent_state_code_exists (s) - L15
specialize cf_convergent_state_code_exists ((q * u + v)) - L16
specialize cf_convergent_state_code_exists ((q * U + V)) - L17
specialize cf_convergent_state_code_exists (u) - L18
specialize cf_convergent_state_code_exists (U) - L19
apply cf_convergent_state_code_exists
04Separate the logical casesL20–20
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L20
cases hz
05Establish hbL21–26
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta prefix extend.
- L21
have hb : ∃ H. ∃ E. BetaAt(H,E,S k,x) ∧ (∀ y. ∀ z. Lt(y,S k) → BetaAt(h,e,y,z) → BetaAt(H,E,y,z))Definitions: BetaAt(H,E,S k,x)Lt(y,S k)BetaAt(h,e,y,z)BetaAt(H,E,y,z)Original native command in the exact edition - L22
specialize beta_prefix_extend (S k) - L23
specialize beta_prefix_extend (h) - L24
specialize beta_prefix_extend (e) - L25
specialize beta_prefix_extend (x) - L26
apply beta_prefix_extend
06Separate the logical casesL27–29
07Construct an explicit witnessL30–31
08Use earlier factsL32–41
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L32
specialize cf_convergent_matrix_extend_preserved_prefix (t) - L33
specialize cf_convergent_matrix_extend_preserved_prefix (h) - L34
specialize cf_convergent_matrix_extend_preserved_prefix (e) - L35
specialize cf_convergent_matrix_extend_preserved_prefix (k) - L36
specialize cf_convergent_matrix_extend_preserved_prefix (u) - L37
specialize cf_convergent_matrix_extend_preserved_prefix (U) - L38
specialize cf_convergent_matrix_extend_preserved_prefix (v) - L39
specialize cf_convergent_matrix_extend_preserved_prefix (V) - L40
specialize cf_convergent_matrix_extend_preserved_prefix (q) - L41
specialize cf_convergent_matrix_extend_preserved_prefix (s)
09Use earlier factsL42–46
10Construct an explicit witnessL47–47
Supply the displayed value, then prove that it has the required property.
- L47
exists x
11Separate the logical casesL48–48
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L48
split
Original defined command ledger · 51 lines
- 0001
intro t - 0002
intro h - 0003
intro e - 0004
intro k - 0005
intro u - 0006
intro U - 0007
intro v - 0008
intro V - 0009
intro q - 0010
intro s - 0011
intro ht - 0012
intro hcell - 0013
have hz : ∃ z. ConvergentMatrixCode(s,q · u + v,q · U + V,u,U,z) - 0014
specialize cf_convergent_state_code_exists (s) - 0015
specialize cf_convergent_state_code_exists ((q * u + v)) - 0016
specialize cf_convergent_state_code_exists ((q * U + V)) - 0017
specialize cf_convergent_state_code_exists (u) - 0018
specialize cf_convergent_state_code_exists (U) - 0019
apply cf_convergent_state_code_exists - 0020
cases hz - 0021
have hb : ∃ H. ∃ E. BetaAt(H,E,S k,x) ∧ (∀ y. ∀ z. Lt(y,S k) → BetaAt(h,e,y,z) → BetaAt(H,E,y,z)) - 0022
specialize beta_prefix_extend (S k) - 0023
specialize beta_prefix_extend (h) - 0024
specialize beta_prefix_extend (e) - 0025
specialize beta_prefix_extend (x) - 0026
apply beta_prefix_extend - 0027
cases hb - 0028
cases hb_witness - 0029
cases hb_witness_witness - 0030
exists x1 - 0031
exists x2 - 0032
specialize cf_convergent_matrix_extend_preserved_prefix (t) - 0033
specialize cf_convergent_matrix_extend_preserved_prefix (h) - 0034
specialize cf_convergent_matrix_extend_preserved_prefix (e) - 0035
specialize cf_convergent_matrix_extend_preserved_prefix (k) - 0036
specialize cf_convergent_matrix_extend_preserved_prefix (u) - 0037
specialize cf_convergent_matrix_extend_preserved_prefix (U) - 0038
specialize cf_convergent_matrix_extend_preserved_prefix (v) - 0039
specialize cf_convergent_matrix_extend_preserved_prefix (V) - 0040
specialize cf_convergent_matrix_extend_preserved_prefix (q) - 0041
specialize cf_convergent_matrix_extend_preserved_prefix (s) - 0042
specialize cf_convergent_matrix_extend_preserved_prefix (x1) - 0043
specialize cf_convergent_matrix_extend_preserved_prefix (x2) - 0044
apply cf_convergent_matrix_extend_preserved_prefix - 0045
exact ht - 0046
exact hcell - 0047
exists x - 0048
split - 0049
exact hz_witness - 0050
exact hb_witness_witness_left - 0051
exact hb_witness_witness_right