Bergelson's intersectivity lemma
ProvedFamousTheorems.bergelson_intersectivity_lemmaBergelson's intersectivity lemma. Let be a finite measure and an infinite family of measurable sets with for all . Then there is an infinite set of indices such that every finite intersection , with finite, has positive measure.
Bergelson proved this in 1985. It is the measure-theoretic core of several density Ramsey theorems. Through Furstenberg's correspondence principle, it shows for example that any set of integers of positive upper density contains, up to a shift, a subset whose finite intersections are all large.
Formalization note. Mathlib's bergelson. The index type is any infinite type. The lower bound lies in and is assumed nonzero, and finite subsets of are sets u ⊆ t with u.Finite.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem bergelson_intersectivity_lemma {ι α : Type*} [MeasurableSpace α] {μ : MeasureTheory.Measure α} [MeasureTheory.IsFiniteMeasure μ]
{r : ENNReal} [Infinite ι] {s : ι → Set α} (hs : ∀ i, MeasurableSet (s i)) (hr₀ : r ≠ 0)
(hr : ∀ i, r ≤ μ (s i)) :
∃ t : Set ι, t.Infinite ∧ ∀ ⦃u : Set ι⦄, u ⊆ t → u.Finite → 0 < μ (⋂ i ∈ u, s i) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `bergelson`. Proof here reduces to that Mathlib result.