Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Normalized dyadic hitting at every magnification gives hitting at all nonzero scales

Proved
OAI.Problem310Support.signedDyadicUnion_hits

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

measure-theoryoai-mathreal-analysis

Let H=(Hj)j∈NH=(H_j)_{j\in\mathbb{N}}H=(Hj​)j∈N​ be a sequence of subsets of R\mathbb{R}R. Its signed dyadic union is the set

U(H)=⋃j=0∞({x∈R:2jx∈Hj}∪{x∈R:−2jx∈Hj}),U(H)=\bigcup_{j=0}^{\infty}\Bigl(\{x\in\mathbb{R} : 2^jx\in H_j\}\cup\{x\in\mathbb{R} : -2^jx\in H_j\}\Bigr),U(H)=j=0⋃∞​({x∈R:2jx∈Hj​}∪{x∈R:−2jx∈Hj​}),

that is, the union over jjj of the pullbacks of HjH_jHj​ under the two dilations x↦2jxx\mapsto 2^jxx↦2jx and x↦−2jxx\mapsto-2^jxx↦−2jx.

Assume that every HjH_jHj​ meets every normalized dyadic configuration: for every j∈Nj\in\mathbb{N}j∈N, 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∈Hjx+t\,2^{-n}\in H_jx+t2−n∈Hj​. Then U(H)U(H)U(H) meets every affine copy of the dyadic sequence with nonzero scale:

∀x∈R  ∀s∈R∖{0}  ∃n≥1:x+s 2−n∈U(H).\forall x\in\mathbb{R}\ \ \forall s\in\mathbb{R}\setminus\{0\}\ \ \exists n\ge1:\qquad x+s\,2^{-n}\in U(H).∀x∈R  ∀s∈R∖{0}  ∃n≥1:x+s2−n∈U(H).

The implication is purely algebraic; no openness, periodicity or measure condition is involved. In the dyadic avoidance argument the HjH_jHj​ are open sets of small density, so U(H)U(H)U(H) is a small open set meeting every set {x+s 2−n:n≥1}\{x+s\,2^{-n} : n\ge1\}{x+s2−n:n≥1} with s≠0s\ne0s=0, and the complement of U(H)U(H)U(H) in [0,1][0,1][0,1] avoids all of them.

Formalization Note The signed dyadic union is signedDyadicUnion H, and 2−n2^{-n}2−n is written as (2−1)n(2^{-1})^{n}(2−1)n; the indices jjj and nnn are natural numbers.

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.signedDyadicUnion_hits {H : ℕ → Set ℝ}
    (hH : ∀ j (x t : ℝ), t ∈ Icc (1 : ℝ) 2 →
      ∃ n : ℕ, 1 ≤ n ∧ x + t * ((2 : ℝ)⁻¹ ^ n) ∈ H j) :
    ∀ x s : ℝ, s ≠ 0 → ∃ n : ℕ, 1 ≤ n ∧
      x + s * ((2 : ℝ)⁻¹ ^ n) ∈ signedDyadicUnion H := by sorry
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/MeasureTheory/DyadicAvoidance/GlobalFromPeriodic.lean#L76-L103

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