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
∀ z. ZPairValid(z) → GUnit(z) ∨ ¬GUnit(z)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 32 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 (3)
01Fix variables and assumptionsL1–2
02Establish hnL3–6
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply gaussian norm exists.
03Separate the logical casesL7–7
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L7
cases hn
04Establish hcasesL8–11
05Separate the logical casesL12–13
06Use earlier factsL14–21
Instantiate or apply named facts and discharge the corresponding proof obligations.
07Separate the logical casesL22–22
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L22
right
08Fix variables and assumptionsL23–23
Work with arbitrary variables or the premises of the current implication.
- L23
intro hu
09Use earlier factsL24–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 32 lines
- 0001
intro z - 0002
intro hv - 0003
have hn : ∃ N. GNorm(z,N) - 0004
specialize gaussian_norm_exists (z) - 0005
apply gaussian_norm_exists - 0006
exact hv - 0007
cases hn - 0008
have hcases : x=1 \/ ~(x=1) - 0009
specialize eq_decidable (x) - 0010
specialize eq_decidable (1) - 0011
apply eq_decidable - 0012
cases hcases - 0013
left - 0014
specialize gaussian_norm_one_is_unit (z) - 0015
apply gaussian_norm_one_is_unit - 0016
specialize gaussian_norm_value_transport (z) - 0017
specialize gaussian_norm_value_transport (x) - 0018
specialize gaussian_norm_value_transport (1) - 0019
apply gaussian_norm_value_transport - 0020
exact hcases_left - 0021
exact hn_witness - 0022
right - 0023
intro hu - 0024
apply hcases_right - 0025
specialize gaussian_norm_functional (z) - 0026
specialize gaussian_norm_functional (x) - 0027
specialize gaussian_norm_functional (1) - 0028
apply gaussian_norm_functional - 0029
exact hn_witness - 0030
specialize gaussian_unit_has_norm_one (z) - 0031
apply gaussian_unit_has_norm_one - 0032
exact hu