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. ∀ N. GNorm(z,N) → (GUnit(z) → N = 1) ∧ (N = 1 → 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 22 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–3
02Separate the logical casesL4–4
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L4
split
03Fix variables and assumptionsL5–5
Work with arbitrary variables or the premises of the current implication.
- L5
intro hu
04Use earlier factsL6–13
Instantiate or apply named facts and discharge the corresponding proof obligations.
05Fix variables and assumptionsL14–14
Work with arbitrary variables or the premises of the current implication.
- L14
intro heq
06Use earlier factsL15–22
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 22 lines
- 0001
intro z - 0002
intro N - 0003
intro hnorm - 0004
split - 0005
intro hu - 0006
specialize gaussian_norm_functional (z) - 0007
specialize gaussian_norm_functional (N) - 0008
specialize gaussian_norm_functional (1) - 0009
apply gaussian_norm_functional - 0010
exact hnorm - 0011
specialize gaussian_unit_has_norm_one (z) - 0012
apply gaussian_unit_has_norm_one - 0013
exact hu - 0014
intro heq - 0015
specialize gaussian_norm_one_is_unit (z) - 0016
apply gaussian_norm_one_is_unit - 0017
specialize gaussian_norm_value_transport (z) - 0018
specialize gaussian_norm_value_transport (N) - 0019
specialize gaussian_norm_value_transport (1) - 0020
apply gaussian_norm_value_transport - 0021
exact heq - 0022
exact hnorm