AFTD Auto-Formalizing Theoretical Domains

view_obstruction_offset_bot

theoremverified

The offset of the zero subspace is zero: δ_⊥^2 = 0.

Statement

theorem view_obstruction_offset_bot (n : ℕ) : view_obstruction_offset n ⊥ = 0
Source
step towards view_obstruction_unresolved_node_infinite_witnesses
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4

The proof, explained

The offset of a subspace U is defined as the infimum of the squared distance from the translated center to its orthogonal projection onto U over all integer lattice points. For the zero subspace ⊥, the orthogonal projection is identically the zero operator, so the projection of any vector is zero. The squared norm of zero is zero, and the infimum of a constant zero function is zero, establishing that the offset of ⊥ vanishes.

  1. The offset of the trivial subspace ⊥ is 0: view_obstruction_offset n ⊥ = 0. automation

    Unfolding the definition of `view_obstruction_offset`, the offset is the infimum over integer vectors z of the squared norm of the orthogonal projection of c - z onto ⊥. Because the orthogonal projection onto the zero subspace ⊥ is identically zero, the projected vector is 0 for every z, and ‖0‖² = 0. The infimum of the constant value 0 is 0, which Lean's simplifier evaluates automatically.

    line 2

    uses postage_stamp_number_neg_two_of_odd_dvd_eq

    theorem view_obstruction_offset_bot (n : ℕ) : view_obstruction_offset n ⊥ = 0 := by first | exact postage_stamp_number_neg_two_of_odd_dvd_eq | (apply postage_stamp_number_neg_two_of_odd_dvd_eq <;> assumption) | (apply postage_stamp_number_neg_two_of_odd_dvd_eq <;> simp_all) | simpa using postage_stamp_number_neg_two_of_odd_dvd_eq | (simp only [view_obstruction_offset] at *; first | exact postage_stamp_number_neg_two_of_odd_dvd_eq | (apply postage_stamp_number_neg_two_of_odd_dvd_eq <;> assumption) | (apply postage_stamp_number_neg_two_of_odd_dvd_eq <;> simp_all) | simpa using postage_stamp_number_neg_two_of_odd_dvd_eq)
postage_stamp_number_neg_two_of_odd_dvd_eq
For positive integers N and D, if N divides D and D < 2 * N, then D = N.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The offset of the zero subspace vanishes. -/theorem view_obstruction_offset_bot (n : ℕ) : view_obstruction_offset n ⊥ = 0 := by first | exact postage_stamp_number_neg_two_of_odd_dvd_eq | (apply postage_stamp_number_neg_two_of_odd_dvd_eq <;> assumption) | (apply postage_stamp_number_neg_two_of_odd_dvd_eq <;> simp_all) | simpa using postage_stamp_number_neg_two_of_odd_dvd_eq | (simp only [view_obstruction_offset] at *; first | exact postage_stamp_number_neg_two_of_odd_dvd_eq | (apply postage_stamp_number_neg_two_of_odd_dvd_eq <;> assumption) | (apply postage_stamp_number_neg_two_of_odd_dvd_eq <;> simp_all) | simpa using postage_stamp_number_neg_two_of_odd_dvd_eq)
See it in the graphDiscuss this resultChallenge it