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 p s n t. (exists ftcn_left_fssq_partition_positive ftcn_right_fssq_partition_positive. (p) + (k) * ftcn_left_fssq_partition_positive = (s) + (k) * ftcn_right_fssq_partition_positive) -> (exists ftcn_left_fssq_partition_negative ftcn_right_fssq_partition_negative. (n + t) + (k) * ftcn_left_fssq_partition_negative = (0) + (k) * ftcn_right_fssq_partition_negative) -> (exists ftcn_left_fssq_partition_norm ftcn_right_fssq_partition_norm. (s + t) + (k) * ftcn_left_fssq_partition_norm = (0) + (k) * ftcn_right_fssq_partition_norm) -> (exists ftcn_left_fssq_partition_result ftcn_right_fssq_partition_result. (p) + (k) * ftcn_left_fssq_partition_result = (n) + (k) * ftcn_right_fssq_partition_result)Constructive proof overview
Generated structural guide
Positive and negative signed dot-product groups balance when their combined centered square norm vanishes.
The unchanged tactic script uses 4 declared prerequisites and contains 34 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
mod_eq_refl Stable theorem; checked-use authorized mod_eq_add Stable theorem; checked-use authorized mod_eq_trans Stable theorem; checked-use authorized FS005L four_square_signed_common_zero_cancelDirect 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 (1)
01Fix variables and assumptionsL1–8
02Establish hpaddedL9–18
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply mod eq add.
- L9
have hpadded : exists ftcn_left_fssq_partition_padded ftcn_right_fssq_partition_padded. (p + t) + (k) * ftcn_left_fssq_partition_padded = (s + t) + (k) * ftcn_right_fssq_partition_padded - L10
specialize mod_eq_add k - L11
specialize mod_eq_add p - L12
specialize mod_eq_add s - L13
specialize mod_eq_add t - L14
specialize mod_eq_add t - L15
apply mod_eq_add - L16
exact hpositive - L17
specialize mod_eq_refl k - L18
specialize mod_eq_refl t
03Use earlier factsL19–19
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L19
exact mod_eq_refl
04Establish hzeroL20–29
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply mod eq trans.
- L20
have hzero : exists ftcn_left_fssq_partition_zero ftcn_right_fssq_partition_zero. (p + t) + (k) * ftcn_left_fssq_partition_zero = (0) + (k) * ftcn_right_fssq_partition_zero - L21
specialize mod_eq_trans k - L22
specialize mod_eq_trans (p + t) - L23
specialize mod_eq_trans (s + t) - L24
specialize mod_eq_trans 0 - L25
apply mod_eq_trans - L26
exact hpadded - L27
exact hnorm - L28
specialize four_square_signed_common_zero_cancel k - L29
specialize four_square_signed_common_zero_cancel p
Original exact command ledger · 34 lines
- 0001
intro k - 0002
intro p - 0003
intro s - 0004
intro n - 0005
intro t - 0006
intro hpositive - 0007
intro hnegative - 0008
intro hnorm - 0009
have hpadded : exists ftcn_left_fssq_partition_padded ftcn_right_fssq_partition_padded. (p + t) + (k) * ftcn_left_fssq_partition_padded = (s + t) + (k) * ftcn_right_fssq_partition_padded - 0010
specialize mod_eq_add k - 0011
specialize mod_eq_add p - 0012
specialize mod_eq_add s - 0013
specialize mod_eq_add t - 0014
specialize mod_eq_add t - 0015
apply mod_eq_add - 0016
exact hpositive - 0017
specialize mod_eq_refl k - 0018
specialize mod_eq_refl t - 0019
exact mod_eq_refl - 0020
have hzero : exists ftcn_left_fssq_partition_zero ftcn_right_fssq_partition_zero. (p + t) + (k) * ftcn_left_fssq_partition_zero = (0) + (k) * ftcn_right_fssq_partition_zero - 0021
specialize mod_eq_trans k - 0022
specialize mod_eq_trans (p + t) - 0023
specialize mod_eq_trans (s + t) - 0024
specialize mod_eq_trans 0 - 0025
apply mod_eq_trans - 0026
exact hpadded - 0027
exact hnorm - 0028
specialize four_square_signed_common_zero_cancel k - 0029
specialize four_square_signed_common_zero_cancel p - 0030
specialize four_square_signed_common_zero_cancel n - 0031
specialize four_square_signed_common_zero_cancel t - 0032
apply four_square_signed_common_zero_cancel - 0033
exact hzero - 0034
exact hnegative