GF006D

gaussian_search_natural_le_square

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

Every natural is at most its square, including zero, by constructive equality decision.

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 n. (exists ge_gap_natural_square. ge_gap_natural_square + (n) = (n*n))

Constructive proof overview

Generated structural guide

Every natural is at most its square, including zero, by constructive equality decision.

The unchanged tactic script uses 2 declared prerequisites and contains 12 exact native proof lines.

Alpha v34 checked-use · first admitted v30 · independently kernel and Lean verified; not Stable

Proof neighborhood

Direct dependencies

eq_decidable Stable theorem; checked-use authorized le_scaled_nonzero 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

12 script commands · 6 reading checkpoints · 1 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–1

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

  1. L1
    intro n
02Establish hnL2–5

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply eq decidable.

  1. L2
    have hn : n=0 \/ ~(n=0)
  2. L3
    specialize eq_decidable (n)
  3. L4
    specialize eq_decidable (0)
  4. L5
    apply eq_decidable
03Separate the logical casesL6–6

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L6
    cases hn
04Construct an explicit witnessL7–7

Supply the displayed value, then prove that it has the required property.

  1. L7
    exists 0
05Calculate and transport equalitiesL8–8

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

  1. L8
    simp [hn_left]
06Use earlier factsL9–12

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

  1. L9
    specialize le_scaled_nonzero (n)
  2. L10
    specialize le_scaled_nonzero (n)
  3. L11
    apply le_scaled_nonzero
  4. L12
    exact hn_right

Library-wide reading audit

Original exact command ledger · 12 lines
  1. 0001intro n
  2. 0002have hn : n=0 \/ ~(n=0)
  3. 0003specialize eq_decidable (n)
  4. 0004specialize eq_decidable (0)
  5. 0005apply eq_decidable
  6. 0006cases hn
  7. 0007exists 0
  8. 0008simp [hn_left]
  9. 0009specialize le_scaled_nonzero (n)
  10. 0010specialize le_scaled_nonzero (n)
  11. 0011apply le_scaled_nonzero
  12. 0012exact hn_right