File size: 1,441 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 | import OAI.MeasureTheory.DyadicAvoidance.GridStabilityFin
import OAI.MeasureTheory.DyadicAvoidance.WindowPlacement
namespace OAI
noncomputable section
namespace Problem310
/-- Uniform stability for a finite sequence of windows. The gap is selected
before any window lengths are fixed. -/
theorem exists_window_stability (K : β) (p : β) (hp : 0 < p) :
β g : β, 2 β€ g β§ β len : β β β, β G : Set β,
MeasurableSet G β§ (β x : β, x + 1 β G β x β G) β§
MeasureTheory.volume (GαΆ β© Set.Icc (0 : β) 1) β€ ENNReal.ofReal p β§
β x β G, β f e : β, f < e β e < K β
β n β WindowPlacement.window len g e, β t β Set.Icc (1 : β) 2,
GridSeparation.dyadicKey (WindowPlacement.finish len g f)
(x + t * ((2 : β)β»ΒΉ) ^ n) =
GridSeparation.dyadicKey (WindowPlacement.finish len g f) x := by
obtain β¨g, hg, hstableβ© := exists_uniform_grid_stability (ΞΉ := Fin K) p hp
refine β¨g, hg, fun len β¦ ?_β©
obtain β¨G, hGm, hGp, hGbudget, hGkeyβ© :=
hstable (fun i : Fin K β¦ WindowPlacement.finish len g i.val)
refine β¨G, hGm, hGp, hGbudget, ?_β©
intro x hx f e hfe heK n hn t ht
have hfK : f < K := hfe.trans heK
apply hGkey x hx β¨f, hfKβ© n ?_ t ht
have hgap := WindowPlacement.gap_of_lt len g hfe
have hstart := (WindowPlacement.mem_window.mp hn).1
dsimp
omega
end Problem310
end
end OAI
|