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 n. (exists fsl_a_fslf_natural fsl_b_fslf_natural fsl_c_fslf_natural fsl_d_fslf_natural. (n) = fsl_a_fslf_natural * fsl_a_fslf_natural + fsl_b_fslf_natural * fsl_b_fslf_natural + fsl_c_fslf_natural * fsl_c_fslf_natural + fsl_d_fslf_natural * fsl_d_fslf_natural)Constructive proof overview
Generated structural guide
Lagrange's complete four-square theorem: every natural number has an unconditionally constructive, independently kernel-checked representation as a sum of four natural squares.
The unchanged tactic script uses 2 declared prerequisites and contains 2 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 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.