Gallagher's ergodic theorem
ProvedFamousTheorems.gallagher_ergodic_theoremGallagher's ergodic theorem. Let be a sequence of real numbers, and let be the set of points of the circle that are -well approximable. This means that for infinitely many there is a point of order exactly with . Then has measure or full measure.
This zero–one law is a key input to the Duffin–Schaeffer conjecture in metric Diophantine approximation, proved by Koukoulopoulos and Maynard. It reduces the problem to showing that the set of approximable points has positive measure.
Formalization note. Mathlib's AddCircle.addWellApproximable_ae_empty_or_univ. addWellApproximable (AddCircle T) δ is the set of points lying in infinitely many of the balls of radius around points of additive order . "Measure zero or full measure" is written as: almost every point is outside the set, or almost every point is inside it, for the Haar measure on the circle.
import Mathlib
namespace FamousTheorems
theorem gallagher_ergodic_theorem {T : ℝ} [Fact (0 < T)] (δ : ℕ → ℝ) (hδ : Filter.Tendsto δ Filter.atTop (nhds 0)) :
(∀ᵐ (x : AddCircle T), x ∉ addWellApproximable (AddCircle T) δ) ∨
∀ᵐ (x : AddCircle T), x ∈ addWellApproximable (AddCircle T) δ := by sorry
end FamousTheorems