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 fsd_prime_universal fsd_multiplier_universal. ((~(fsd_prime_universal = 1) /\ forall frm_prime_left_fsd_universal_prime frm_prime_right_fsd_universal_prime. fsd_prime_universal = frm_prime_left_fsd_universal_prime * frm_prime_right_fsd_universal_prime -> frm_prime_left_fsd_universal_prime = 1 \/ frm_prime_right_fsd_universal_prime = 1)) -> ~(fsd_multiplier_universal = 0) -> ~(fsd_multiplier_universal = 1) -> (exists fsl_a_fsd_universal_source fsl_b_fsd_universal_source fsl_c_fsd_universal_source fsl_d_fsd_universal_source. (fsd_prime_universal * fsd_multiplier_universal) = fsl_a_fsd_universal_source * fsl_a_fsd_universal_source + fsl_b_fsd_universal_source * fsl_b_fsd_universal_source + fsl_c_fsd_universal_source * fsl_c_fsd_universal_source + fsl_d_fsd_universal_source * fsl_d_fsd_universal_source) -> exists fsd_smaller_universal. (~(fsd_smaller_universal = 0) /\ ((exists fsd_gap_universal. fsd_gap_universal + S fsd_smaller_universal = fsd_multiplier_universal) /\ (exists fsl_a_fsd_universal_target fsl_b_fsd_universal_target fsl_c_fsd_universal_target fsl_d_fsd_universal_target. (fsd_prime_universal * fsd_smaller_universal) = fsl_a_fsd_universal_target * fsl_a_fsd_universal_target + fsl_b_fsd_universal_target * fsl_b_fsd_universal_target + fsl_c_fsd_universal_target * fsl_c_fsd_universal_target + fsl_d_fsd_universal_target * fsl_d_fsd_universal_target)))) -> forall p x y k. ((~(p = 1) /\ forall frm_prime_left_fsd_p frm_prime_right_fsd_p. p = frm_prime_left_fsd_p * frm_prime_right_fsd_p -> frm_prime_left_fsd_p = 1 \/ frm_prime_right_fsd_p = 1)) -> x * x + y * y + 1 = p * k -> (exists fsl_a_fsd_prime_result fsl_b_fsd_prime_result fsl_c_fsd_prime_result fsl_d_fsd_prime_result. (p) = fsl_a_fsd_prime_result * fsl_a_fsd_prime_result + fsl_b_fsd_prime_result * fsl_b_fsd_prime_result + fsl_c_fsd_prime_result * fsl_c_fsd_prime_result + fsl_d_fsd_prime_result * fsl_d_fsd_prime_result)Constructive proof overview
Generated structural guide
A concrete modular square seed and the explicit strict multiplier step suffice for an actual representation of the prime.
The unchanged tactic script uses 3 declared prerequisites and contains 28 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
FS001F four_square_descent_modular_seed_multiplier_nonzero FS003F four_square_prime_modular_seed_multiple FS001H four_square_descent_prime_from_strict_stepDirect 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 (3)
01Fix variables and assumptionsL1–7
02Establish hdescentL8–17
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply four square descent prime from strict step.
- L8
have hdescent : ∀ p. ∀ k. Prime(p) → ¬k = 0 → (∃ x. ∃ y. ∃ z. ∃ n. FourSquareNorm(p · k,x,y,z,n)) → ∃ x. ∃ y. ∃ z. ∃ n. FourSquareNorm(p,x,y,z,n)Definitions: FourSquareNormPrime - L9
apply four_square_descent_prime_from_strict_step - L10
exact hstep - L11
specialize hdescent p - L12
specialize hdescent k - L13
apply hdescent - L14
exact hprime - L15
specialize four_square_descent_modular_seed_multiplier_nonzero p - L16
specialize four_square_descent_modular_seed_multiplier_nonzero x - L17
specialize four_square_descent_modular_seed_multiplier_nonzero y
03Use earlier factsL18–18
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L18
specialize four_square_descent_modular_seed_multiplier_nonzero k
04Fix variables and assumptionsL19–19
Work with arbitrary variables or the premises of the current implication.
- L19
intro hzero
05Use earlier factsL20–28
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L20
apply four_square_descent_modular_seed_multiplier_nonzero - L21
exact hseed - L22
exact hzero - L23
specialize four_square_prime_modular_seed_multiple p - L24
specialize four_square_prime_modular_seed_multiple x - L25
specialize four_square_prime_modular_seed_multiple y - L26
specialize four_square_prime_modular_seed_multiple k - L27
apply four_square_prime_modular_seed_multiple - L28
exact hseed
Original exact command ledger · 28 lines
- 0001
intro hstep - 0002
intro p - 0003
intro x - 0004
intro y - 0005
intro k - 0006
intro hprime - 0007
intro hseed - 0008
have hdescent : forall p k. ((~(p = 1) /\ forall frm_prime_left_fsd_local_prime frm_prime_right_fsd_local_prime. p = frm_prime_left_fsd_local_prime * frm_prime_right_fsd_local_prime -> frm_prime_left_fsd_local_prime = 1 \/ frm_prime_right_fsd_local_prime = 1)) -> ~(k = 0) -> (exists fsl_a_fsd_local_multiple fsl_b_fsd_local_multiple fsl_c_fsd_local_multiple fsl_d_fsd_local_multiple. (p * k) = fsl_a_fsd_local_multiple * fsl_a_fsd_local_multiple + fsl_b_fsd_local_multiple * fsl_b_fsd_local_multiple + fsl_c_fsd_local_multiple * fsl_c_fsd_local_multiple + fsl_d_fsd_local_multiple * fsl_d_fsd_local_multiple) -> (exists fsl_a_fsd_local_result fsl_b_fsd_local_result fsl_c_fsd_local_result fsl_d_fsd_local_result. (p) = fsl_a_fsd_local_result * fsl_a_fsd_local_result + fsl_b_fsd_local_result * fsl_b_fsd_local_result + fsl_c_fsd_local_result * fsl_c_fsd_local_result + fsl_d_fsd_local_result * fsl_d_fsd_local_result) - 0009
apply four_square_descent_prime_from_strict_step - 0010
exact hstep - 0011
specialize hdescent p - 0012
specialize hdescent k - 0013
apply hdescent - 0014
exact hprime - 0015
specialize four_square_descent_modular_seed_multiplier_nonzero p - 0016
specialize four_square_descent_modular_seed_multiplier_nonzero x - 0017
specialize four_square_descent_modular_seed_multiplier_nonzero y - 0018
specialize four_square_descent_modular_seed_multiplier_nonzero k - 0019
intro hzero - 0020
apply four_square_descent_modular_seed_multiplier_nonzero - 0021
exact hseed - 0022
exact hzero - 0023
specialize four_square_prime_modular_seed_multiple p - 0024
specialize four_square_prime_modular_seed_multiple x - 0025
specialize four_square_prime_modular_seed_multiple y - 0026
specialize four_square_prime_modular_seed_multiple k - 0027
apply four_square_prime_modular_seed_multiple - 0028
exact hseed