FS005U

four_square_signed_dot_positive

Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable

A positively oriented coordinate contributes its centered square modulo the multiplier.

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. (exists ftcn_left_fssq_dot_positive_source ftcn_right_fssq_dot_positive_source. (a) + (k) * ftcn_left_fssq_dot_positive_source = (e) + (k) * ftcn_right_fssq_dot_positive_source) -> (exists ftcn_left_fssq_dot_positive_result ftcn_right_fssq_dot_positive_result. (a * e) + (k) * ftcn_left_fssq_dot_positive_result = (e * e) + (k) * ftcn_right_fssq_dot_positive_result)

Constructive proof overview

Generated structural guide

A positively oriented coordinate contributes its centered square modulo the multiplier.

The unchanged tactic script uses 1 declared prerequisite and contains 10 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

Historical empty-context replay experiment only; that experiment persisted no certificate and granted no release authority. Current checked use follows separately sealed, independently verified proof bundles; there is no Stable promotion.

Proof neighborhood

Direct dependencies

mod_eq_mul_right Stable theorem; checked-use authorized

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

10 script commands · 2 reading checkpoints · 0 local claims

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–4

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro k
  2. L2
    intro a
  3. L3
    intro e
  4. L4
    intro ha
02Use earlier factsL5–10

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L5
    specialize mod_eq_mul_right k
  2. L6
    specialize mod_eq_mul_right a
  3. L7
    specialize mod_eq_mul_right e
  4. L8
    specialize mod_eq_mul_right e
  5. L9
    apply mod_eq_mul_right
  6. L10
    exact ha

Library-wide reading audit

Original exact command ledger · 10 lines
  1. 0001intro k
  2. 0002intro a
  3. 0003intro e
  4. 0004intro ha
  5. 0005specialize mod_eq_mul_right k
  6. 0006specialize mod_eq_mul_right a
  7. 0007specialize mod_eq_mul_right e
  8. 0008specialize mod_eq_mul_right e
  9. 0009apply mod_eq_mul_right
  10. 0010exact ha