Active-containment interval routing through extreme faces
ProvedHirsch.face_interval_cover_route_bound_of_active_containmentextreme-faceshirsch-conjecturepath-repairpolyhedra
If each valid interval of a finite checkpoint sequence stays inside its supporting extreme face throughout the interval, the endpoint vertices are joined by a padded parent-edge walk whose length is at most the sum of the supplied intrinsic face-diameter budgets.
Preamble
import Mathlib import Mathlib.Analysis.Convex.KreinMilman import Definitions.Def_Hirsch_model open scoped BigOperators RealInnerProductSpace open Set Hirsch
Formal statement
namespace Hirsch
theorem face_interval_cover_route_bound_of_active_containment
{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 : ℕ)
(hvalid : ∀ i, s i ≤ t i)
(hbound : ∀ i, t i ≤ L)
(hverts : ∀ i, w (s i) ∈ extremePoints ℝ P ∧ w (t i) ∈ extremePoints ℝ P)
(hcover : ∀ k < L, ∃ i, s i ≤ k ∧ k + 1 ≤ t i)
(hactive : ∀ i k, s i ≤ k → k ≤ t i → w k ∈ F i) :
∃ q : ℕ → EuclideanSpace ℝ (Fin d),
q 0 = w 0 ∧ q (∑ i, B i) = w L ∧
∀ r < ∑ i, B i,
q r = q (r + 1) ∨ Adj P (q r) (q (r + 1)) := by sorry
end HirschSource
Kernel-verified theorem from jjoshua2/prove2me-work PR #48/#50.