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 h. p = 2 * h + 1 -> ((~(p = 1) /\ forall frm_prime_left_fsbs_prime frm_prime_right_fsbs_prime. p = frm_prime_left_fsbs_prime * frm_prime_right_fsbs_prime -> frm_prime_left_fsbs_prime = 1 \/ frm_prime_right_fsbs_prime = 1)) -> (exists fsbs_a_odd_bounded fsbs_b_odd_bounded fsbs_k_odd_bounded. ((fsbs_a_odd_bounded * fsbs_a_odd_bounded + fsbs_b_odd_bounded * fsbs_b_odd_bounded + 1 = p * fsbs_k_odd_bounded) /\ (exists fsbs_lt_gap_odd_bounded_multiplier. fsbs_lt_gap_odd_bounded_multiplier + S (fsbs_k_odd_bounded) = (p))))Constructive proof overview
Generated structural guide
Every odd prime has an actual modular square seed with a strictly smaller natural multiplier.
The unchanged tactic script uses 3 declared prerequisites 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
FS000K four_square_odd_prime_half_coordinate_seed FS000M four_square_odd_prime_half_seed_norm_strict FS001O four_square_descent_norm_bound_forces_smaller_multiplierDirect 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.
Named ingredients (3)
01Fix variables and assumptionsL1–4
02Establish hseedL5–10
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply four square odd prime half coordinate seed.
- L5
have hseed : exists a b k. ((a * a + b * b + 1 = p * k) /\ ((exists gap. gap + a = h) /\ (exists gap. gap + b = h))) - L6
specialize four_square_odd_prime_half_coordinate_seed p - L7
specialize four_square_odd_prime_half_coordinate_seed h - L8
apply four_square_odd_prime_half_coordinate_seed - L9
exact hodd - L10
exact hprime
03Separate the logical casesL11–15
04Construct an explicit witnessL16–18
05Separate the logical casesL19–19
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L19
split
06Use earlier factsL20–24
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L20
exact hseed_witness_witness_witness_left - L21
specialize four_square_descent_norm_bound_forces_smaller_multiplier p - L22
specialize four_square_descent_norm_bound_forces_smaller_multiplier x2 - L23
specialize four_square_descent_norm_bound_forces_smaller_multiplier (x * x + x1 * x1 + 1) - L24
apply four_square_descent_norm_bound_forces_smaller_multiplier
07Calculate and transport equalitiesL25–25
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L25
symm
08Use earlier factsL26–35
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
exact hseed_witness_witness_witness_left - L27
specialize four_square_odd_prime_half_seed_norm_strict p - L28
specialize four_square_odd_prime_half_seed_norm_strict h - L29
specialize four_square_odd_prime_half_seed_norm_strict x - L30
specialize four_square_odd_prime_half_seed_norm_strict x1 - L31
apply four_square_odd_prime_half_seed_norm_strict - L32
exact hodd - L33
exact hprime - L34
exact hseed_witness_witness_witness_right_left - L35
exact hseed_witness_witness_witness_right_right
Original exact command ledger · 35 lines
- 0001
intro p - 0002
intro h - 0003
intro hodd - 0004
intro hprime - 0005
have hseed : exists a b k. ((a * a + b * b + 1 = p * k) /\ ((exists gap. gap + a = h) /\ (exists gap. gap + b = h))) - 0006
specialize four_square_odd_prime_half_coordinate_seed p - 0007
specialize four_square_odd_prime_half_coordinate_seed h - 0008
apply four_square_odd_prime_half_coordinate_seed - 0009
exact hodd - 0010
exact hprime - 0011
cases hseed - 0012
cases hseed_witness - 0013
cases hseed_witness_witness - 0014
cases hseed_witness_witness_witness - 0015
cases hseed_witness_witness_witness_right - 0016
exists x - 0017
exists x1 - 0018
exists x2 - 0019
split - 0020
exact hseed_witness_witness_witness_left - 0021
specialize four_square_descent_norm_bound_forces_smaller_multiplier p - 0022
specialize four_square_descent_norm_bound_forces_smaller_multiplier x2 - 0023
specialize four_square_descent_norm_bound_forces_smaller_multiplier (x * x + x1 * x1 + 1) - 0024
apply four_square_descent_norm_bound_forces_smaller_multiplier - 0025
symm - 0026
exact hseed_witness_witness_witness_left - 0027
specialize four_square_odd_prime_half_seed_norm_strict p - 0028
specialize four_square_odd_prime_half_seed_norm_strict h - 0029
specialize four_square_odd_prime_half_seed_norm_strict x - 0030
specialize four_square_odd_prime_half_seed_norm_strict x1 - 0031
apply four_square_odd_prime_half_seed_norm_strict - 0032
exact hodd - 0033
exact hprime - 0034
exact hseed_witness_witness_witness_right_left - 0035
exact hseed_witness_witness_witness_right_right