Theorem 8.6.1 — pairwise intersecting d-intervals have a transversal of size 2d²
ProvedMatousekLP.DIntervals.transversal_two_d_sqd-intervalsdiscrete-geometryhelly-typep2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1transversals
Let and let be a finite family of -intervals (unions of closed intervals on the real line) such that for every . Then has a transversal of size : there is a set with
For this is the one-dimensional Helly theorem up to a constant (pairwise intersecting intervals even have a common point); for no common point need exist, and the theorem shows that a number of points depending only on always suffices. The bound is Alon's (1998); Kaiser (1997) obtained with topological methods.
Formalization Note is a Finset ℝ of cardinality at most ("there exist points", which may coincide). The empty family is allowed; it is covered by .
Preamble
import Mathlib import Definitions.Def_MatousekLP_DIntervals_DInterval
Formal statement
namespace MatousekLP.DIntervals
/-- Theorem 8.6.1 (p. 178): a finite family `𝒥` of `d`-intervals with `J₁ ∩ J₂ ≠ ∅` for every
`J₁, J₂ ∈ 𝒥` has a transversal of size `2d²`: a set `X` of at most `2d²` real numbers such that
every `J ∈ 𝒥` contains at least one point of `X`. -/
theorem transversal_two_d_sq {d : ℕ} (hd : 1 ≤ d) (𝒥 : Finset (DInterval d))
(h𝒥 : PairwiseIntersecting 𝒥) :
∃ X : Finset ℝ, X.card ≤ 2 * d ^ 2 ∧ ∀ J ∈ 𝒥, ∃ p ∈ X, p ∈ J.toSet := by sorry
end MatousekLP.DIntervals
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 178, Theorem 8.6.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.