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.
A floor quotient in the fundamental parallelogram already gives the required strict norm decrease; global nearest-point optimality is not asserted. The shared carrier is identical to the Gaussian carrier, but the multiplication law and norm are different. Eisenstein gcd, factorization, and prime classification remain separate targets.
Exact theorem in conservative defined notation
∀ ap. ∀ an. ∀ bp. ∀ bn. ∀ sa. ∀ sb. ∀ N. SignedDifferenceSquare(ap,an,sa) → SignedDifferenceSquare(bp,bn,sb) → EisensteinCoordinateNorm(ap,an,bp,bn,N) → sa + sb + (ap · bn + an · bp) = ap · bp + an · bn + N
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 19 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.
01Fix variables and assumptionsL1–10
02Use earlier factsL11–14
Instantiate or apply named facts and discharge the corresponding proof obligations.
03Calculate and transport equalitiesL15–17
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L15
trans ((((((((ap) * (ap))) + (((an) * (an))))) + (((((bp) * (bp))) + (((bn) * (bn))))))) + (((((ap) * (bn))) + (((an) * (bp)))))) - L16
simp [ha, hb, add_assoc, add_comm, four_square_add_swap_right_tail] - L17
trans ((((((((ap) * (an))) + (((an) * (ap))))) + (((((bp) * (bn))) + (((bn) * (bp))))))) + (((((ap) * (bp))) + (((an) * (bn)))))) + N
04Use earlier factsL18–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L18
exact hnorm
05Calculate and transport equalitiesL19–19
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L19
simp [add_assoc, add_comm, four_square_add_swap_right_tail]
Original defined command ledger · 19 lines
- 0001
intro ap - 0002
intro an - 0003
intro bp - 0004
intro bn - 0005
intro sa - 0006
intro sb - 0007
intro N - 0008
intro ha - 0009
intro hb - 0010
intro hnorm - 0011
specialize add_right_cancel ((sa + sb) + (((((ap) * (bn))) + (((an) * (bp)))))) - 0012
specialize add_right_cancel ((((((ap) * (bp))) + (((an) * (bn))))) + N) - 0013
specialize add_right_cancel ((((((ap) * (an))) + (((an) * (ap))))) + (((((bp) * (bn))) + (((bn) * (bp)))))) - 0014
apply add_right_cancel - 0015
trans ((((((((ap) * (ap))) + (((an) * (an))))) + (((((bp) * (bp))) + (((bn) * (bn))))))) + (((((ap) * (bn))) + (((an) * (bp)))))) - 0016
simp [ha, hb, add_assoc, add_comm, four_square_add_swap_right_tail] - 0017
trans ((((((((ap) * (an))) + (((an) * (ap))))) + (((((bp) * (bn))) + (((bn) * (bp))))))) + (((((ap) * (bp))) + (((an) * (bn)))))) + N - 0018
exact hnorm - 0019
simp [add_assoc, add_comm, four_square_add_swap_right_tail]