Periodic hitting sets yield compact sets of measure near avoiding all affine dyadic copies
ProvedOAI.Problem310Support.avoidance_of_periodic_hittingLet denote Lebesgue measure on , and call a set 1-periodic if for every real . Assume the following periodic hitting property: for every real with there is a set such that
- is open;
- is 1-periodic;
- ;
- for every and every there is an integer with .
Then for every real with there is a set that is compact, has measure , and avoids every affine copy of the dyadic sequence with nonzero scale:
The conclusion is exactly the dyadic affine avoidance statement: for every there is a compact with that contains no set with . The theorem therefore reduces that statement to a single periodic construction at normalized scales ; 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 ; the bounds are written with ENNReal.ofReal (6 * p) and ENNReal.ofReal (1 - η) in , which equal and in the stated ranges. The factor is written as with a natural number.
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
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