FS001F

four_square_descent_modular_seed_multiplier_nonzero

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

A modular seed x²+y²+1=p·k has a constructively nonzero multiplier because its left side is a successor.

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 p x y k. x * x + y * y + 1 = p * k -> ~(k = 0)

Constructive proof overview

Generated structural guide

A modular seed x²+y²+1=p·k has a constructively nonzero multiplier because its left side is a successor.

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

succ_ne_zero 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

14 script commands · 5 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–6

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

  1. L1
    intro p
  2. L2
    intro x
  3. L3
    intro y
  4. L4
    intro k
  5. L5
    intro hseed
  6. L6
    intro hzero
02Calculate and transport equalitiesL7–8

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L7
    rewrite hzero at hseed
  2. L8
    rewrite PA5 at hseed
03Use earlier factsL9–10

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

  1. L9
    specialize succ_ne_zero (x * x + y * y)
  2. L10
    apply succ_ne_zero
04Calculate and transport equalitiesL11–13

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L11
    trans x * x + y * y + 1
  2. L12
    symm
  3. L13
    simp
05Use earlier factsL14–14

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

  1. L14
    exact hseed

Library-wide reading audit

Original exact command ledger · 14 lines
  1. 0001intro p
  2. 0002intro x
  3. 0003intro y
  4. 0004intro k
  5. 0005intro hseed
  6. 0006intro hzero
  7. 0007rewrite hzero at hseed
  8. 0008rewrite PA5 at hseed
  9. 0009specialize succ_ne_zero (x * x + y * y)
  10. 0010apply succ_ne_zero
  11. 0011trans x * x + y * y + 1
  12. 0012symm
  13. 0013simp
  14. 0014exact hseed