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 m n d. m * m = n * n + d -> (exists a. m = 2 * a) -> (exists b. n = 2 * b + 1) -> exists q. d = 2 * q + 1Constructive proof overview
Generated structural guide
An even first parameter and odd second parameter force their witnessed square difference to be odd.
The unchanged tactic script uses 5 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
PF000H pythagorean_parameter_even_square PF000I pythagorean_parameter_odd_square parity_cases Stable theorem; checked-use authorized odd_add_even Stable theorem; checked-use authorized even_odd_exclusive_pointwise Stable theorem; checked-use authorizedDirect 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 (2)
01Fix variables and assumptionsL1–6
02Establish hmsquareL7–9
03Establish hnsquareL10–13
04Separate the logical casesL14–16
05Establish hsumoddL17–21
06Construct an explicit witnessL22–22
Supply the displayed value, then prove that it has the required property.
- L22
exists x
07Use earlier factsL23–23
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L23
exact parity_cases_witness_left
08Separate the logical casesL24–25
09Use earlier factsL26–30
10Calculate and transport equalitiesL31–31
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L31
trans n * n + d
11Use earlier factsL32–33
12Construct an explicit witnessL34–34
Supply the displayed value, then prove that it has the required property.
- L34
exists x
13Use earlier factsL35–35
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L35
exact parity_cases_witness_right
Original exact command ledger · 35 lines
- 0001
intro m - 0002
intro n - 0003
intro d - 0004
intro hgap - 0005
intro hmeven - 0006
intro hnodd - 0007
have hmsquare : exists q. m * m = 2 * q - 0008
apply pythagorean_parameter_even_square - 0009
exact hmeven - 0010
have hnsquare : exists q. n * n = 2 * q + 1 - 0011
apply pythagorean_parameter_odd_square - 0012
exact hnodd - 0013
specialize parity_cases d - 0014
cases parity_cases - 0015
cases parity_cases_witness - 0016
exfalso - 0017
have hsumodd : exists q. n * n + d = 2 * q + 1 - 0018
specialize odd_add_even (n * n) - 0019
specialize odd_add_even d - 0020
apply odd_add_even - 0021
exact hnsquare - 0022
exists x - 0023
exact parity_cases_witness_left - 0024
cases hmsquare - 0025
cases hsumodd - 0026
specialize even_odd_exclusive_pointwise (m * m) - 0027
specialize even_odd_exclusive_pointwise x1 - 0028
specialize even_odd_exclusive_pointwise x2 - 0029
apply even_odd_exclusive_pointwise - 0030
exact hmsquare_witness - 0031
trans n * n + d - 0032
exact hgap - 0033
exact hsumodd_witness - 0034
exists x - 0035
exact parity_cases_witness_right