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 p k r a b c d e f g h u v w x. ~(k = 0) -> ~(r = 0) -> (exists fsd_center_gap. fsd_center_gap + S r = k) -> p * k = (a * a + b * b + c * c + d * d) -> k * r = (e * e + f * f + g * g + h * h) -> ((((a * e) = (b * f + c * g + d * h) + (k * u)) \/ ((b * f + c * g + d * h) = (a * e) + (k * u))) /\ ((((a * f + b * e + c * h) = (d * g) + (k * v)) \/ ((d * g) = (a * f + b * e + c * h) + (k * v))) /\ ((((a * g + c * e + d * f) = (b * h) + (k * w)) \/ ((b * h) = (a * g + c * e + d * f) + (k * w))) /\ (((a * h + b * g + d * e) = (c * f) + (k * x)) \/ ((c * f) = (a * h + b * g + d * e) + (k * x)))))) -> (exists r. (~(r = 0) /\ ((exists fsd_strict_gap. fsd_strict_gap + S r = k) /\ (exists fsl_a_fsd_strict_result fsl_b_fsd_strict_result fsl_c_fsd_strict_result fsl_d_fsd_strict_result. (p * r) = fsl_a_fsd_strict_result * fsl_a_fsd_strict_result + fsl_b_fsd_strict_result * fsl_b_fsd_strict_result + fsl_c_fsd_strict_result * fsl_c_fsd_strict_result + fsl_d_fsd_strict_result * fsl_d_fsd_strict_result))))Constructive proof overview
Generated structural guide
Every explicit centered nonzero quaternion certificate constructs a genuinely represented strictly smaller prime multiplier.
The unchanged tactic script uses 1 declared prerequisite and contains 35 exact native proof lines.
dependency-curried kernel-checked theorem body; Alpha enrollment and checked-use authority follow separately sealed release evidence; Stable membership remains unchanged
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This dependency-curried candidate body does not grant checked theorem use or 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.
Named ingredients (1)
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–20
03Fix variables and assumptionsL21–21
Work with arbitrary variables or the premises of the current implication.
- L21
intro hbalances
04Construct an explicit witnessL22–22
Supply the displayed value, then prove that it has the required property.
- L22
exists r
05Separate the logical casesL23–23
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L23
split
06Use earlier factsL24–24
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L24
exact hr
07Separate the logical casesL25–25
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L25
split
08Use earlier factsL26–26
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
exact hstrict
09Construct an explicit witnessL27–30
Original exact command ledger · 35 lines
- 0001
intro p - 0002
intro k - 0003
intro r - 0004
intro a - 0005
intro b - 0006
intro c - 0007
intro d - 0008
intro e - 0009
intro f - 0010
intro g - 0011
intro h - 0012
intro u - 0013
intro v - 0014
intro w - 0015
intro x - 0016
intro hk - 0017
intro hr - 0018
intro hstrict - 0019
intro hfirst - 0020
intro hsecond - 0021
intro hbalances - 0022
exists r - 0023
split - 0024
exact hr - 0025
split - 0026
exact hstrict - 0027
exists u - 0028
exists v - 0029
exists w - 0030
exists x - 0031
apply four_square_descent_quaternion_quotient - 0032
exact hk - 0033
exact hfirst - 0034
exact hsecond - 0035
exact hbalances