File size: 20,984 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 | import Mathlib
import OAI.MeasureTheory.Falconer.Estimates.ActualFarBuffer
import OAI.MeasureTheory.Falconer.Model
import OAI.MeasureTheory.Falconer.Recursion.DirectPolicyWitness
import OAI.MeasureTheory.Falconer.Recursion.Ledger
import OAI.MeasureTheory.Falconer.Recursion.PolicyDescriptors
import OAI.MeasureTheory.FalconerCompletion.Fourier.StationaryInverseUnit3
import OAI.MeasureTheory.FalconerCompletion.Graphs.GraphCapScaleInvCrude
import OAI.MeasureTheory.FalconerCompletion.Graphs.LiteralDyadicPaths
import OAI.MeasureTheory.FalconerCompletion.Recursion.MaskScale2
import OAI.MeasureTheory.FalconerCompletion.Recursion.TreeCellMembershipConstantOnFinerGrid
namespace OAI
/-! Recursive policies and quantitative depth estimates. -/
open _root_.OAI.PlanarFalconer
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace GraphLiteralSupport.CurrentFalconer.TreeND
open Set MeasureTheory Filter PlanarFalconer
open scoped ContDiff Classical
variable {n : β}
structure RecursiveEnvironmentND (n : β) where
Ο : Measure (EuclideanSpace β (Fin (n+1)))
mass : β β β
N : β
q : β
J : β
sig : β
C : β
namespace RecursiveEnvironmentND
noncomputable def profile (e : RecursiveEnvironmentND n) : β β β :=
adjustedProfile (d:=n+1) e.mass e.N
def distanceData (e : RecursiveEnvironmentND n) (a t i : β) (X Y : CellPath (n+1)) :
PositiveDistanceState (n+1) :=
β¨e.Ο,e.mass,e.N,e.q,a,t,e.J,i,e.sig,e.C,X,Yβ©
end RecursiveEnvironmentND
structure RecursiveAngularND (n : β) extends RecursiveEnvironmentND n where
aβ : β
tβ : β
a : β
v : β
i : β
X : CellPath (n+1)
Y : CellPath (n+1)
namespace RecursiveAngularND
noncomputable def profile (e : RecursiveAngularND n) : β β β := e.toRecursiveEnvironmentND.profile
noncomputable def fullList (e : RecursiveAngularND n) : Finset PolicyDescriptor :=
policyDescriptorList e.profile e.N e.q e.aβ e.tβ
noncomputable def retainedList (e : RecursiveAngularND n) (r : β) : Finset PolicyDescriptor :=
unreachedDescriptorList e.profile e.N e.q e.aβ e.tβ r
noncomputable def symbol (e : RecursiveAngularND n)
(L : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f : EuclideanSpace β (Fin (n+1)) β β)
(Q : SmoothFunctionND (EuclideanSpace β (Fin (n+1)))) (r : β) :
EuclideanSpace β (Fin (n+1)) β EuclideanSpace β (Fin (n+1)) β β :=
fun x => (actualResidualSourceSymbol e.profile e.N e.q e.aβ e.tβ r L e.Ο e.mass
e.sig e.C e.J e.i f Q x).1
noncomputable def energy (e : RecursiveAngularND n)
(Lβ Lβ : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f g : EuclideanSpace β (Fin (n+1)) β β)
(Q P : SmoothFunctionND (EuclideanSpace β (Fin (n+1)))) (Ξ¨ : β β β) : β :=
_root_.OAI.Attempt4Near.sourceAngularHND (n+1)
(_root_.OAI.Attempt4FullFar.canonicalSphereMeasureND (EuclideanSpace β (Fin (n+1)))) e.a e.v Ξ¨
(fun z => _root_.OAI.CurrentFalconer.sourceAngularTransformND e.Ο (treeCell e.X)
(((2:β)^e.N)^(-e.mass e.a)) (e.symbol Lβ f Q e.a) z.1 z.2)
(fun z => _root_.OAI.CurrentFalconer.sourceAngularTransformND e.Ο (treeCell e.Y)
(((2:β)^e.N)^(-e.mass e.a)) (e.symbol Lβ g P e.a) z.1 z.2)
noncomputable def sameSymbolChildren (e : RecursiveAngularND n) (p : β)
(Lβ Lβ : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f g : EuclideanSpace β (Fin (n+1)) β β)
(Q P : SmoothFunctionND (EuclideanSpace β (Fin (n+1)))) (Ξ¨ : β β β) : β :=
_root_.OAI.CurrentFalconer.TreeND.graphSourceChildMax e.Ο e.Ο e.a p e.v e.X e.Y
(((2:β)^e.N)^(-e.mass p)) (((2:β)^e.N)^(-e.mass p)) Ξ¨
(e.symbol Lβ f Q e.a) (e.symbol Lβ g P e.a)
noncomputable def graphFactor (e : RecursiveAngularND n) (p : β) : β :=
((2:β)^e.N)^(-2*(e.profile p-e.profile e.a)+height e.profile e.a p+
(e.C+36*(n+1:β)+5)*e.sig)
lemma symbol_measurable (e : RecursiveAngularND n)
(L : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f : EuclideanSpace β (Fin (n+1)) β β) (hf : Measurable f)
(Q : SmoothFunctionND (EuclideanSpace β (Fin (n+1)))) (r : β) :
Measurable (Function.uncurry (e.symbol L f Q r)) :=
actualResidualSourceSymbol_measurable _ _ _ _ _ _ _ _ _ _ _ _ _ _ hf _
lemma symbol_smooth (e : RecursiveAngularND n)
(L : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f : EuclideanSpace β (Fin (n+1)) β β)
(Q : SmoothFunctionND (EuclideanSpace β (Fin (n+1)))) (r : β)
(x : EuclideanSpace β (Fin (n+1))) : ContDiff β β (e.symbol L f Q r x) :=
(actualResidualSourceSymbol e.profile e.N e.q e.aβ e.tβ r L e.Ο e.mass
e.sig e.C e.J e.i f Q x).2
end RecursiveAngularND
theorem uniform_recursive_symbol_jets
(W : Finset (List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1)))))
(M B total : β) (hW : β LβW, L.lengthβ€B) {sig : β} (hsig : 0<sig)
(Cq : β) (hCq : 0β€Cq) :
β E : β, 0β€E β§ βαΆ N : β in atTop, β e : RecursiveAngularND n,
e.N=N β e.sig=sig β 0<e.q β
β (L : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f : EuclideanSpace β (Fin (n+1)) β β) (Q : SmoothFunctionND (EuclideanSpace β (Fin (n+1)))),
Measurable f β (β x, βf xββ€1) β (β bβe.fullList,L bβW) β
(β bβe.fullList,(L b).length)β€total β
(β jβ€M,β w,βwβ=1 β βiteratedFDeriv β j Q.1 wββ€Cq) β
_root_.OAI.CurrentFalconer.GraphSymbolJet (e.symbol L f Q e.a) M
(((2:β)^N)^sig*max 1 ((2:β)^((e.retainedList e.a).sup descriptorLength)*((2:β)^N)^(-50*sig))) E := by
obtain β¨E,hE,hβ© := uniform_actualResidualSourceSymbol_derivatives W M B total hW sig hsig Cq hCq
refine β¨E,hE,?_β©
filter_upwards [h] with N hN
intro e he hs hq L f Q hf hfn hL htotal hQ
subst N
refine β¨e.symbol_measurable L f hf Q e.a,e.symbol_smooth L f Q e.a,hE,?_β©
intro x j hj w hw
have hh := hN e.profile e.q e.aβ e.tβ e.a hq L e.Ο e.mass e.C e.J e.i f Q hL htotal hfn hQ x j hj w hw
simpa only [RecursiveAngularND.symbol,RecursiveAngularND.retainedList,hs,sourceMaskScaleND,
Real.rpow_natCast] using hh
lemma uniform_recursive_symbol_imposes {sig : β} (hsig : 0<sig) {J : β} (hJ : 0<J) :
β Nβ : β, β e : RecursiveAngularND n, Nββ€e.N β e.sig=sig β e.J=J β
IsFiniteMeasure e.Ο β 0<e.q β e.tββ€e.N β
β (L : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f : EuclideanSpace β (Fin (n+1)) β β) (Q : SmoothFunctionND (EuclideanSpace β (Fin (n+1))))
(g p : β), PolicyDescriptor.parallel g pβe.retainedList e.a β
_root_.OAI.CurrentFalconer.TreeND.ImposesParallelTest e.Ο g p
(_root_.OAI.CurrentFalconer.TreeND.testWidth e.N J (e.i+1) p sig)
(((2:β)^e.N)^(height e.profile g p+e.C*sig)) (e.symbol L f Q e.a) := by
obtain β¨Nβ,hsβ© := uniform_actualResidualSourceSymbol_support (n:=n) hsig hJ
refine β¨Nβ,?_β©
intro e hN he hJe hf hq ht L f Q g p hm P hP x hx w hw hn
have hsupp : wβtsupport (iteratedFDeriv β 0
(actualResidualSourceSymbol e.profile e.N e.q e.aβ e.tβ e.a L e.Ο e.mass
sig e.C J e.i f Q x).1) := by
apply subset_closure
rw [Function.mem_support,βnorm_ne_zero_iff,norm_iteratedFDeriv_zero,norm_ne_zero_iff]
simpa only [RecursiveAngularND.symbol,he,hJe] using hn
have hh := hs e.N hN e.Ο hf e.profile e.q e.aβ e.tβ e.a hq ht e.mass e.C e.i L f Q 0 x hsupp
have hg := (hh.resolve_left (not_not.mpr hw)) (.parallel g p) hm P
(by simpa only [descriptorAnchor,_root_.OAI.CurrentFalconer.TreeND.literal_dyadicPaths] using hP)
(by simpa only [_root_.OAI.CurrentFalconer.TreeND.literal_treeCell] using hx)
simpa only [descriptorGood,testWidth,_root_.OAI.CurrentFalconer.TreeND.testWidth,
_root_.OAI.CurrentFalconer.TreeND.literal_fullParallelCount,RecursiveAngularND.profile,
RecursiveEnvironmentND.profile] using hg.2
theorem uniform_recursive_direct_graph {sig : β} (hsig : 0<sig)
(T : β) (J : β) (hJ : 0<J) (Ξ¨ : β β β) (hΞ¨ : ContDiff β β Ξ¨)
(hsupp : tsupport Ξ¨βIoo (1/4:β) 4) (hΞ¨0 : β r,0β€Ξ¨ r) :
β M : β, β (W : Finset (List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1)))))
(B total : β), (β LβW,L.lengthβ€B) β β Cq : β,0β€Cq β
β E : β,0β€E β§ β Nβ : β, β e : RecursiveAngularND n,
Nββ€e.N β e.sig=sig β e.J=J β e.i<e.J β
β Bβ s,RegularizedProfileData e.Ο e.N Bβ s sig e.mass β
0<e.q β β10*sig*(e.N:β)ββ<e.q β sig*(e.N:β)β€e.q β 10*sig*(e.N:β)β€e.q β
e.aββ€e.a β e.vβ€e.tβ β e.tββ€e.N β (e.tβ:β)β€(e.v:β)+sig*e.N β e.a+100*e.q<e.v β
e.v-2*sourceFarBuffer e.N ((e.retainedList e.a).sup descriptorLength) sigβ€e.a β
e.XβdyadicPaths e.a β e.YβdyadicPaths e.a β 0<e.Ο (treeCell e.X) β 0<e.Ο (treeCell e.Y) β
β (Lβ Lβ : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f g : EuclideanSpace β (Fin (n+1)) β β) (Q P : SmoothFunctionND (EuclideanSpace β (Fin (n+1)))),
Measurable f β Measurable g β (β x,βf xββ€1) β (β x,βg xββ€1) β
(β bβe.fullList,Lβ bβW) β (β bβe.fullList,Lβ bβW) β
(β bβe.fullList,(Lβ b).length)β€total β (β bβe.fullList,(Lβ b).length)β€total β
(β jβ€M,β w,βwβ=1 β βiteratedFDeriv β j Q.1 wββ€Cq) β
(β jβ€M,β w,βwβ=1 β βiteratedFDeriv β j P.1 wββ€Cq) β
β b : PolicyDescriptor, DirectPolicyWitness e.profile e.N e.q e.aβ e.tβ e.a e.v sig b β§
e.energy Lβ Lβ f g Q P Ξ¨ β€ e.graphFactor (descriptorAnchor b)*
e.sameSymbolChildren (descriptorAnchor b) Lβ Lβ f g Q P Ξ¨+E*((2:β)^e.N)^(-T) := by
let cβ : β := 1/(4*(n+2:β))
have hcβ : 0<cβ := by dsimp [cβ]; positivity
have hcsmall : ((n+1:β)+1:β)*cββ€1/2 := by
have he : ((n+1:β)+1:β)*cβ=1/4 := by dsimp [cβ]; push_cast; field_simp; ring
rw [he]; norm_num
obtain β¨M,C,hC,Ng,hgraphβ© := _root_.OAI.CurrentFalconer.TreeND.graph_H_finite_jet_estimate
(d:=n+1) hsig hcβ hcsmall T
obtain β¨K,hK,hint,hderβ© := _root_.OAI.CurrentFalconer.graph_fixed_radial_budget hΞ¨
(IsCompact.of_isClosed_subset isCompact_Icc (isClosed_tsupport Ξ¨) (hsupp.trans Ioo_subset_Icc_self)) M
obtain β¨Nt,htestβ© := uniform_recursive_symbol_imposes (n:=n) hsig hJ
refine β¨M,?_β©
intro W B total hW Cq hCq
obtain β¨D,hD,hjetsβ© := uniform_recursive_symbol_jets W M B total hW hsig Cq hCq
obtain β¨Nj,hjetsβ© := Filter.eventually_atTop.mp hjets
refine β¨C*K*D^4,by positivity,max Ng (max Nt Nj),?_β©
intro e hN he hJe hi Bβ s hΟ hq hceil hsigN hsig10 haβ hvβ htβ ht hw hdir hX hY hoccX hoccY
Lβ Lβ f g Q P hf hg hfn hgn hLβ hLβ htotalβ htotalβ hQ hP
let := hΟ.probability
obtain β¨b,hbβ© := actual_direct_policy_witness e.profile hsig.le hq hceil hsigN hsig10 ht hw hdir
refine β¨b,hb,?_β©
let p := descriptorAnchor b
let gβ := max e.a (p-descriptorLength b)
have hscale : (((e.retainedList e.a).sup descriptorLength : β) : β)=descriptorLength b := by
exact_mod_cast hb.maximal.symm
have hlen : (((e.retainedList e.a).sup descriptorLength : β) : β)β€(e.v:β)-p+2*sig*e.N := by
rw [hscale]; exact hb.length_scale
have hdep : (p:β)-e.aβ€(e.v:β)-p+2*sig*e.N := by
have hh := hb.depth_scale
rw [Nat.cast_sub hb.anchor_gt.le] at hh
exact hh
have hgnear : (gβ:β)β€(e.a:β)+2*sig*e.N := by
have hh := hb.g_slack
change (gβ:β)-(e.a:β) β€ sig*e.N at hh
have : 0 β€ sig*(e.N:β) := by positivity
linarith
have hjβ := hjets e.N (by omega) e rfl he hq Lβ f Q hf hfn hLβ htotalβ hQ
have hjβ := hjets e.N (by omega) e rfl he hq Lβ g P hg hgn hLβ htotalβ hP
have htβ := htest e (by omega) he hJe inferInstance hq htβ Lβ f Q gβ p hb.companion
have htβ := htest e (by omega) he hJe inferInstance hq htβ Lβ g P gβ p hb.companion
have hΟ' := (_root_.OAI.CurrentFalconer.TreeND.literal_regularizedProfileData_iff e.Ο e.N Bβ s sig e.mass).mp hΟ
have hh := hgraph e.N (by omega) e.Ο e.Ο Bβ s s e.mass e.mass hΟ' hΟ' e.a p (e.v:β)
(((e.retainedList e.a).sup descriptorLength : β) : β) e.C K D J (e.i+1) (e.i+1) gβ gβ e.X e.Y Ξ¨
(e.symbol Lβ f Q e.a) (e.symbol Lβ g P e.a) hb.anchor_gt
(by exact_mod_cast hb.anchor_lt.le) (by exact_mod_cast hvβ.trans htβ) hdep hlen hb.frequency_slack
(le_max_left _ _) (le_max_left _ _) hb.g_lt hb.g_lt hgnear hgnear hJ (by omega) (by omega)
(by simpa only [_root_.OAI.CurrentFalconer.TreeND.literal_dyadicPaths] using hX)
(by simpa only [_root_.OAI.CurrentFalconer.TreeND.literal_dyadicPaths] using hY)
(by simpa only [_root_.OAI.CurrentFalconer.TreeND.literal_treeCell] using hoccX)
(by simpa only [_root_.OAI.CurrentFalconer.TreeND.literal_treeCell] using hoccY)
hΞ¨ (hsupp.trans Ioo_subset_Icc_self) hΞ¨0 hint (hder M le_rfl) hK (by simpa only [Real.rpow_natCast] using hjβ) (by simpa only [Real.rpow_natCast] using hjβ)
(by convert htβ using 1; rfl) (by convert htβ using 1; rfl)
have hfactor : ((2:β)^e.N)^(-((_root_.OAI.CurrentFalconer.TreeND.adjustedProfile (d:=n+1) e.mass e.N p-
_root_.OAI.CurrentFalconer.TreeND.adjustedProfile (d:=n+1) e.mass e.N e.a)+
(_root_.OAI.CurrentFalconer.TreeND.adjustedProfile (d:=n+1) e.mass e.N p-
_root_.OAI.CurrentFalconer.TreeND.adjustedProfile (d:=n+1) e.mass e.N e.a))+
min (_root_.OAI.PlanarFalconer.height (_root_.OAI.CurrentFalconer.TreeND.adjustedProfile (d:=n+1) e.mass e.N) e.a p)
(_root_.OAI.PlanarFalconer.height (_root_.OAI.CurrentFalconer.TreeND.adjustedProfile (d:=n+1) e.mass e.N) e.a p)+
(e.C+36*(n+1:β)+5)*sig)=e.graphFactor p := by
unfold RecursiveAngularND.graphFactor
rw [he,min_self]
congr 1
change -((e.profile p-e.profile e.a)+(e.profile p-e.profile e.a))+height e.profile e.a p+_=_
ring
simp only [Nat.cast_add,Nat.cast_one] at hh
rw [hfactor] at hh
simpa only [RecursiveAngularND.energy,RecursiveAngularND.sameSymbolChildren,
_root_.OAI.CurrentFalconer.TreeND.literal_treeCell,Nat.cast_add,Nat.cast_one] using hh
namespace RecursiveAngularND
noncomputable def reachedChildren (e : RecursiveAngularND n) (p : β)
(Lβ Lβ : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f g : EuclideanSpace β (Fin (n+1)) β β)
(Q P : SmoothFunctionND (EuclideanSpace β (Fin (n+1)))) (Ξ¨ : β β β) : β :=
_root_.OAI.CurrentFalconer.TreeND.graphSourceChildMax e.Ο e.Ο e.a p e.v e.X e.Y
(((2:β)^e.N)^(-e.mass p)) (((2:β)^e.N)^(-e.mass p)) Ξ¨
(e.symbol Lβ f Q p) (e.symbol Lβ g P p)
def successor (e : RecursiveAngularND n) (p : β) (X Y : CellPath (n+1)) : RecursiveAngularND n :=
{e with a:=p,X:=X,Y:=Y}
end RecursiveAngularND
theorem uniform_recursive_reached_removal
(W : Finset (List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1)))))
(B total : β) (hW : β LβW,L.lengthβ€B) {sig : β} (hsig : 0<sig) (Cq : β) (hCq : 0β€Cq) :
β D : β,1β€D β§ βαΆ N : β in atTop, β e : RecursiveAngularND n,
e.N=N β e.sig=sig β IsFiniteMeasure e.Ο β 0<e.q β β p : β,e.aβ€p β
β (Lβ Lβ : PolicyDescriptor β List (EuclideanSpace β (Fin (n+1)) βL[β] EuclideanSpace β (Fin (n+1))))
(f g : EuclideanSpace β (Fin (n+1)) β β) (Q P : SmoothFunctionND (EuclideanSpace β (Fin (n+1)))),
Measurable f β Measurable g β (β x,βf xββ€1) β (β x,βg xββ€1) β
(β bβe.fullList,Lβ bβW) β (β bβe.fullList,Lβ bβW) β
(β bβe.fullList,(Lβ b).length)β€total β (β bβe.fullList,(Lβ b).length)β€total β
(β w,βwβ=1 β βQ.1 wββ€Cq) β (β w,βwβ=1 β βP.1 wββ€Cq) β
β Ξ¨ : β β β, Integrable (fun r => Ξ¨ (r/(2:β)^e.v)) β (β r,0β€Ξ¨ r) β
e.sameSymbolChildren p Lβ Lβ f g Q P Ξ¨β€D^(4*total)*e.reachedChildren p Lβ Lβ f g Q P Ξ¨ := by
obtain β¨D,hD,hremβ© := actualResidual_graph_reached_removalND W B total hW hsig Cq hCq
refine β¨D,hD,?_β©
filter_upwards [hrem] with N hrem
intro e he hs hfin hq p hap Lβ Lβ f g Q P hf hg hfn hgn hLβ hLβ htotalβ htotalβ hQ hP Ξ¨ hiΞ¨ hΞ¨
subst N
let := hfin
have hcell (X Y : CellPath (n+1)) (hX : X.length=p) (hY : Y.length=p) :
_root_.OAI.Attempt4Near.sourceAngularHND (n+1)
(_root_.OAI.Attempt4FullFar.canonicalSphereMeasureND (EuclideanSpace β (Fin (n+1)))) p e.v Ξ¨
(fun z => _root_.OAI.CurrentFalconer.sourceAngularTransformND e.Ο (treeCell X)
(((2:β)^e.N)^(-e.mass p)) (e.symbol Lβ f Q e.a) z.1 z.2)
(fun z => _root_.OAI.CurrentFalconer.sourceAngularTransformND e.Ο (treeCell Y)
(((2:β)^e.N)^(-e.mass p)) (e.symbol Lβ g P e.a) z.1 z.2) β€
D^(4*total)*(e.successor p X Y).energy Lβ Lβ f g Q P Ξ¨ := by
let X' : Fin (n+1) β β€ := fun j => (pathIndex X j:β€)
let Y' : Fin (n+1) β β€ := fun j => (pathIndex Y j:β€)
have hXY : (({X'}:Finset (Fin (n+1) β β€)).product {Y'}).Nonempty := by simp
have hh := hrem e.Ο e.Ο e.profile e.q e.aβ e.tβ e.a p hq hap Lβ Lβ e.mass e.C e.J e.i
f g Q P hf hg hfn hgn hLβ hLβ htotalβ htotalβ hQ hP {X'} {Y'} hXY
(((2:β)^e.N)^(-e.mass p)) (((2:β)^e.N)^(-e.mass p)) e.v Ξ¨ (by simpa only [Real.rpow_natCast] using hiΞ¨) hΞ¨
have hprod : ({X'} : Finset (Fin (n+1) β β€)).product {Y'} = {(X',Y')} := by ext z; simp
simp only [Attempt4Near.graphChildMaxND,hprod,Finset.sup'_singleton] at hh
have heX : treeCell X=Attempt4FullFar.ambientGridCell p X' := by
unfold treeCell; rw [hX]; rfl
have heY : treeCell Y=Attempt4FullFar.ambientGridCell p Y' := by
unfold treeCell; rw [hY]; rfl
change _ β€ D^(4*total)*
_root_.OAI.Attempt4Near.sourceAngularHND (n+1)
(_root_.OAI.Attempt4FullFar.canonicalSphereMeasureND (EuclideanSpace β (Fin (n+1)))) p e.v Ξ¨
(fun z => _root_.OAI.CurrentFalconer.sourceAngularTransformND e.Ο (treeCell X)
(((2:β)^e.N)^(-e.mass p)) (e.symbol Lβ f Q p) z.1 z.2)
(fun z => _root_.OAI.CurrentFalconer.sourceAngularTransformND e.Ο (treeCell Y)
(((2:β)^e.N)^(-e.mass p)) (e.symbol Lβ g P p) z.1 z.2)
rw [βhs] at hh
rw [heX,heY]
convert hh using 1 <;> rfl
unfold RecursiveAngularND.sameSymbolChildren RecursiveAngularND.reachedChildren
_root_.OAI.CurrentFalconer.TreeND.graphSourceChildMax
split_ifs with hAB
Β· apply Finset.sup'_le
intro z hz
have hX : z.1.length=p := _root_.OAI.CurrentFalconer.TreeND.mem_dyadicPaths p z.1 |>.mp
(Finset.mem_filter.mp (Finset.mem_filter.mp (Finset.mem_product.mp hz).1).1).1
have hY : z.2.length=p := _root_.OAI.CurrentFalconer.TreeND.mem_dyadicPaths p z.2 |>.mp
(Finset.mem_filter.mp (Finset.mem_filter.mp (Finset.mem_product.mp hz).2).1).1
have hh := hcell z.1 z.2 hX hY
simp only [_root_.OAI.CurrentFalconer.TreeND.literal_treeCell] at hh
apply hh.trans
apply mul_le_mul_of_nonneg_left _ (by positivity)
change _ β€ (( _root_.OAI.CurrentFalconer.TreeND.graphChildren e.Ο e.a p e.X).product
(_root_.OAI.CurrentFalconer.TreeND.graphChildren e.Ο e.a p e.Y)).sup' hAB _
dsimp only [RecursiveAngularND.energy,RecursiveAngularND.successor,RecursiveAngularND.symbol]
simp only [_root_.OAI.CurrentFalconer.TreeND.literal_treeCell]
convert (Finset.le_sup' (f:=fun z =>
_root_.OAI.Attempt4Near.sourceAngularHND (n+1)
(_root_.OAI.Attempt4FullFar.canonicalSphereMeasureND (EuclideanSpace β (Fin (n+1)))) p e.v Ξ¨
(fun q => _root_.OAI.CurrentFalconer.sourceAngularTransformND e.Ο
(_root_.OAI.CurrentFalconer.TreeND.treeCell z.1) (((2:β)^e.N)^(-e.mass p)) (e.symbol Lβ f Q p) q.1 q.2)
(fun q => _root_.OAI.CurrentFalconer.sourceAngularTransformND e.Ο
(_root_.OAI.CurrentFalconer.TreeND.treeCell z.2) (((2:β)^e.N)^(-e.mass p)) (e.symbol Lβ g P p) q.1 q.2)) hz) using 1; rfl
Β· simp
end GraphLiteralSupport.CurrentFalconer.TreeND
end
end
end OAI
|