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 k a e q. a + e = k * q -> (exists ftcn_left_fssq_opposite_square ftcn_right_fssq_opposite_square. (a * a) + (k) * ftcn_left_fssq_opposite_square = (e * e) + (k) * ftcn_right_fssq_opposite_square)Constructive proof overview
Generated structural guide
Oppositely signed modular representatives nevertheless have congruent natural squares.
The unchanged tactic script uses 2 declared prerequisites and contains 16 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
multiple_implies_balanced_zero_congruence Alpha theorem; checked-use authorized balanced_zero_sum_implies_squared_congruence Alpha 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.
01Fix variables and assumptionsL1–5
02Establish hzeroL6–9
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply multiple implies balanced zero congruence.
- L6
have hzero : exists ftcn_left_fssq_opposite_zero ftcn_right_fssq_opposite_zero. (a + e) + (k) * ftcn_left_fssq_opposite_zero = (0) + (k) * ftcn_right_fssq_opposite_zero - L7
specialize multiple_implies_balanced_zero_congruence k - L8
specialize multiple_implies_balanced_zero_congruence (a + e) - L9
apply multiple_implies_balanced_zero_congruence
03Construct an explicit witnessL10–10
Supply the displayed value, then prove that it has the required property.
- L10
exists q
04Use earlier factsL11–16
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original exact command ledger · 16 lines
- 0001
intro k - 0002
intro a - 0003
intro e - 0004
intro q - 0005
intro hrepresentation - 0006
have hzero : exists ftcn_left_fssq_opposite_zero ftcn_right_fssq_opposite_zero. (a + e) + (k) * ftcn_left_fssq_opposite_zero = (0) + (k) * ftcn_right_fssq_opposite_zero - 0007
specialize multiple_implies_balanced_zero_congruence k - 0008
specialize multiple_implies_balanced_zero_congruence (a + e) - 0009
apply multiple_implies_balanced_zero_congruence - 0010
exists q - 0011
exact hrepresentation - 0012
specialize balanced_zero_sum_implies_squared_congruence k - 0013
specialize balanced_zero_sum_implies_squared_congruence a - 0014
specialize balanced_zero_sum_implies_squared_congruence e - 0015
apply balanced_zero_sum_implies_squared_congruence - 0016
exact hzero