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. ∀ N. ∀ k. WeightedSignedNormThree(ap,an,bp,bn,N) → WeightedSignedNormThree(k · ap,k · an,k · bp,k · bn,k · k · N)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 29 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–7
02Separate the logical casesL8–11
03Construct an explicit witnessL12–13
04Separate the logical casesL14–14
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L14
split
05Use earlier factsL15–20
Instantiate or apply named facts and discharge the corresponding proof obligations.
06Separate the logical casesL21–21
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L21
split
07Use earlier factsL22–27
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 29 lines
- 0001
intro ap - 0002
intro an - 0003
intro bp - 0004
intro bn - 0005
intro N - 0006
intro k - 0007
intro hnorm - 0008
cases hnorm - 0009
cases hnorm_witness - 0010
cases hnorm_witness_witness - 0011
cases hnorm_witness_witness_right - 0012
exists (k * k) * x - 0013
exists (k * k) * x1 - 0014
split - 0015
specialize gaussian_signed_square_scaled ap - 0016
specialize gaussian_signed_square_scaled an - 0017
specialize gaussian_signed_square_scaled x - 0018
specialize gaussian_signed_square_scaled k - 0019
apply gaussian_signed_square_scaled - 0020
exact hnorm_witness_witness_left - 0021
split - 0022
specialize gaussian_signed_square_scaled bp - 0023
specialize gaussian_signed_square_scaled bn - 0024
specialize gaussian_signed_square_scaled x1 - 0025
specialize gaussian_signed_square_scaled k - 0026
apply gaussian_signed_square_scaled - 0027
exact hnorm_witness_witness_right_left - 0028
rewrite hnorm_witness_witness_right_right - 0029
simp [mul_add, mul_assoc, mul_comm, natural_mul_swap_right_tail]