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.
This branch proves the finite determinant/rank/span substrate. It does not claim Smith or Hermite normal form, lattice index equals determinant, determinant multiplicativity, lattice reduction, or geometry-of-numbers theorems.
Exact theorem in conservative defined notation
∀ pb. ∀ pc. ∀ nb. ∀ nc. SignedRecursiveDeterminant(pb,pc,nb,nc,0,1,0)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 38 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–4
02Establish hextL5–14
Establish this local claim before using it. It is not an additional assumption.
- L5
have hext : ∃ u. ∃ v. (∀ x. ∀ y. Lt(x,0) → BetaAt(0,0,x,y) → BetaAt(u,v,x,y)) ∧ (SignedDeterminantHistory(u,v,1) ∧ SignedDeterminantNodeAt(u,v,0,0,pb,pc,nb,nc,1,0))Definitions: Lt(x,0)BetaAt(0,0,x,y)BetaAt(u,v,x,y)SignedDeterminantHistory(u,v,1)SignedDeterminantNodeAt(u,v,0,0,pb,pc,nb,nc,1,0)Original native command in the exact edition - L6
specialize matrix_recursive_history_extend (0) - L7
specialize matrix_recursive_history_extend (0) - L8
specialize matrix_recursive_history_extend (0) - L9
specialize matrix_recursive_history_extend (0) - L10
specialize matrix_recursive_history_extend (pb) - L11
specialize matrix_recursive_history_extend (pc) - L12
specialize matrix_recursive_history_extend (nb) - L13
specialize matrix_recursive_history_extend (nc) - L14
specialize matrix_recursive_history_extend (1)
03Use earlier factsL15–19
Instantiate or apply named facts and discharge the corresponding proof obligations.
04Separate the logical casesL20–21
05Calculate and transport equalitiesL22–22
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L22
refl
06Separate the logical casesL23–23
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L23
split
07Calculate and transport equalitiesL24–25
08Separate the logical casesL26–29
09Construct an explicit witnessL30–33
10Separate the logical casesL34–34
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L34
split
11Use earlier factsL35–35
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L35
exact hext_witness_witness_right_left
12Separate the logical casesL36–36
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L36
split
Original defined command ledger · 38 lines
- 0001
intro pb - 0002
intro pc - 0003
intro nb - 0004
intro nc - 0005
have hext : ∃ u. ∃ v. (∀ x. ∀ y. Lt(x,0) → BetaAt(0,0,x,y) → BetaAt(u,v,x,y)) ∧ (SignedDeterminantHistory(u,v,1) ∧ SignedDeterminantNodeAt(u,v,0,0,pb,pc,nb,nc,1,0)) - 0006
specialize matrix_recursive_history_extend (0) - 0007
specialize matrix_recursive_history_extend (0) - 0008
specialize matrix_recursive_history_extend (0) - 0009
specialize matrix_recursive_history_extend (0) - 0010
specialize matrix_recursive_history_extend (pb) - 0011
specialize matrix_recursive_history_extend (pc) - 0012
specialize matrix_recursive_history_extend (nb) - 0013
specialize matrix_recursive_history_extend (nc) - 0014
specialize matrix_recursive_history_extend (1) - 0015
specialize matrix_recursive_history_extend (0) - 0016
apply matrix_recursive_history_extend - 0017
specialize matrix_recursive_empty_history (0) - 0018
specialize matrix_recursive_empty_history (0) - 0019
apply matrix_recursive_empty_history - 0020
left - 0021
split - 0022
refl - 0023
split - 0024
refl - 0025
refl - 0026
cases hext - 0027
cases hext_witness - 0028
cases hext_witness_witness - 0029
cases hext_witness_witness_right - 0030
exists x - 0031
exists x1 - 0032
exists 1 - 0033
exists 0 - 0034
split - 0035
exact hext_witness_witness_right_left - 0036
split - 0037
apply le_refl - 0038
exact hext_witness_witness_right_right