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. ∀ d. ∃ p. ∃ n. SignedRecursiveDeterminant(pb,pc,nb,nc,d,p,n)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 37 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–5
02Establish hevaluationL6–15
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply matrix recursive all extensions.
- L6
have hevaluation : ∃ u. ∃ v. ∃ t. ∃ p. ∃ n. (∀ x. ∀ y. Lt(x,0) → BetaAt(0,0,x,y) → BetaAt(u,v,x,y)) ∧ (Le(0,t) ∧ (SignedDeterminantHistory(u,v,S t) ∧ SignedDeterminantNodeAt(u,v,t,d,pb,pc,nb,nc,p,n)))Definitions: Lt(x,0)BetaAt(0,0,x,y)BetaAt(u,v,x,y)Le(0,t)SignedDeterminantHistory(u,v,S t)SignedDeterminantNodeAt(u,v,t,d,pb,pc,nb,nc,p,n)Original native command in the exact edition - L7
specialize matrix_recursive_all_extensions (d) - L8
specialize matrix_recursive_all_extensions (pb) - L9
specialize matrix_recursive_all_extensions (pc) - L10
specialize matrix_recursive_all_extensions (nb) - L11
specialize matrix_recursive_all_extensions (nc) - L12
specialize matrix_recursive_all_extensions (0) - L13
specialize matrix_recursive_all_extensions (0) - L14
specialize matrix_recursive_all_extensions (0) - L15
apply matrix_recursive_all_extensions
03Use earlier factsL16–18
04Separate the logical casesL19–26
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L19
cases hevaluation - L20
cases hevaluation_witness - L21
cases hevaluation_witness_witness - L22
cases hevaluation_witness_witness_witness - L23
cases hevaluation_witness_witness_witness_witness - L24
cases hevaluation_witness_witness_witness_witness_witness - L25
cases hevaluation_witness_witness_witness_witness_witness_right - L26
cases hevaluation_witness_witness_witness_witness_witness_right_right
05Construct an explicit witnessL27–32
06Separate the logical casesL33–33
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L33
split
07Use earlier factsL34–34
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L34
exact hevaluation_witness_witness_witness_witness_witness_right_right_left
08Separate the logical casesL35–35
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L35
split
Original defined command ledger · 37 lines
- 0001
intro pb - 0002
intro pc - 0003
intro nb - 0004
intro nc - 0005
intro d - 0006
have hevaluation : ∃ u. ∃ v. ∃ t. ∃ p. ∃ n. (∀ x. ∀ y. Lt(x,0) → BetaAt(0,0,x,y) → BetaAt(u,v,x,y)) ∧ (Le(0,t) ∧ (SignedDeterminantHistory(u,v,S t) ∧ SignedDeterminantNodeAt(u,v,t,d,pb,pc,nb,nc,p,n))) - 0007
specialize matrix_recursive_all_extensions (d) - 0008
specialize matrix_recursive_all_extensions (pb) - 0009
specialize matrix_recursive_all_extensions (pc) - 0010
specialize matrix_recursive_all_extensions (nb) - 0011
specialize matrix_recursive_all_extensions (nc) - 0012
specialize matrix_recursive_all_extensions (0) - 0013
specialize matrix_recursive_all_extensions (0) - 0014
specialize matrix_recursive_all_extensions (0) - 0015
apply matrix_recursive_all_extensions - 0016
specialize matrix_recursive_empty_history (0) - 0017
specialize matrix_recursive_empty_history (0) - 0018
apply matrix_recursive_empty_history - 0019
cases hevaluation - 0020
cases hevaluation_witness - 0021
cases hevaluation_witness_witness - 0022
cases hevaluation_witness_witness_witness - 0023
cases hevaluation_witness_witness_witness_witness - 0024
cases hevaluation_witness_witness_witness_witness_witness - 0025
cases hevaluation_witness_witness_witness_witness_witness_right - 0026
cases hevaluation_witness_witness_witness_witness_witness_right_right - 0027
exists x3 - 0028
exists x4 - 0029
exists x - 0030
exists x1 - 0031
exists S x2 - 0032
exists x2 - 0033
split - 0034
exact hevaluation_witness_witness_witness_witness_witness_right_right_left - 0035
split - 0036
apply le_refl - 0037
exact hevaluation_witness_witness_witness_witness_witness_right_right_right