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.
Inputs are genuine canonical signed-pair codes, not arbitrary naturals. Products start at the actual Gaussian identity, whose code is six. The factor list uses the proved prime-divisor property; irreducibility alone is not silently renamed primality. Uniqueness supplies equal lengths, a bounded bijection, and an actual unit at each match, including repeated factors. Units have empty factorizations and zero is excluded. Sorted primary representatives, Gaussian prime classification, and Eisenstein factorization are separate targets.
Exact theorem in conservative defined notation
∀ b. ∀ c. ∀ d. ∀ e. GMatchedFactors(b,c,d,e,0,0,0)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 42 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 (1)
01Fix variables and assumptionsL1–4
02Separate the logical casesL5–6
03Fix variables and assumptionsL7–8
04Separate the logical casesL9–9
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L9
exfalso
05Use earlier factsL10–12
06Separate the logical casesL13–13
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L13
split
07Fix variables and assumptionsL14–20
08Separate the logical casesL21–21
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L21
exfalso
09Use earlier factsL22–24
10Fix variables and assumptionsL25–26
11Separate the logical casesL27–27
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L27
exfalso
12Use earlier factsL28–30
13Fix variables and assumptionsL31–38
14Separate the logical casesL39–39
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L39
exfalso
Original defined command ledger · 42 lines
- 0001
intro b - 0002
intro c - 0003
intro d - 0004
intro e - 0005
split - 0006
split - 0007
intro i - 0008
intro hi - 0009
exfalso - 0010
specialize gaussian_search_no_index_below_zero (i) - 0011
apply gaussian_search_no_index_below_zero - 0012
exact hi - 0013
split - 0014
intro i - 0015
intro j - 0016
intro a - 0017
intro hi - 0018
intro hj - 0019
intro hfirst - 0020
intro hsecond - 0021
exfalso - 0022
specialize gaussian_search_no_index_below_zero (i) - 0023
apply gaussian_search_no_index_below_zero - 0024
exact hi - 0025
intro a - 0026
intro ha - 0027
exfalso - 0028
specialize gaussian_search_no_index_below_zero (a) - 0029
apply gaussian_search_no_index_below_zero - 0030
exact ha - 0031
intro i - 0032
intro j - 0033
intro a - 0034
intro t - 0035
intro hi - 0036
intro hmap - 0037
intro hsource - 0038
intro htarget - 0039
exfalso - 0040
specialize gaussian_search_no_index_below_zero (i) - 0041
apply gaussian_search_no_index_below_zero - 0042
exact hi