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
GNorm(6,1)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 15 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)
01Use earlier factsL1–8
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L1
specialize gaussian_norm_of_representation (6) - L2
specialize gaussian_norm_of_representation (1) - L3
specialize gaussian_norm_of_representation (0) - L4
specialize gaussian_norm_of_representation (0) - L5
specialize gaussian_norm_of_representation (0) - L6
specialize gaussian_norm_of_representation (1) - L7
apply gaussian_norm_of_representation - L8
exact gaussian_one_representation
02Construct an explicit witnessL9–10
03Separate the logical casesL11–11
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L11
split
04Calculate and transport equalitiesL12–12
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L12
norm_num
05Separate the logical casesL13–13
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L13
split
Original defined command ledger · 15 lines
- 0001
specialize gaussian_norm_of_representation (6) - 0002
specialize gaussian_norm_of_representation (1) - 0003
specialize gaussian_norm_of_representation (0) - 0004
specialize gaussian_norm_of_representation (0) - 0005
specialize gaussian_norm_of_representation (0) - 0006
specialize gaussian_norm_of_representation (1) - 0007
apply gaussian_norm_of_representation - 0008
exact gaussian_one_representation - 0009
exists (1) - 0010
exists (0) - 0011
split - 0012
norm_num - 0013
split - 0014
norm_num - 0015
norm_num