Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Periodic hitting sets yield compact sets of measure near 111 avoiding all affine dyadic copies

Proved
OAI.Problem310Support.avoidance_of_periodic_hitting

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

measure-theoryoai-mathreal-analysis

Let λ\lambdaλ denote Lebesgue measure on R\mathbb{R}R, and call a set H⊆RH\subseteq\mathbb{R}H⊆R 1-periodic if x+1∈H  ⟺  x∈Hx+1\in H\iff x\in Hx+1∈H⟺x∈H for every real xxx. Assume the following periodic hitting property: for every real ppp with 0<p<10<p<10<p<1 there is a set H⊆RH\subseteq\mathbb{R}H⊆R such that

  1. HHH is open;
  2. HHH is 1-periodic;
  3. λ(H∩[0,1])≤6p\lambda\bigl(H\cap[0,1]\bigr)\le 6pλ(H∩[0,1])≤6p;
  4. for every x∈Rx\in\mathbb{R}x∈R and every t∈[1,2]t\in[1,2]t∈[1,2] there is an integer n≥1n\ge1n≥1 with x+t 2−n∈Hx+t\,2^{-n}\in Hx+t2−n∈H.

Then for every real η\etaη with 0<η<10<\eta<10<η<1 there is a set E⊆[0,1]E\subseteq[0,1]E⊆[0,1] that is compact, has measure λ(E)>1−η\lambda(E)>1-\etaλ(E)>1−η, and avoids every affine copy of the dyadic sequence with nonzero scale:

∀x∈R  ∀s∈R∖{0}  ∃n≥1:x+s 2−n∉E.\forall x\in\mathbb{R}\ \ \forall s\in\mathbb{R}\setminus\{0\}\ \ \exists n\ge1:\qquad x+s\,2^{-n}\notin E .∀x∈R  ∀s∈R∖{0}  ∃n≥1:x+s2−n∈/E.

The conclusion is exactly the dyadic affine avoidance statement: for every η∈(0,1)\eta\in(0,1)η∈(0,1) there is a compact E⊆[0,1]E\subseteq[0,1]E⊆[0,1] with λ(E)>1−η\lambda(E)>1-\etaλ(E)>1−η that contains no set {x+s 2−n:n≥1}\{x+s\,2^{-n} : n\ge1\}{x+s2−n:n≥1} with s≠0s\ne0s=0. The theorem therefore reduces that statement to a single periodic construction at normalized scales t∈[1,2]t\in[1,2]t∈[1,2]; all measure estimates, the passage to arbitrary signed scales and the strict volume bound are handled inside this implication.

Formalization Note The hypothesis is a single statement quantified over ppp; the bounds are written with ENNReal.ofReal (6 * p) and ENNReal.ofReal (1 - η) in [0,∞][0,\infty][0,∞], which equal 6p6p6p and 1−η1-\eta1−η in the stated ranges. The factor 2−n2^{-n}2−n is written as (2−1)n(2^{-1})^{n}(2−1)n with nnn a natural number.

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
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_PeriodicEnvelope
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_GlobalFromPeriodic

open OAI OAI.Problem310Support
open Set MeasureTheory
Formal statement
theorem OAI.Problem310Support.avoidance_of_periodic_hitting
    (hperiodic : ∀ p : ℝ, 0 < p → p < 1 → ∃ 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) :
    ∀ η : ℝ, 0 < η → η < 1 → ∃ E : Set ℝ,
      E ⊆ Icc (0 : ℝ) 1 ∧ IsCompact E ∧
      volume E > ENNReal.ofReal (1 - η) ∧
      ∀ x s : ℝ, s ≠ 0 → ∃ n : ℕ, 1 ≤ n ∧
        x + s * ((2 : ℝ)⁻¹ ^ n) ∉ E := by sorry
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/MeasureTheory/DyadicAvoidance/GlobalFromPeriodic.lean#L147-L185

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