Open periodic dyadic hitting set from a raw random periodic construction
ProvedOAI.Problem310.Auxiliary.periodic_hitting_of_raw_constructionLet be a finite set whose singletons are measurable, let be a probability measure on , write for expectation with respect to , and let denote Lebesgue outer measure on (Lebesgue measure on measurable sets). A set is -periodic if for every . Let be a set of indices with for every .
For , the exceptional centers of relative to are the points from which some dilate of the dyadic sequence, indexed by , misses :
Theorem. Let and, for each , let be a -periodic set; neither openness nor measurability of is assumed. Let be a Borel set. Assume
Then there is an open set with for all such that
Here ranges over all integers , not only over .
This is the complete analytic interface for a finite random periodic construction: the random set may be raw, and the hypotheses are exactly a bound on its mean density, a set of bad centers of measure at most per period, and a pointwise bound on the probability that a good center is exceptional.
Formalization Note is a Fintype with a measurable structure in which singletons are measurable, and is a probability measure. Expectations are lower Lebesgue integrals (lintegral) of -valued functions, is volume, the real bounds are embedded with ENNReal.ofReal, and is exceptionalCenters B N with the sequence . Borel measurability of is MeasurableSet G, and on non-measurable sets volume is Lebesgue outer measure.
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 open OAI OAI.Problem310 OAI.Problem310.Auxiliary universe u_Ω open Set MeasureTheory
theorem OAI.Problem310.Auxiliary.periodic_hitting_of_raw_construction
{Ω : Type u_Ω} [Fintype Ω] [MeasurableSpace Ω] [MeasurableSingletonClass Ω]
(μ : Measure Ω) [IsProbabilityMeasure μ]
(p : ℝ) (hp : 0 < p) (B : Ω → Set ℝ)
(hBp : ∀ ω x, x + 1 ∈ B ω ↔ x ∈ B ω)
(N : Set ℕ) (hN : ∀ n ∈ N, 1 ≤ n)
(G : Set ℝ) (hG : MeasurableSet G)
(hbad : volume (Gᶜ ∩ Icc (0 : ℝ) 1) ≤ ENNReal.ofReal p)
(hBmean : (∫⁻ ω, volume (B ω ∩ Icc (0 : ℝ) 1) ∂μ) ≤ ENNReal.ofReal p)
(hgood : ∀ x ∈ G,
μ {ω | x ∈ exceptionalCenters (B ω) N (fun n => (2 : ℝ)⁻¹ ^ n)}
≤ ENNReal.ofReal (2 * 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