Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 8.6.1 — pairwise intersecting d-intervals have a transversal of size 2d²

Proved
MatousekLP.DIntervals.transversal_two_d_sq

by mikedeng1 · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

d-intervalsdiscrete-geometryhelly-typep2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1transversals

Let d≥1d \ge 1d≥1 and let J\mathcal JJ be a finite family of ddd-intervals (unions of ddd closed intervals on the real line) such that J1∩J2≠∅J_1 \cap J_2 \ne \emptysetJ1​∩J2​=∅ for every J1,J2∈JJ_1, J_2 \in \mathcal JJ1​,J2​∈J. Then J\mathcal JJ has a transversal of size 2d22d^22d2: there is a set X⊂RX \subset \mathbb RX⊂R with

∣X∣  ≤  2d2andJ∩X≠∅  for every J∈J.|X| \;\le\; 2d^2 \qquad\text{and}\qquad J \cap X \ne \emptyset \ \text{ for every } J \in \mathcal J .∣X∣≤2d2andJ∩X=∅  for every J∈J.

For d=1d = 1d=1 this is the one-dimensional Helly theorem up to a constant (pairwise intersecting intervals even have a common point); for d≥2d \ge 2d≥2 no common point need exist, and the theorem shows that a number of points depending only on ddd always suffices. The bound 2d22d^22d2 is Alon's (1998); Kaiser (1997) obtained d2d^2d2 with topological methods.

Formalization Note XXX is a Finset ℝ of cardinality at most 2d22d^22d2 ("there exist 2d22d^22d2 points", which may coincide). The empty family is allowed; it is covered by X=∅X = \emptysetX=∅.

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
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me