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.
Exact expanded first-order arithmetic statement
forall z. (exists ge_real_positive_ring_valid ge_real_negative_ring_valid ge_imaginary_positive_ring_valid ge_imaginary_negative_ring_valid. (exists ge_real_code_ring_validdecode ge_imaginary_code_ring_validdecode. (((z) = ((ge_real_code_ring_validdecode) + (ge_imaginary_code_ring_validdecode)) * S ((ge_real_code_ring_validdecode) + (ge_imaginary_code_ring_validdecode)) + ((ge_imaginary_code_ring_validdecode) + (ge_imaginary_code_ring_validdecode))) /\ (((((ge_real_code_ring_validdecode) = 2 * (ge_real_positive_ring_valid) /\ (ge_real_negative_ring_valid) = 0) \/ exists ge_signed_half_ge_ring_validdecode_real. (((ge_real_code_ring_validdecode) = 2 * ge_signed_half_ge_ring_validdecode_real + 1 /\ (ge_real_positive_ring_valid) = 0) /\ (ge_real_negative_ring_valid) = S ge_signed_half_ge_ring_validdecode_real))) /\ ((((ge_imaginary_code_ring_validdecode) = 2 * (ge_imaginary_positive_ring_valid) /\ (ge_imaginary_negative_ring_valid) = 0) \/ exists ge_signed_half_ge_ring_validdecode_imaginary. (((ge_imaginary_code_ring_validdecode) = 2 * ge_signed_half_ge_ring_validdecode_imaginary + 1 /\ (ge_imaginary_positive_ring_valid) = 0) /\ (ge_imaginary_negative_ring_valid) = S ge_signed_half_ge_ring_validdecode_imaginary))))))) -> exists ap an bp bn. (exists ge_representation_real_code_ring_representation ge_representation_imaginary_code_ring_representation. (((z) = ((ge_representation_real_code_ring_representation) + (ge_representation_imaginary_code_ring_representation)) * S ((ge_representation_real_code_ring_representation) + (ge_representation_imaginary_code_ring_representation)) + ((ge_representation_imaginary_code_ring_representation) + (ge_representation_imaginary_code_ring_representation))) /\ ((exists ge_balance_positive_ring_representationreal ge_balance_negative_ring_representationreal. (((((ge_representation_real_code_ring_representation) = 2 * (ge_balance_positive_ring_representationreal) /\ (ge_balance_negative_ring_representationreal) = 0) \/ exists ge_signed_half_ring_representationrealdecode. (((ge_representation_real_code_ring_representation) = 2 * ge_signed_half_ring_representationrealdecode + 1 /\ (ge_balance_positive_ring_representationreal) = 0) /\ (ge_balance_negative_ring_representationreal) = S ge_signed_half_ring_representationrealdecode))) /\ ((ap) + ge_balance_negative_ring_representationreal = (an) + ge_balance_positive_ring_representationreal))) /\ (exists ge_balance_positive_ring_representationimaginary ge_balance_negative_ring_representationimaginary. (((((ge_representation_imaginary_code_ring_representation) = 2 * (ge_balance_positive_ring_representationimaginary) /\ (ge_balance_negative_ring_representationimaginary) = 0) \/ exists ge_signed_half_ring_representationimaginarydecode. (((ge_representation_imaginary_code_ring_representation) = 2 * ge_signed_half_ring_representationimaginarydecode + 1 /\ (ge_balance_positive_ring_representationimaginary) = 0) /\ (ge_balance_negative_ring_representationimaginary) = S ge_signed_half_ring_representationimaginarydecode))) /\ ((bp) + ge_balance_negative_ring_representationimaginary = (bn) + ge_balance_positive_ring_representationimaginary))))))Constructive proof overview
Generated structural guide
Every valid canonical Gaussian code has actual signed-coordinate representatives.
The unchanged tactic script uses 1 declared prerequisite and contains 17 exact native proof lines.
Alpha v34 checked-use · first admitted v30 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
gaussian_decode_representation Alpha theorem; checked-use authorizedDirect dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.
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–2
02Separate the logical casesL3–6
03Construct an explicit witnessL7–10
04Use earlier factsL11–17
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L11
specialize gaussian_decode_representation (z) - L12
specialize gaussian_decode_representation (x) - L13
specialize gaussian_decode_representation (x1) - L14
specialize gaussian_decode_representation (x2) - L15
specialize gaussian_decode_representation (x3) - L16
apply gaussian_decode_representation - L17
exact h_witness_witness_witness_witness
Original exact command ledger · 17 lines
- 0001
intro z - 0002
intro h - 0003
cases h - 0004
cases h_witness - 0005
cases h_witness_witness - 0006
cases h_witness_witness_witness - 0007
exists (x) - 0008
exists (x1) - 0009
exists (x2) - 0010
exists (x3) - 0011
specialize gaussian_decode_representation (z) - 0012
specialize gaussian_decode_representation (x) - 0013
specialize gaussian_decode_representation (x1) - 0014
specialize gaussian_decode_representation (x2) - 0015
specialize gaussian_decode_representation (x3) - 0016
apply gaussian_decode_representation - 0017
exact h_witness_witness_witness_witness