File size: 12,632 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 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 | import OAI.Analysis.C0Absorption.Duality
namespace OAI
open Set Filter Topology
open scoped NNReal BigOperators ZeroAtInfty
open NormedSpace
namespace C0Absorption
noncomputable section
open Set Filter Topology
theorem thin_sequence {r : β β β β Prop} (hr : β i, βαΆ j in atTop, r i j) :
β Ο : β β β, StrictMono Ο β§ β i j, i < j β r (Ο i) (Ο j) := by
have he (t : Set β) (ht : t.Finite) : βαΆ j in atTop, β i β t, i<j β§ r i j :=
(eventually_all_finite ht).mpr (fun i _ => (eventually_gt_atTop i).and (hr i))
obtain β¨Ο,hΟβ© := seq_of_forall_finite_exists (fun t ht => (he t ht).exists)
simp only [forall_mem_image, forall_and, mem_Iio] at hΟ
exact β¨Ο, forall_comm.mp hΟ.1, forall_comm.mp hΟ.2β©
theorem finite_constant_subsequence {A : Type*} [Finite A] (f : β β A) :
β a, β Ο : β β β, StrictMono Ο β§ β i, f (Ο i)=a := by
have hh : β a, βαΆ i in atTop, f i=a := by
by_contra hn
push Not at hn
have hf : βαΆ i in atTop, β a, f iβ a := Filter.eventually_all.mpr hn
obtain β¨i,hiβ© := hf.exists
exact hi (f i) rfl
obtain β¨a,haβ© := hh
obtain β¨Ο,hm,hpβ© := extraction_of_frequently_atTop ha
exact β¨a,Ο,hm,hpβ©
theorem constant_or_injective_subsequence {A : Type*} (f : β β A) :
(β a, β Ο : β β β, StrictMono Ο β§ β i, f (Ο i)=a) β¨
(β Ο : β β β, StrictMono Ο β§ Function.Injective (f β Ο)) := by
by_cases h : β a, βαΆ i in atTop, f i=a
Β· obtain β¨a,haβ© := h
obtain β¨Ο,hm,hpβ© := extraction_of_frequently_atTop ha
exact Or.inl β¨a,Ο,hm,hpβ©
Β· push Not at h
obtain β¨Ο,hm,hpβ© := thin_sequence (r := fun i j => f iβ f j) (fun i => by
simpa only [ne_eq, eq_comm] using h (f i))
refine Or.inr β¨Ο,hm,?_β©
intro i j hij
apply le_antisymm <;> by_contra hn
Β· exact hp j i (lt_of_not_ge hn) hij.symm
Β· exact hp i j (lt_of_not_ge hn) hij
theorem nat_constant_or_tendsto (f : β β β) :
(β a, β Ο : β β β, StrictMono Ο β§ β i, f (Ο i)=a) β¨
Tendsto f atTop atTop := by
by_cases h : β a, βαΆ i in atTop, f i=a
Β· obtain β¨a,haβ© := h
obtain β¨Ο,hm,hpβ© := extraction_of_frequently_atTop ha
exact Or.inl β¨a,Ο,hm,hpβ©
Β· push Not at h
apply Or.inr
apply tendsto_atTop.mpr
intro N
have hh : βαΆ i in atTop, β a β Finset.range N, f iβ a :=
(eventually_all_finite (Finset.range N).finite_toSet).mpr (fun a _ => h a)
filter_upwards [hh] with i hi
by_contra hn
exact hi (f i) (Finset.mem_range.mpr (lt_of_not_ge hn)) rfl
theorem finite_subsequence_selection {A : Type*} [Finite A]
(P : A β (β β β) β Prop)
(hstable : β a (Ο Ο : β β β), StrictMono Ο β StrictMono Ο β P a Ο β P a (Ο β Ο))
(hselect : β a (Ο : β β β), StrictMono Ο β β Ο, StrictMono Ο β§ P a (Ο β Ο)) :
β Ο, StrictMono Ο β§ β a, P a Ο := by
classical
let := Fintype.ofFinite A
suffices h : β s : Finset A, β Ο, StrictMono Ο β§ β a β s, P a Ο from
by simpa using h Finset.univ
intro s
induction s using Finset.induction_on with
| empty => exact β¨id,strictMono_id,by simpβ©
| @insert a s ha ih =>
obtain β¨Ο,hm,hpβ© := ih
obtain β¨Ο,hn,hqβ© := hselect a Ο hm
refine β¨Ο β Ο,hm.comp hn,?_β©
intro b hb
rcases Finset.mem_insert.mp hb with rfl | hb
Β· exact hq
Β· exact hstable b Ο Ο hm hn (hp b hb)
theorem choose_mono_sequence {P : β β β β Prop} (hP : β i, βαΆ j in atTop, P i j) :
β Ο : β β β, StrictMono Ο β§ β i, P i (Ο i) := by
have he (i j : β) : β k, j<k β§ P i k := ((eventually_gt_atTop j).and (hP i)).exists
choose next hn using he
let Ο : β β β := fun n => Nat.rec (next 0 0) (fun n prev => next (n+1) prev) n
have hΟs (n : β) : Ο (n+1) = next (n+1) (Ο n) := rfl
refine β¨Ο,strictMono_nat_of_lt_succ (fun n => ?_),?_β©
Β· rw [hΟs]; exact (hn (n+1) (Ο n)).1
Β· intro i
cases i with
| zero => exact (hn 0 0).2
| succ i => exact (hn (i+1) (Ο i)).2
end
end C0Absorption
namespace C0Absorption
noncomputable section
open Set Filter Topology
open scoped NNReal BigOperators ZeroAtInfty
theorem nested_selection_lipschitz {E : Type*} [NormedAddCommGroup E] [NormedSpace β E]
{S : Set E} (hS : Convex β S) (u b : β β S β β) (C : β β Set S) (e : β β β)
(K Kb : ββ₯0) (hu : β i, Continuous (u i)) (hb : β i, LipschitzWith Kb (b i))
(hF : β i, LipschitzWith K (fun x => u i x*b i x))
(hC : β i, IsOpen (C i)) (hc : β i, β x β C i, u i x=e i)
(hnest : β i, βαΆ j in atTop, tsupport (u j) β C i)
(hsmall : Tendsto (fun i => |e i| *(Kb : β)) atTop (nhds 0)) :
β Ο : β β β, StrictMono Ο β§
β n (Ξ΅ : Fin n β β), (β i, |Ξ΅ i|=1) β
LipschitzWith (K+1) (fun x => β i, Ξ΅ i * (u (Ο i) x*b (Ο i) x)) := by
have he (i : β) : βαΆ j in atTop, |e j| *(Kb : β) β€ (1/2 : β)^(i+1) :=
hsmall.eventually (eventually_le_nhds (by positivity))
obtain β¨Ο,hΟ,heΟβ© := choose_mono_sequence he
obtain β¨Ξ·,hΞ·,hrelβ© := thin_sequence (r := fun i j => tsupport (u (Ο j)) β C (Ο i))
(fun i => hΟ.tendsto_atTop.eventually (hnest (Ο i)))
let Ο := Ο β Ξ·
refine β¨Ο,hΟ.comp hΞ·,?_β©
have hprod (i : β) : |e (Ο i)| *(Kb : β) β€ (1/2 : β)^(i+1) := by
exact (heΟ (Ξ· i)).trans (pow_le_pow_of_le_one (by norm_num) (by norm_num)
(Nat.add_le_add_right (hΞ·.id_le i) 1))
intro n Ξ΅ hΞ΅
have hh := nested_supports_signed_lipschitz hS n
(fun i : Fin n => u (Ο i)) (fun i : Fin n => b (Ο i))
(fun i : Fin n => e (Ο i)) (fun i : Fin n => C (Ο i)) K
(fun _ : Fin n => Kb) (fun i => hu _) (fun i => hb _) (fun i => hF _)
(fun i => hC _) (fun i => hc _) (fun i j hij => hrel i j hij) Ξ΅ hΞ΅
apply hh.weaken
refine add_le_add le_rfl ?_
have hsum : (β i : Fin n, |e (Ο i)| *(Kb : β)) β€ 1 := by
calc
_ β€ β i : Fin n, (1/2 : β)^(i.val+1) := Finset.sum_le_sum (fun i _ => hprod i)
_ = β i β Finset.range n, (1/2 : β)^(i+1) := (Finset.sum_range (fun i : β => (1/2 : β)^(i+1))).symm
_ β€ β' i : β, (1/2 : β)^(i+1) := Summable.sum_le_tsum _ (fun _ _ => by positivity) geometric_summable
_ = 1 := geometric_tsum
apply NNReal.coe_le_coe.mp
simpa only [NNReal.coe_sum, NNReal.coe_mul, coe_nnnorm, Real.norm_eq_abs, NNReal.coe_one] using hsum
end
end C0Absorption
namespace C0Absorption
noncomputable section
open Set Filter Topology
open scoped NNReal BigOperators ZeroAtInfty
structure TagLocalization {Ξ : Type*} (B : CylinderBases Ξ) where
tag : Ξ β β β Icc (-1 : β) 1
contains_prefix : β Ξ³, Finset.range (B.band Ξ³) β B.coordinates Ξ³
ell_tendsto : Tendsto B.ell atTop (nhds 0)
base_support : β Ξ³ (k : B.coordinates Ξ³), k.val < B.band Ξ³ β
β x β tsupport (B.base Ξ³), dist (x k) (tag Ξ³ k.val) β€ 2*dyadic (B.band Ξ³)
namespace TagLocalization
variable {Ξ : Type*} {B : CylinderBases Ξ} (loc : TagLocalization B)
theorem representation_support {Ξ³ : Ξ} (r : GeneratedRepresentation B Ξ³)
(k : β) (hk : k < B.band Ξ³) (s : C0Ball) (hs : s β tsupport r.value) :
dist (s.val k) (loc.tag Ξ³ k).val β€ 2*dyadic (B.band Ξ³)+B.ell (B.band Ξ³)/2 := by
let l : B.coordinates Ξ³ := β¨k,loc.contains_prefix Ξ³ (Finset.mem_range.mpr hk)β©
let Ο : Cube (B.coordinates Ξ³) β β := fun x => dist (x l) (loc.tag Ξ³ k)
have hΟ : LipschitzWith 1 Ο := by
simpa only [Ο,Function.comp_def,one_mul] using (LipschitzWith.dist_left (loc.tag Ξ³ k)).comp (LipschitzWith.eval l)
have hp := r.support_bound hΟ (loc.base_support Ξ³ l hk) s hs
exact hp.trans (add_le_add le_rfl r.budget.le)
theorem projected_concentration (Ξ³ : β β Ξ) (r : β i, GeneratedRepresentation B (Ξ³ i))
(hj : Tendsto (fun i => B.band (Ξ³ i)) atTop atTop)
(v : β β Icc (-1 : β) 1) (hv : Tendsto (fun i => loc.tag (Ξ³ i)) atTop (nhds v))
(I : Finset β) {Ξ΅ : β} (hΞ΅ : 0 < Ξ΅) :
βαΆ i in atTop, β s β tsupport (r i).value,
dist (cubeRestrict I s) (fun k : I => v k.val) < Ξ΅ := by
have ha : Tendsto (fun i => 2*dyadic (B.band (Ξ³ i))+B.ell (B.band (Ξ³ i))/2) atTop (nhds 0) := by
simpa only [Function.comp_def,mul_zero,zero_div,zero_add] using
((dyadic_tendsto.comp hj).const_mul 2).add ((loc.ell_tendsto.comp hj).div_const 2)
have he := ha.eventually (eventually_lt_nhds (half_pos hΞ΅))
have hall : βαΆ i in atTop, β k : I, k.val < B.band (Ξ³ i) β§
dist (loc.tag (Ξ³ i) k.val) (v k.val) < Ξ΅/2 := by
apply Filter.eventually_all.mpr
intro k
exact (hj.eventually (eventually_gt_atTop k.val)).and
((Metric.tendsto_nhds.mp (tendsto_pi_nhds.mp hv k.val)) (Ξ΅/2) (half_pos hΞ΅))
filter_upwards [he,hall] with i hi htag
intro s hs
apply (dist_pi_lt_iff hΞ΅).mpr
intro k
have hb := loc.representation_support (r i) k.val (htag k).1 s hs
have hc := (htag k).2
have hd := dist_triangle (cubeRestrict I s k) (loc.tag (Ξ³ i) k.val) (v k.val)
change dist (s.val k.val) (v k.val).val < Ξ΅
change dist (s.val k.val) (v k.val).val β€
dist (s.val k.val) (loc.tag (Ξ³ i) k.val).val + dist (loc.tag (Ξ³ i) k.val) (v k.val) at hd
linarith
end TagLocalization
end
end C0Absorption
namespace C0Absorption
noncomputable section
open Set Filter Topology
open scoped NNReal BigOperators ZeroAtInfty
theorem high_bands_compatible {Ξ : Type*} {B : CylinderBases Ξ} (loc : TagLocalization B)
(Ξ³ : β β Ξ) (r : β i, GeneratedRepresentation B (Ξ³ i)) (h : β)
(hr : β i, (r i).operations.length β€ h)
(hj : Tendsto (fun i => B.band (Ξ³ i)) atTop atTop)
(m : β β SourceSpace B) {Ξ΄ : β} (hΞ΄ : 0 < Ξ΄)
(hd : β i, Ξ΄ β€ |completedPairing (sourceClasses B) c0Origin (r i).value (m i)|) :
β Ο : β β β, StrictMono Ο β§ β F : β β C0Ball β β,
(β i, F i β TClass B (h+1)) β§
(β i, Ξ΄/2 β€ |completedPairing (sourceClasses B) c0Origin (F i) (m (Ο i))|) β§
β n (Ξ΅ : Fin n β β), (β i, |Ξ΅ i|=1) β
LipschitzWith (4^(h+1)*B.L0+1) (fun s => β i, Ξ΅ i*F i s) := by
obtain β¨v,hv,Ο,hΟ,hvΟβ© := isCompact_univ.isSeqCompact.subseq_of_frequently_in
(x := fun i => loc.tag (Ξ³ i)) (Filter.Eventually.of_forall (fun _ => mem_univ _)).frequently
have hfl (i : β) := (r (Ο i)).exists_flatten_T h (hr (Ο i))
(fun k => v k.val) (m (Ο i)) (half_pos hΞ΄) (show (0 : β)<1 by norm_num)
choose a rr hcap hops hdif hflat hsup using hfl
have hmem (i : β) : (rr i).value β TClass B (h+1) := by
refine β¨Ξ³ (Ο i),rr i,?_,rflβ©
rw [hops i,List.length_append,List.length_singleton]
exact Nat.add_le_add_right (hr (Ο i)) 1
let C (i : β) : Set C0Ball :=
{s | dist (cubeRestrict (B.coordinates (Ξ³ (Ο i))) s)
(fun k => v k.val) < 3*dyadic (a i)/8}
let e (i : β) := (r (Ο i)).cubeValue
(flattenOperation (B.coordinates (Ξ³ (Ο i))) (a i) (fun k => v k.val)).point
have hC (i : β) : IsOpen (C i) :=
Metric.isOpen_ball.preimage (cubeRestrict_lipschitz _).continuous
have hnest (i : β) : βαΆ j in atTop, tsupport (rr j).value β C i := by
have hp := loc.projected_concentration (Ξ³ β Ο) rr (hj.comp hΟ.tendsto_atTop) v hvΟ
(B.coordinates (Ξ³ (Ο i))) (show 0 < 3*dyadic (a i)/8 by have := dyadic_pos (a i); positivity)
exact hp
obtain β¨Ξ·,hΞ·,hLipβ© := nested_selection_lipschitz (convex_closedBall (0 : C0) 1)
(fun i => (rr i).value) (fun _ _ => 1) C e (4^(h+1)*B.L0) 0
(fun i => (rr i).value_lipschitz.continuous) (fun _ => LipschitzWith.const 1)
(fun i => by simpa only [mul_one] using TClass_lipschitz B (h+1) (hmem i))
hC (fun i s hs => hflat i s hs) hnest (by simp only [NNReal.coe_zero,mul_zero]; exact tendsto_const_nhds)
refine β¨Ο β Ξ·,hΟ.comp hΞ·,fun i => (rr (Ξ· i)).value,fun i => hmem _,?_,?_β©
Β· intro i
have hb := hdif (Ξ· i)
have ha := hd (Ο (Ξ· i))
have hab := abs_sub_abs_le_abs_sub
(completedPairing (sourceClasses B) c0Origin (r (Ο (Ξ· i))).value (m (Ο (Ξ· i))))
(completedPairing (sourceClasses B) c0Origin (rr (Ξ· i)).value (m (Ο (Ξ· i))))
rw [abs_sub_comm] at hab
change Ξ΄/2 β€ |completedPairing (sourceClasses B) c0Origin (rr (Ξ· i)).value (m (Ο (Ξ· i)))|
linarith
Β· intro n Ξ΅ hΞ΅
simpa only [mul_one] using hLip n Ξ΅ hΞ΅
end
end C0Absorption
end OAI
|