File size: 18,922 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 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 | import Mathlib
import OAI.MeasureTheory.FalconerCompletion.Graphs.GraphDegrees
import OAI.MeasureTheory.FalconerCompletion.Graphs.GraphJetMul
import OAI.MeasureTheory.FalconerCompletion.Sphere.ScalarCapPartition
namespace OAI
/-! Graph energies and pair estimates. -/
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace CurrentFalconer.TreeND
open Set MeasureTheory
variable {d : β}
noncomputable def graphDescendants (a p : β) (X : CellPath d) : Finset (CellPath d) := by
classical
exact (dyadicPaths p).filter fun P => P.take a=X
noncomputable def graphChildren (Ο : Measure (EuclideanSpace β (Fin d)))
(a p : β) (X : CellPath d) : Finset (CellPath d) := by
classical
exact (graphDescendants a p X).filter fun P => 0 < Ο (treeCell P)
lemma graphDescendants_subset {a p : β} {X P : CellPath d} (hP : P β graphDescendants a p X) :
treeCell P β treeCell X := by
classical
rcases Finset.mem_filter.mp hP with β¨hP,heβ©
simpa only [he] using treeCell_subset_take P a
lemma graphDescendants_cover {a p : β} (hap : a β€ p) {X : CellPath d}
(hX : X β dyadicPaths a) :
(β P β graphDescendants a p X, treeCell P)=treeCell X := by
classical
apply Set.Subset.antisymm
Β· intro x hx
obtain β¨P,hP,hxβ© := Set.mem_iUnionβ.mp hx
exact graphDescendants_subset hP hx
Β· intro x hx
have hxroot : x β treeCell ([] : CellPath d) := by
simpa only [List.take_zero] using treeCell_subset_take X 0 hx
rw [βtreeCell_cover_root p] at hxroot
obtain β¨P,hP,hxPβ© := Set.mem_iUnionβ.mp hxroot
have hlP : P.length=p := (mem_dyadicPaths _ _).mp hP
have hlX : X.length=a := (mem_dyadicPaths _ _).mp hX
have he : P.take a=X := by
by_contra hne
have hh := treeCell_disjoint (p:=P.take a) (q:=X)
(by simp [List.length_take,hlP,hlX,Nat.min_eq_left hap]) hne
exact Set.disjoint_left.mp hh (treeCell_subset_take P a hxP) hx
exact Set.mem_iUnionβ.mpr β¨P,Finset.mem_filter.mpr β¨hP,heβ©,hxPβ©
lemma graphDescendants_disjoint {a p : β} {X P Q : CellPath d}
(hP : P β graphDescendants a p X) (hQ : Q β graphDescendants a p X) (hne : P β Q) :
Disjoint (treeCell P) (treeCell Q) := by
classical
apply treeCell_disjoint _ hne
exact ((mem_dyadicPaths _ _).mp (Finset.mem_filter.mp hP).1).trans
((mem_dyadicPaths _ _).mp (Finset.mem_filter.mp hQ).1).symm
lemma graphChildren_integral (Ο : Measure (EuclideanSpace β (Fin d)))
{a p : β} (hap : a β€ p) {X : CellPath d} (hX : X β dyadicPaths a)
(F : EuclideanSpace β (Fin d) β β) (hF : IntegrableOn F (treeCell X) Ο) :
(β« x in treeCell X, F x βΟ) =
β P β graphChildren Ο a p X, β« x in treeCell P, F x βΟ := by
classical
rw [βgraphDescendants_cover hap hX]
rw [integral_biUnion_finset _ (fun P _ => measurableSet_treeCell P)
(fun P hP Q hQ hne => graphDescendants_disjoint hP hQ hne)
(fun P hP => hF.mono_set (graphDescendants_subset hP))]
symm
apply Finset.sum_subset (Finset.filter_subset _ _)
intro P hP hnP
have hz : Ο (treeCell P)=0 := by
apply le_antisymm _ bot_le
by_contra hp
exact hnP (Finset.mem_filter.mpr β¨hP,lt_of_not_ge hpβ©)
rw [Measure.restrict_eq_zero.mpr hz,integral_zero_measure]
lemma graphChildren_mass (Ο : Measure (EuclideanSpace β (Fin d))) [IsFiniteMeasure Ο]
{a p : β} (hap : a β€ p) {X : CellPath d} (hX : X β dyadicPaths a) :
β P β graphChildren Ο a p X, Ο.real (treeCell P) = Ο.real (treeCell X) := by
classical
have h := graphChildren_integral Ο hap hX (fun _ => (1:β)) (integrableOn_const (C:= (1:β)))
have hh := congrArg Complex.re h
simpa [integral_const,Measure.real,Complex.re_sum] using hh.symm
lemma graphChildren_nonempty (Ο : Measure (EuclideanSpace β (Fin d))) [IsFiniteMeasure Ο]
{a p : β} (hap : a β€ p) {X : CellPath d} (hX : X β dyadicPaths a)
(hocc : 0 < Ο (treeCell X)) : (graphChildren Ο a p X).Nonempty := by
have hm := graphChildren_mass Ο hap hX
by_contra he
rw [Finset.not_nonempty_iff_eq_empty.mp he,Finset.sum_empty] at hm
have hp : 0 < Ο.real (treeCell X) := ENNReal.toReal_pos hocc.ne' (measure_ne_top _ _)
linarith
lemma graphChildren_card_le (Ο : Measure (EuclideanSpace β (Fin d))) [IsFiniteMeasure Ο]
{a p : β} (hap : a β€ p) {X : CellPath d} (hX : X β dyadicPaths a)
{l u : β} (hl : 0 < l)
(hlo : β P β graphChildren Ο a p X, l β€ Ο.real (treeCell P))
(hup : Ο.real (treeCell X) β€ u) :
((graphChildren Ο a p X).card : β) β€ u/l := by
rw [le_div_iffβ hl]
calc
_ = β P β graphChildren Ο a p X, l := by simp
_ β€ β P β graphChildren Ο a p X, Ο.real (treeCell P) := Finset.sum_le_sum hlo
_ = Ο.real (treeCell X) := graphChildren_mass Ο hap hX
_ β€ u := hup
end CurrentFalconer.TreeND
end
end
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace CurrentFalconer.TreeND
open Set MeasureTheory
open scoped RealInnerProductSpace
variable {d : β}
lemma treeCell_diameter {P : CellPath d} {x y : EuclideanSpace β (Fin d)}
(hx : x β treeCell P) (hy : y β treeCell P) :
βx-yβ β€ (d+1:β)*(2:β)^(-(P.length:β)) := by
have h := ambientGridCell_dist_le hy hx
rw [Real.rpow_neg (by norm_num : (0:β) β€ 2), Real.rpow_natCast]
simpa only [dist_eq_norm,div_eq_mul_inv] using h
lemma graphChildren_length {Ο : Measure (EuclideanSpace β (Fin d))} {a p : β} {X P : CellPath d}
(hP : P β graphChildren Ο a p X) : P.length=p := by
classical
exact (mem_dyadicPaths _ _).mp (Finset.mem_filter.mp (Finset.mem_filter.mp hP).1).1
lemma graphChildren_subset {Ο : Measure (EuclideanSpace β (Fin d))} {a p : β} {X P : CellPath d}
(hP : P β graphChildren Ο a p X) : treeCell P β treeCell X := by
classical
exact graphDescendants_subset (Finset.mem_filter.mp hP).1
lemma graphChildren_center_error {Ο ΞΊ : Measure (EuclideanSpace β (Fin d))} {a p : β}
{X Y P Q : CellPath d} (hP : P β graphChildren Ο a p X) (hQ : Q β graphChildren ΞΊ a p Y)
{x y : EuclideanSpace β (Fin d)} (hx : x β treeCell P) (hy : y β treeCell Q) :
β(x-y)-(treeCenter P-treeCenter Q)β β€ 2*(d+1:β)*(2:β)^(-(p:β)) := by
have hx' := treeCell_diameter hx (treeCenter_mem P)
have hy' := treeCell_diameter hy (treeCenter_mem Q)
rw [graphChildren_length hP] at hx'
rw [graphChildren_length hQ] at hy'
calc
_ = β(x-treeCenter P)-(y-treeCenter Q)β := by congr 1; module
_ β€ βx-treeCenter Pβ+βy-treeCenter Qβ := norm_sub_le _ _
_ β€ _ := by linarith
lemma graphChildren_direct_size {Ο ΞΊ : Measure (EuclideanSpace β (Fin d))} {a p : β}
{X P Q : CellPath d} (hX : X β dyadicPaths a)
(hP : P β graphChildren Ο a p X) (hQ : Q β graphChildren ΞΊ a p X)
{x y : EuclideanSpace β (Fin d)} (hx : x β treeCell P) (hy : y β treeCell Q) :
βx-yβ β€ (d+1:β)*(2:β)^(-(a:β)) := by
simpa only [(mem_dyadicPaths _ _).mp hX] using
treeCell_diameter (graphChildren_subset hP hx) (graphChildren_subset hQ hy)
lemma graphChildren_cross_size {Ο ΞΊ : Measure (EuclideanSpace β (Fin d))} {a p : β}
{X Y P Q : CellPath d} (hX : X β dyadicPaths a) (hY : Y β dyadicPaths a)
(hP : P β graphChildren Ο a p X) (hQ : Q β graphChildren ΞΊ a p Y)
{G : β} (hcenters : βtreeCenter X-treeCenter Yβ β€ G*(2:β)^(-(a:β)))
{x y : EuclideanSpace β (Fin d)} (hx : x β treeCell P) (hy : y β treeCell Q) :
βx-yβ β€ (2*(d+1:β)+G)*(2:β)^(-(a:β)) := by
have hx' := treeCell_diameter (graphChildren_subset hP hx) (treeCenter_mem X)
have hy' := treeCell_diameter (treeCenter_mem Y) (graphChildren_subset hQ hy)
rw [(mem_dyadicPaths _ _).mp hX] at hx'
rw [(mem_dyadicPaths _ _).mp hY] at hy'
calc
_ = β(x-treeCenter X)+(treeCenter X-treeCenter Y)+(treeCenter Y-y)β := by congr 1; module
_ β€ βx-treeCenter Xβ+βtreeCenter X-treeCenter Yβ+βtreeCenter Y-yβ := norm_addβ_le
_ β€ _ := by linarith
lemma graphChildren_profile_card (Ο : Measure (EuclideanSpace β (Fin d))) [IsFiniteMeasure Ο]
{a p : β} (hap : a β€ p) {X : CellPath d} (hX : X β dyadicPaths a)
{R ma mp e : β} (hR : 0 < R)
(hlo : β P β graphChildren Ο a p X, R^(-mp-e) β€ Ο.real (treeCell P))
(hup : Ο.real (treeCell X) β€ R^(-ma+e)) :
((graphChildren Ο a p X).card : β) β€ R^(mp-ma+2*e) := by
have h := graphChildren_card_le Ο hap hX (Real.rpow_pos_of_pos hR _) hlo hup
rw [βReal.rpow_sub hR] at h
convert h using 1; ring_nf
lemma graphChildren_pair_profile_card
(Ο ΞΊ : Measure (EuclideanSpace β (Fin d))) [IsFiniteMeasure Ο] [IsFiniteMeasure ΞΊ]
{a p : β} (hap : a β€ p) {X Y : CellPath d} (hX : X β dyadicPaths a) (hY : Y β dyadicPaths a)
{R maβ mpβ maβ mpβ e : β} (hR : 0 < R)
(hloβ : β P β graphChildren Ο a p X, R^(-mpβ-e) β€ Ο.real (treeCell P))
(hloβ : β P β graphChildren ΞΊ a p Y, R^(-mpβ-e) β€ ΞΊ.real (treeCell P))
(hupβ : Ο.real (treeCell X) β€ R^(-maβ+e))
(hupβ : ΞΊ.real (treeCell Y) β€ R^(-maβ+e)) :
(graphChildren Ο a p X).card * ((graphChildren ΞΊ a p Y).card:β) β€
R^((mpβ-maβ)+(mpβ-maβ)+4*e) := by
have hβ := graphChildren_profile_card Ο hap hX hR hloβ hupβ
have hβ := graphChildren_profile_card ΞΊ hap hY hR hloβ hupβ
calc
_ β€ R^(mpβ-maβ+2*e)*R^(mpβ-maβ+2*e) := mul_le_mul hβ hβ (by positivity) (by positivity)
_ = _ := by rw [βReal.rpow_add hR]; congr 1; ring
end CurrentFalconer.TreeND
end
end
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace CurrentFalconer
open Set MeasureTheory
variable {d : β}
lemma tensorCapND_nonneg (Ξ΄ : β) (a : Fin d β β€) (w : EuclideanSpace β (Fin d)) :
0 β€ tensorCapND Ξ΄ a w := tensorCapKernelND_nonneg _ _
lemma tensorCapND_le_one (Ξ΄ : β) (a : Fin d β β€) (w : EuclideanSpace β (Fin d)) :
tensorCapND Ξ΄ a w β€ 1 := tensorCapKernelND_le_one _ _
lemma sphereCapGridND_card_bound {Ξ΄ : β} (hΞ΄ : 0 < Ξ΄) (hΞ΄1 : Ξ΄ β€ 1) :
((sphereCapGridND d Ξ΄).card : β) β€ (9*Ξ΄β»ΒΉ)^d := by
classical
have hinv : 1 β€ Ξ΄β»ΒΉ := (one_le_invβ hΞ΄).mpr hΞ΄1
have hceil : (βΞ΄β»ΒΉβ:β) < Ξ΄β»ΒΉ+1 := Int.ceil_lt_add_one _
have hci : (0:β€) β€ βΞ΄β»ΒΉβ := Int.ceil_nonneg (by positivity)
have hfull : ((fullCapGridND d Ξ΄).card : β) = (2*(βΞ΄β»ΒΉβ:β)+5)^d := by
simp only [fullCapGridND, Fintype.card_piFinset, Finset.prod_const, Finset.card_univ,
Fintype.card_fin, Nat.cast_pow, Int.card_Icc]
have he : ((βΞ΄β»ΒΉβ+2+1- -(βΞ΄β»ΒΉβ+2)).toNat : β) =
((βΞ΄β»ΒΉβ+2+1- -(βΞ΄β»ΒΉβ+2) : β€):β) := by
exact_mod_cast Int.toNat_of_nonneg (show 0 β€ βΞ΄β»ΒΉβ+2+1- -(βΞ΄β»ΒΉβ+2) by omega)
rw [he]
push_cast
ring
calc
_ β€ ((fullCapGridND d Ξ΄).card : β) := by
exact_mod_cast Finset.card_filter_le (fullCapGridND d Ξ΄) _
_ = _ := hfull
_ β€ _ := pow_le_pow_leftβ (by positivity) (by linarith) d
lemma sphereCap_pair_partition {Ξ΄ : β} (hΞ΄ : 0 < Ξ΄)
(hs : (d+1:β)*Ξ΄ β€ 1/2) (z : EuclideanSpace β (Fin d) Γ EuclideanSpace β (Fin d))
(hz : βz.1β=1 β§ βz.2β=1) :
(β k β (sphereCapGridND d Ξ΄).product (sphereCapGridND d Ξ΄),
0 β€ tensorCapND Ξ΄ k.1 z.1*tensorCapND Ξ΄ k.2 z.2) β§
β k β (sphereCapGridND d Ξ΄).product (sphereCapGridND d Ξ΄),
tensorCapND Ξ΄ k.1 z.1*tensorCapND Ξ΄ k.2 z.2 = 1 := by
classical
constructor
Β· intro k _; positivity [tensorCapND_nonneg Ξ΄ k.1 z.1,tensorCapND_nonneg Ξ΄ k.2 z.2]
Β· calc
_ = β i β sphereCapGridND d Ξ΄, β j β sphereCapGridND d Ξ΄,
tensorCapND Ξ΄ i z.1*tensorCapND Ξ΄ j z.2 :=
Finset.sum_product _ _ _
_ = (β i β sphereCapGridND d Ξ΄, tensorCapND Ξ΄ i z.1)*
(β j β sphereCapGridND d Ξ΄, tensorCapND Ξ΄ j z.2) := (Finset.sum_mul_sum _ _ _ _).symm
_ = 1 := by rw [sphereCapGridND_partition hΞ΄ hs z.1 hz.1,
sphereCapGridND_partition hΞ΄ hs z.2 hz.2,one_mul]
end CurrentFalconer
end
end
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace CurrentFalconer
open Set MeasureTheory
open scoped ComplexConjugate ContDiff
variable {V : Type*} [NormedAddCommGroup V] [InnerProductSpace β V]
[FiniteDimensional β V] [MeasurableSpace V] [BorelSpace V]
structure GraphSymbolJet (b : V β V β β) (m : β) (s B : β) : Prop where
measurable : Measurable (Function.uncurry b)
smooth : β x, ContDiff β β (b x)
nonneg : 0 β€ B
bound : β x j, j β€ m β β w, βwβ=1 β βiteratedFDeriv β j (b x) wβ β€ B*s^j
omit [FiniteDimensional β V] [BorelSpace V] in
lemma GraphSymbolJet.norm_le {b : V β V β β} {m : β} {s B : β}
(h : GraphSymbolJet b m s B) (x w : V) (hw : βwβ=1) : βb x wβ β€ B := by
simpa only [norm_iteratedFDeriv_zero,pow_zero,mul_one] using h.bound x 0 (Nat.zero_le _) w hw
lemma graph_uneligible_transform (Ο Ο : Measure V) [IsFiniteMeasure Ο] [IsFiniteMeasure Ο]
(P : Set V) (M : β) (Ξ· : V β β) (b : V β V β β)
(hΞ· : Measurable Ξ·) (hb : Measurable (Function.uncurry b))
{E B : β} (hE : 0 β€ E) (hB : 0 β€ B)
(hΞ·0 : βα΅ w βΟ, 0 β€ Ξ· w) (hΞ·E : βα΅ w βΟ, Ξ· w β€ E)
(hbB : βα΅ w βΟ, β x, βb x wβ β€ B)
(hz : Β¬0 < β« x in P, β« w, Ξ· w*βb x wβ^2 βΟ βΟ) :
βα΅ w βΟ, Ξ· w=0 β¨ β r, sourceAngularTransformND Ο P M b r w=0 := by
have hz' := zero_cap_energy_transform (Ο.restrict P) Ο Ξ· b hΞ· hb hE hB hΞ·0 hΞ·E hbB
(le_antisymm (not_lt.mp hz) (cap_energy_nonneg _ _ _ _ hΞ·0))
filter_upwards [hz'] with w hw
rcases hw with hw | hw
Β· exact Or.inl hw
right
intro r
have hr := hw r
simp only [sourceAngularTransformND,inv_one,one_smul,Measure.restrict_univ] at hr
simp only [sourceAngularTransformND,hr,smul_zero]
end CurrentFalconer
end
end
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace CurrentFalconer.TreeND
open Set MeasureTheory
variable {d : β}
lemma graphChildren_eligible_iff {Ο : Measure (EuclideanSpace β (Fin d))} {a p : β}
{X P : CellPath d} {Ξ· : EuclideanSpace β (Fin d) β β}
{b : EuclideanSpace β (Fin d) β EuclideanSpace β (Fin d) β β}
(hP : P β graphChildren Ο a p X) :
P β eligibleCells Ο a p X Ξ· b β 0 < cellCapEnergy Ο P Ξ· b := by
classical
have hP' := Finset.mem_filter.mp (Finset.mem_filter.mp hP).1
simp only [eligibleCells,Finset.mem_filter,hP'.1,hP'.2,true_and]
end CurrentFalconer.TreeND
end
end
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace CurrentFalconer
open Set MeasureTheory Attempt4FullFar
open scoped ComplexConjugate ContDiff
variable {V : Type*} [NormedAddCommGroup V] [InnerProductSpace β V]
[FiniteDimensional β V] [MeasurableSpace V] [BorelSpace V]
lemma graphCellLaw_four_ae (Οβ Οβ Οβ Οβ : Measure V)
[IsFiniteMeasure Οβ] [IsFiniteMeasure Οβ] [IsFiniteMeasure Οβ] [IsFiniteMeasure Οβ]
(Pβ Pβ Pβ Pβ : Set V) (Mβ Mβ Mβ Mβ : β)
(hPβ : MeasurableSet Pβ) (hPβ : MeasurableSet Pβ)
(hPβ : MeasurableSet Pβ) (hPβ : MeasurableSet Pβ) :
βα΅ z β((graphCellLaw Οβ Pβ Mβ).prod (graphCellLaw Οβ Pβ Mβ)).prod
((graphCellLaw Οβ Pβ Mβ).prod (graphCellLaw Οβ Pβ Mβ)),
z.1.1 β Pβ β§ z.1.2 β Pβ β§ z.2.1 β Pβ β§ z.2.2 β Pβ := by
have hββ : βα΅ z β(graphCellLaw Οβ Pβ Mβ).prod (graphCellLaw Οβ Pβ Mβ),
z.1 β Pβ β§ z.2 β Pβ := by
filter_upwards [Measure.quasiMeasurePreserving_fst.ae (graphCellLaw_ae Οβ hPβ Mβ),
Measure.quasiMeasurePreserving_snd.ae (graphCellLaw_ae Οβ hPβ Mβ)] with z hβ hβ
exact β¨hβ,hββ©
have hββ : βα΅ z β(graphCellLaw Οβ Pβ Mβ).prod (graphCellLaw Οβ Pβ Mβ),
z.1 β Pβ β§ z.2 β Pβ := by
filter_upwards [Measure.quasiMeasurePreserving_fst.ae (graphCellLaw_ae Οβ hPβ Mβ),
Measure.quasiMeasurePreserving_snd.ae (graphCellLaw_ae Οβ hPβ Mβ)] with z hβ hβ
exact β¨hβ,hββ©
filter_upwards [Measure.quasiMeasurePreserving_fst.ae hββ,
Measure.quasiMeasurePreserving_snd.ae hββ] with z hββ hββ
exact β¨hββ.1,hββ.2,hββ.1,hββ.2β©
lemma graph_radial_budget {Ξ¨ : β β β} (hΞ¨ : ContDiff β β Ξ¨)
(hs : HasCompactSupport Ξ¨) (m : β) :
β K : β, 0 β€ K β§ (β« u : β, β(Ξ¨ u:β)β) β€ K β§
β u, βiteratedDeriv m (fun u => (Ξ¨ u:β)) uβ β€ K := by
let f : β β β := fun u => (Ξ¨ u:β)
have hts : tsupport f = tsupport Ξ¨ := by
change closure (Function.support f) = closure (Function.support Ξ¨)
congr 1
ext u
simp only [Function.mem_support, f, ne_eq, Complex.ofReal_eq_zero]
have hs' : HasCompactSupport f := by
change IsCompact (tsupport f)
rw [hts]
exact hs
have hΞ¨' : ContDiff β β f := Complex.ofRealCLM.contDiff.comp hΞ¨
obtain β¨K,hKβ© := (hs'.iteratedFDeriv m).exists_bound_of_continuous
(hΞ¨'.continuous_iteratedFDeriv (by exact_mod_cast (le_top : (m:ββ) β€ β€)))
refine β¨max K (β« u, βf uβ), (integral_nonneg (fun _ => norm_nonneg _)).trans (le_max_right _ _),
le_max_right _ _,?_β©
intro u
rw [βnorm_iteratedFDeriv_eq_norm_iteratedDeriv]
exact (hK u).trans (le_max_left _ _)
omit [FiniteDimensional β V] [BorelSpace V] in
lemma graph_symbol_pair_budget {b c : V β V β β} {ΞΈ : V β β}
{m : β} {s A B C P : β} (hb : GraphSymbolJet b m s B) (hc : GraphSymbolJet c m s C)
(hΞΈ : ContDiff β β ΞΈ) (hs : 0 β€ s) (hsA : s β€ A) (hP : 0 β€ P)
(hdΞΈ : β j β€ m, β w, βwβ=1 β βiteratedFDeriv β j ΞΈ wβ β€ P*A^j) :
(β z, ContDiff β β (graphPairAmplitude ΞΈ b c z)) β§
β z j, j β€ m β β w, βwβ=1 β
βiteratedFDeriv β j (graphPairAmplitude ΞΈ b c z) wβ β€
(P*B*2^m*C*2^m)*A^j := by
constructor
Β· intro z; exact (hΞΈ.mul (hb.smooth z.1)).mul (Complex.conjCLE.contDiff.comp (hc.smooth z.2))
Β· intro z j hj w hw
exact graphJetPair hΞΈ (hb.smooth z.1) (hc.smooth z.2) m hP hb.nonneg hc.nonneg
(hs.trans hsA) w (fun k hk => hdΞΈ k hk w hw)
(graphJet_enlarge hb.nonneg hs hsA (fun k hk => hb.bound z.1 k hk w hw))
(graphJet_enlarge hc.nonneg hs hsA (fun k hk => hc.bound z.2 k hk w hw)) j hj
end CurrentFalconer
end
end
end OAI
|