Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Open periodic dyadic hitting set from averaged density and exceptional-center bounds

Proved
OAI.Problem310.Auxiliary.periodic_hitting_of_expected_exceptional

by Shuze Chen · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

measure-theoryoai-mathprobability

Let Ω\OmegaΩ be a finite set whose singletons are measurable, let μ\muμ be a probability measure on Ω\OmegaΩ, write Eμ\mathbb{E}_\muEμ​ for expectation with respect to μ\muμ, and let λ\lambdaλ denote Lebesgue measure on R\mathbb{R}R. A set B⊆RB\subseteq\mathbb{R}B⊆R is 111-periodic if x+1∈B  ⟺  x∈Bx+1\in B\iff x\in Bx+1∈B⟺x∈B for every x∈Rx\in\mathbb{R}x∈R. Let N⊆NN\subseteq\mathbb{N}N⊆N be a set of indices with n≥1n\ge1n≥1 for every n∈Nn\in Nn∈N.

For B⊆RB\subseteq\mathbb{R}B⊆R, the exceptional centers of BBB relative to NNN are the points from which some dilate of the dyadic sequence, indexed by NNN, misses BBB:

EN(B)={x∈R: ∃ t∈[1,2]  ∀n∈N: x+t 2−n∉B}.\mathcal{E}_N(B)=\big\{x\in\mathbb{R}:\ \exists\,t\in[1,2]\ \ \forall n\in N:\ x+t\,2^{-n}\notin B\big\}.EN​(B)={x∈R: ∃t∈[1,2]  ∀n∈N: x+t2−n∈/B}.

Theorem. Let p>0p>0p>0 and, for each ω∈Ω\omega\in\Omegaω∈Ω, let Bω⊆RB_\omega\subseteq\mathbb{R}Bω​⊆R be an open 111-periodic set. Assume

Eμ[λ(Bω∩[0,1])]≤2pandEμ[λ(EN(Bω)∩[0,1])]≤3p.\mathbb{E}_\mu\big[\lambda(B_\omega\cap[0,1])\big]\le 2p\qquad\text{and}\qquad\mathbb{E}_\mu\big[\lambda(\mathcal{E}_N(B_\omega)\cap[0,1])\big]\le 3p.Eμ​[λ(Bω​∩[0,1])]≤2pandEμ​[λ(EN​(Bω​)∩[0,1])]≤3p.

Then there is an open set H⊆RH\subseteq\mathbb{R}H⊆R with x+1∈H  ⟺  x∈Hx+1\in H\iff x\in Hx+1∈H⟺x∈H for all x∈Rx\in\mathbb{R}x∈R such that

λ(H∩[0,1])≤6pand∀x∈R  ∀t∈[1,2]  ∃n≥1: x+t 2−n∈H.\lambda\big(H\cap[0,1]\big)\le 6p\qquad\text{and}\qquad\forall x\in\mathbb{R}\ \ \forall t\in[1,2]\ \ \exists n\ge1:\ x+t\,2^{-n}\in H.λ(H∩[0,1])≤6pand∀x∈R  ∀t∈[1,2]  ∃n≥1: x+t2−n∈H.

Here nnn ranges over all integers n≥1n\ge1n≥1, not only over NNN.

This is the first-moment step of a probabilistic construction of hitting sets: average bounds on the density of a random open periodic set and of its exceptional centers yield one deterministic open periodic set HHH, of density at most 6p6p6p per period, that meets every dilate {x+t 2−n:n≥1}\{x+t\,2^{-n}:n\ge1\}{x+t2−n:n≥1} with t∈[1,2]t\in[1,2]t∈[1,2] of the dyadic sequence.

Formalization Note Ω\OmegaΩ is a Fintype with a measurable structure in which singletons are measurable, and μ\muμ is a probability measure. Expectations are lower Lebesgue integrals (lintegral) of [0,∞][0,\infty][0,∞]-valued functions, λ\lambdaλ is volume, the real bounds are embedded with ENNReal.ofReal, and EN(B)\mathcal{E}_N(B)EN​(B) is exceptionalCenters B N with the sequence n↦2−nn\mapsto2^{-n}n↦2−n.

Preamble
import Mathlib
import Definitions.Def_DyadicAvoidance
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_PeriodicBasic
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_GridSeparation
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FiniteTableModel
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_OrderedRouting
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RoutingPath
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_CenterRouteExposure
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_ExceptionalCenters
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_CenterFailureBound
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FirstDefault
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_ConcreteLabelMeasures
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_CenterFirstDefault
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RandomSetDensity
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RoutedSetDensity
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RoutedExposure
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FirstDefaultSelection
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FiniteLocalPredicate
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowData
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowTableModel
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_StableRoutingBridge
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowExceptionalTransfer
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_TrialAddresses
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowTrialAddresses
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_ConcreteWindowAtom

open OAI OAI.Problem310 OAI.Problem310.Auxiliary
universe u_Ω
open Set Filter Topology MeasureTheory
Formal statement
theorem OAI.Problem310.Auxiliary.periodic_hitting_of_expected_exceptional
    {Ω : Type u_Ω} [Fintype Ω] [MeasurableSpace Ω] [MeasurableSingletonClass Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ]
    (p : ℝ) (hp : 0 < p) (B : Ω → Set ℝ)
    (hBo : ∀ ω, IsOpen (B ω))
    (hBp : ∀ ω x, x + 1 ∈ B ω ↔ x ∈ B ω)
    (N : Set ℕ) (hN : ∀ n ∈ N, 1 ≤ n)
    (hBmean : (∫⁻ ω, volume (B ω ∩ Icc (0 : ℝ) 1) ∂μ) ≤ ENNReal.ofReal (2 * p))
    (hRmean : (∫⁻ ω, volume
      (exceptionalCenters (B ω) N (fun n => (2 : ℝ)⁻¹ ^ n) ∩ Icc (0 : ℝ) 1) ∂μ)
        ≤ ENNReal.ofReal (3 * p)) :
    ∃ H : Set ℝ, IsOpen H ∧
      (∀ x : ℝ, x + 1 ∈ H ↔ x ∈ H) ∧
      volume (H ∩ Icc (0 : ℝ) 1) ≤ ENNReal.ofReal (6 * p) ∧
      ∀ x t : ℝ, t ∈ Icc (1 : ℝ) 2 →
        ∃ n : ℕ, 1 ≤ n ∧ x + t * ((2 : ℝ)⁻¹ ^ n) ∈ H := by sorry
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/MeasureTheory/DyadicAvoidance/ExpectedRepair.lean#L14-L45

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