view_obstruction_offset_bot
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
- view_obstruction_offsetThe offset δ_U^2 of a linear subspace U in ℝ^n, defined as the infimum over integer vectors z ∈ ℤ^n of the squared norm of the orthogonal…
- view_obstruction_centerThe center point c = (1/2, ..., 1/2) of the shifted lattice in Euclidean space ℝ^n.
- int_to_euclideanThe canonical embedding of an integer vector z ∈ ℤ^n into the Euclidean space ℝ^n.
- postage_stamp_number_neg_two_of_odd_dvd_eqIf 0 < N, N ∣ D and 0 < D < 2N, then D = N.
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.
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.
uses
postage_stamp_number_neg_two_of_odd_dvd_eqtheorem 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.
- The proof script on line 2 attempts several tactics that reference `postage_stamp_number_neg_two_of_odd_dvd_eq` (an unrelated number-theoretic lemma produced by automated proof search). The goal is closed solely by unfolding `view_obstruction_offset` and running `simpa`, which simplifies the orthogonal projection onto `⊥` and the infimum to 0 without actually utilizing the cited lemma.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- 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)