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
∀ su. ∀ sv. ∀ sw. ∀ sx. ∀ R. ∀ I. ∀ P. ∀ Q. ∀ p. ∀ q. P = 3 · p → Q = 3 · q → R + (P + P) = su + sv + (Q + Q) → I + (q + q) = sw + sx + (p + p) → R + 3 · I = su + sv + 3 · (sw + sx)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 39 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
02Fix variables and assumptionsL11–14
03Establish hscaledL15–24
Establish this local claim before using it. It is not an additional assumption.
04Use earlier factsL25–25
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L25
exact hsum
05Calculate and transport equalitiesL26–26
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L26
simp [mul_add, add_assoc, add_comm, four_square_add_swap_right_tail]
06Use earlier factsL27–34
Instantiate or apply named facts and discharge the corresponding proof obligations.
07Calculate and transport equalitiesL35–35
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L35
trans 3 * I + (Q + Q)
08Use earlier factsL36–36
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L36
apply add_comm
09Calculate and transport equalitiesL37–37
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L37
trans 3 * (sw + sx) + (P + P)
Original defined command ledger · 39 lines
- 0001
intro su - 0002
intro sv - 0003
intro sw - 0004
intro sx - 0005
intro R - 0006
intro I - 0007
intro P - 0008
intro Q - 0009
intro p - 0010
intro q - 0011
intro hp - 0012
intro hq - 0013
intro hdifference - 0014
intro hsum - 0015
have hscaled : 3 * I + (Q + Q) = 3 * (sw + sx) + (P + P) - 0016
rewrite hp - 0017
rewrite hp - 0018
rewrite hq - 0019
rewrite hq - 0020
trans 3 * (I + (q + q)) - 0021
simp [mul_add, add_assoc, add_comm, four_square_add_swap_right_tail] - 0022
trans 3 * ((sw + sx) + (p + p)) - 0023
congr - 0024
refl - 0025
exact hsum - 0026
simp [mul_add, add_assoc, add_comm, four_square_add_swap_right_tail] - 0027
specialize add_cross_sum_chain R - 0028
specialize add_cross_sum_chain (su + sv) - 0029
specialize add_cross_sum_chain (P + P) - 0030
specialize add_cross_sum_chain (Q + Q) - 0031
specialize add_cross_sum_chain (3 * I) - 0032
specialize add_cross_sum_chain (3 * (sw + sx)) - 0033
apply add_cross_sum_chain - 0034
exact hdifference - 0035
trans 3 * I + (Q + Q) - 0036
apply add_comm - 0037
trans 3 * (sw + sx) + (P + P) - 0038
exact hscaled - 0039
apply add_comm