Portal-backed crossing interval repair through extreme faces
ProvedHirsch.face_interval_cover_route_boundgraph-diameterhirsch-conjecturepath-repairpolyhedra
If repair intervals cover every old step and every chronological overlap is backed by a genuine shared parent vertex between the corresponding extreme faces, the endpoints admit a padded parent walk whose budget is the sum of the face diameter budgets.
Preamble
import Mathlib import Definitions.Def_Hirsch_model open scoped BigOperators RealInnerProductSpace open Set Hirsch
Formal statement
namespace Hirsch
theorem face_interval_cover_route_bound {d : ℕ} {ι : Type*} [Fintype ι]
(P : Set (EuclideanSpace ℝ (Fin d)))
(F : ι → Set (EuclideanSpace ℝ (Fin d))) (B : ι → ℕ)
(hF : ∀ i, IsExtreme ℝ P (F i)) (hD : ∀ i, DiamLE (F i) (B i))
(s t : ι → ℕ) (w : ℕ → EuclideanSpace ℝ (Fin d)) (L : ℕ)
(hbound : ∀ i, t i ≤ L)
(hverts : ∀ i, w (s i) ∈ extremePoints ℝ P ∧ w (t i) ∈ extremePoints ℝ P)
(hends : ∀ i, w (s i) ∈ F i ∧ w (t i) ∈ F i)
(hcover : ∀ k < L, ∃ i, s i ≤ k ∧ k + 1 ≤ t i)
(hportal : ∀ i j, s i ≤ t j → s j ≤ t i →
∃ z, z ∈ extremePoints ℝ P ∧ z ∈ F i ∧ z ∈ F j) :
∃ q : ℕ → EuclideanSpace ℝ (Fin d),
q 0 = w 0 ∧ q (∑ i, B i) = w L ∧
∀ j < ∑ i, B i, q j = q (j + 1) ∨ Adj P (q j) (q (j + 1)) := by sorry
end HirschSource
Verified Lean theorem from jjoshua2/prove2me-work PR #39.