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. (exists pp_odd_pi_odd_norm. (m * m + n * n) = 2 * pp_odd_pi_odd_norm + 1) -> ((((exists pp_even_pi_norm_parameters_first_even. (m) = 2 * pp_even_pi_norm_parameters_first_even) /\ (exists pp_odd_pi_norm_parameters_second_odd. (n) = 2 * pp_odd_pi_norm_parameters_second_odd + 1)) \/ ((exists pp_odd_pi_norm_parameters_first_odd. (m) = 2 * pp_odd_pi_norm_parameters_first_odd + 1) /\ (exists pp_even_pi_norm_parameters_second_even. (n) = 2 * pp_even_pi_norm_parameters_second_even))))Constructive proof overview
Generated structural guide
An odd sum of two squares supplies a constructive choice of opposite parity for their roots.
The unchanged tactic script uses 3 declared prerequisites and contains 23 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
odd_sum_parity_cases Alpha theorem; checked-use authorized PF001P pythagorean_even_square_has_even_root PF0015 pythagorean_odd_square_has_odd_rootDirect 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–3
02Establish hparityL4–8
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply odd sum parity cases.
- L4
have hparity : (((exists pp_even_pi_norm_square_parity_first_even. (m * m) = 2 * pp_even_pi_norm_square_parity_first_even) /\ (exists pp_odd_pi_norm_square_parity_second_odd. (n * n) = 2 * pp_odd_pi_norm_square_parity_second_odd + 1)) \/ ((exists pp_odd_pi_norm_square_parity_first_odd. (m * m) = 2 * pp_odd_pi_norm_square_parity_first_odd + 1) /\ (exists pp_even_pi_norm_square_parity_second_even. (n * n) = 2 * pp_even_pi_norm_square_parity_second_even))) - L5
specialize odd_sum_parity_cases (m * m) - L6
specialize odd_sum_parity_cases (n * n) - L7
apply odd_sum_parity_cases - L8
exact hodd
03Separate the logical casesL9–12
04Use earlier factsL13–16
05Separate the logical casesL17–19
Original exact command ledger · 23 lines
- 0001
intro m - 0002
intro n - 0003
intro hodd - 0004
have hparity : (((exists pp_even_pi_norm_square_parity_first_even. (m * m) = 2 * pp_even_pi_norm_square_parity_first_even) /\ (exists pp_odd_pi_norm_square_parity_second_odd. (n * n) = 2 * pp_odd_pi_norm_square_parity_second_odd + 1)) \/ ((exists pp_odd_pi_norm_square_parity_first_odd. (m * m) = 2 * pp_odd_pi_norm_square_parity_first_odd + 1) /\ (exists pp_even_pi_norm_square_parity_second_even. (n * n) = 2 * pp_even_pi_norm_square_parity_second_even))) - 0005
specialize odd_sum_parity_cases (m * m) - 0006
specialize odd_sum_parity_cases (n * n) - 0007
apply odd_sum_parity_cases - 0008
exact hodd - 0009
cases hparity - 0010
cases hparity_left - 0011
left - 0012
split - 0013
apply pythagorean_even_square_has_even_root - 0014
exact hparity_left_left - 0015
apply pythagorean_odd_square_has_odd_root - 0016
exact hparity_left_right - 0017
cases hparity_right - 0018
right - 0019
split - 0020
apply pythagorean_odd_square_has_odd_root - 0021
exact hparity_right_left - 0022
apply pythagorean_even_square_has_even_root - 0023
exact hparity_right_right