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 h r a b c d e f g j. ((~(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)) -> ~(k = 0) -> ~(k = 1) -> (exists gap. gap + S k = p) -> k = 2 * h + 1 -> p * k = a * a + b * b + c * c + d * d -> (((exists fsd_center_bound_odd_step_a. fsd_center_bound_odd_step_a + (e + e) = k) /\ ((exists fsd_center_lower_odd_step_a. a = k * fsd_center_lower_odd_step_a + e) \/ (exists fsd_center_upper_odd_step_a. a + e = k * fsd_center_upper_odd_step_a)))) -> (((exists fsd_center_bound_odd_step_b. fsd_center_bound_odd_step_b + (f + f) = k) /\ ((exists fsd_center_lower_odd_step_b. b = k * fsd_center_lower_odd_step_b + f) \/ (exists fsd_center_upper_odd_step_b. b + f = k * fsd_center_upper_odd_step_b)))) -> (((exists fsd_center_bound_odd_step_c. fsd_center_bound_odd_step_c + (g + g) = k) /\ ((exists fsd_center_lower_odd_step_c. c = k * fsd_center_lower_odd_step_c + g) \/ (exists fsd_center_upper_odd_step_c. c + g = k * fsd_center_upper_odd_step_c)))) -> (((exists fsd_center_bound_odd_step_d. fsd_center_bound_odd_step_d + (j + j) = k) /\ ((exists fsd_center_lower_odd_step_d. d = k * fsd_center_lower_odd_step_d + j) \/ (exists fsd_center_upper_odd_step_d. d + j = k * fsd_center_upper_odd_step_d)))) -> k * r = e * e + f * f + g * g + j * j -> (exists fsl_a_odd_step_representation fsl_b_odd_step_representation fsl_c_odd_step_representation fsl_d_odd_step_representation. (p * r) = fsl_a_odd_step_representation * fsl_a_odd_step_representation + fsl_b_odd_step_representation * fsl_b_odd_step_representation + fsl_c_odd_step_representation * fsl_c_odd_step_representation + fsl_d_odd_step_representation * fsl_d_odd_step_representation) -> exists s. (~(s = 0) /\ ((exists gap. gap + S s = k) /\ (exists fsl_a_odd_step_smaller fsl_b_odd_step_smaller fsl_c_odd_step_smaller fsl_d_odd_step_smaller. (p * s) = fsl_a_odd_step_smaller * fsl_a_odd_step_smaller + fsl_b_odd_step_smaller * fsl_b_odd_step_smaller + fsl_c_odd_step_smaller * fsl_c_odd_step_smaller + fsl_d_odd_step_smaller * fsl_d_odd_step_smaller)))Constructive proof overview
Generated structural guide
For every proper nonunit odd prime multiplier, any represented signed centered quotient automatically gives a nonzero strictly smaller represented multiplier.
The unchanged tactic script uses 3 declared prerequisites and contains 77 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
FS0023 four_square_descent_bounded_centered_quotient_nonzero FS001Y four_square_descent_odd_centered_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–10
02Fix variables and assumptionsL11–20
03Fix variables and assumptionsL21–24
04Establish hnonzeroL25–34
Establish this local claim before using it. It is not an additional assumption.
- L25
have hnonzero : ~(r = 0) - L26
intro hrzero - L27
specialize four_square_descent_bounded_centered_quotient_nonzero p - L28
specialize four_square_descent_bounded_centered_quotient_nonzero k - L29
specialize four_square_descent_bounded_centered_quotient_nonzero r - L30
specialize four_square_descent_bounded_centered_quotient_nonzero a - L31
specialize four_square_descent_bounded_centered_quotient_nonzero b - L32
specialize four_square_descent_bounded_centered_quotient_nonzero c - L33
specialize four_square_descent_bounded_centered_quotient_nonzero d - L34
specialize four_square_descent_bounded_centered_quotient_nonzero e
05Use earlier factsL35–44
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L35
specialize four_square_descent_bounded_centered_quotient_nonzero f - L36
specialize four_square_descent_bounded_centered_quotient_nonzero g - L37
specialize four_square_descent_bounded_centered_quotient_nonzero j - L38
apply four_square_descent_bounded_centered_quotient_nonzero - L39
exact hprime - L40
exact hk - L41
exact hnonunit - L42
exact hproper - L43
exact hnorm - L44
exact ha
06Use earlier factsL45–49
07Establish hnormboundL50–59
Establish this local claim before using it. It is not an additional assumption.
- L50
have hnormbound : exists gap. gap + S (e * e + f * f + g * g + j * j) = k * k - L51
specialize four_square_descent_odd_centered_norm_strict k - L52
specialize four_square_descent_odd_centered_norm_strict h - L53
specialize four_square_descent_odd_centered_norm_strict a - L54
specialize four_square_descent_odd_centered_norm_strict b - L55
specialize four_square_descent_odd_centered_norm_strict c - L56
specialize four_square_descent_odd_centered_norm_strict d - L57
specialize four_square_descent_odd_centered_norm_strict e - L58
specialize four_square_descent_odd_centered_norm_strict f - L59
specialize four_square_descent_odd_centered_norm_strict g
08Use earlier factsL60–66
09Construct an explicit witnessL67–67
Supply the displayed value, then prove that it has the required property.
- L67
exists r
10Separate the logical casesL68–68
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L68
split
11Use earlier factsL69–69
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L69
exact hnonzero
12Separate the logical casesL70–70
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L70
split
13Use earlier factsL71–77
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L71
specialize four_square_descent_norm_bound_forces_smaller_multiplier k - L72
specialize four_square_descent_norm_bound_forces_smaller_multiplier r - L73
specialize four_square_descent_norm_bound_forces_smaller_multiplier (e * e + f * f + g * g + j * j) - L74
apply four_square_descent_norm_bound_forces_smaller_multiplier - L75
exact hcenter_norm - L76
exact hnormbound - L77
exact hrepresented
Original exact command ledger · 77 lines
- 0001
intro p - 0002
intro k - 0003
intro h - 0004
intro r - 0005
intro a - 0006
intro b - 0007
intro c - 0008
intro d - 0009
intro e - 0010
intro f - 0011
intro g - 0012
intro j - 0013
intro hprime - 0014
intro hk - 0015
intro hnonunit - 0016
intro hproper - 0017
intro hodd - 0018
intro hnorm - 0019
intro ha - 0020
intro hb - 0021
intro hc - 0022
intro hd - 0023
intro hcenter_norm - 0024
intro hrepresented - 0025
have hnonzero : ~(r = 0) - 0026
intro hrzero - 0027
specialize four_square_descent_bounded_centered_quotient_nonzero p - 0028
specialize four_square_descent_bounded_centered_quotient_nonzero k - 0029
specialize four_square_descent_bounded_centered_quotient_nonzero r - 0030
specialize four_square_descent_bounded_centered_quotient_nonzero a - 0031
specialize four_square_descent_bounded_centered_quotient_nonzero b - 0032
specialize four_square_descent_bounded_centered_quotient_nonzero c - 0033
specialize four_square_descent_bounded_centered_quotient_nonzero d - 0034
specialize four_square_descent_bounded_centered_quotient_nonzero e - 0035
specialize four_square_descent_bounded_centered_quotient_nonzero f - 0036
specialize four_square_descent_bounded_centered_quotient_nonzero g - 0037
specialize four_square_descent_bounded_centered_quotient_nonzero j - 0038
apply four_square_descent_bounded_centered_quotient_nonzero - 0039
exact hprime - 0040
exact hk - 0041
exact hnonunit - 0042
exact hproper - 0043
exact hnorm - 0044
exact ha - 0045
exact hb - 0046
exact hc - 0047
exact hd - 0048
exact hcenter_norm - 0049
exact hrzero - 0050
have hnormbound : exists gap. gap + S (e * e + f * f + g * g + j * j) = k * k - 0051
specialize four_square_descent_odd_centered_norm_strict k - 0052
specialize four_square_descent_odd_centered_norm_strict h - 0053
specialize four_square_descent_odd_centered_norm_strict a - 0054
specialize four_square_descent_odd_centered_norm_strict b - 0055
specialize four_square_descent_odd_centered_norm_strict c - 0056
specialize four_square_descent_odd_centered_norm_strict d - 0057
specialize four_square_descent_odd_centered_norm_strict e - 0058
specialize four_square_descent_odd_centered_norm_strict f - 0059
specialize four_square_descent_odd_centered_norm_strict g - 0060
specialize four_square_descent_odd_centered_norm_strict j - 0061
apply four_square_descent_odd_centered_norm_strict - 0062
exact hodd - 0063
exact ha - 0064
exact hb - 0065
exact hc - 0066
exact hd - 0067
exists r - 0068
split - 0069
exact hnonzero - 0070
split - 0071
specialize four_square_descent_norm_bound_forces_smaller_multiplier k - 0072
specialize four_square_descent_norm_bound_forces_smaller_multiplier r - 0073
specialize four_square_descent_norm_bound_forces_smaller_multiplier (e * e + f * f + g * g + j * j) - 0074
apply four_square_descent_norm_bound_forces_smaller_multiplier - 0075
exact hcenter_norm - 0076
exact hnormbound - 0077
exact hrepresented