math / data /lean /OAI /MeasureTheory /Falconer /Angular /AngularEnvelopeGraph.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
16.8 kB
import OAI.MeasureTheory.Falconer.Angular.AngularEnvelope
import OAI.MeasureTheory.Falconer.Graphs.ProfileGraphEstimate
namespace OAI
/-! # The actual profile graph estimate on the admissible energy envelope
Restriction to a child is implemented by the existing spatial cell symbol.
The original restricted endpoint integral is unchanged, and the support
condition is propagated explicitly to the child's good set.
-/
namespace Falconer
open Set MeasureTheory
open scoped SchwartzMap
noncomputable def finiteEnvelopeMaximum {ΞΉ : Type*} (S : Finset ΞΉ) (F : ΞΉ β†’ ℝ) : ℝ :=
sSup (insert 0 (F '' (S : Set ΞΉ)))
theorem finiteEnvelopeMaximum_nonneg {ΞΉ : Type*} (S : Finset ΞΉ) (F : ΞΉ β†’ ℝ) :
0 ≀ finiteEnvelopeMaximum S F :=
le_csSup ((S.finite_toSet.image F).insert 0).bddAbove (Or.inl rfl)
theorem le_finiteEnvelopeMaximum {ΞΉ : Type*} (S : Finset ΞΉ) (F : ΞΉ β†’ ℝ)
{i : ΞΉ} (hi : i ∈ S) : F i ≀ finiteEnvelopeMaximum S F :=
le_csSup ((S.finite_toSet.image F).insert 0).bddAbove (Or.inr ⟨i,hi,rfl⟩)
theorem finiteEnvelopeMaximum_le {ΞΉ : Type*} (S : Finset ΞΉ) (F : ΞΉ β†’ ℝ)
{H : ℝ} (hH : 0 ≀ H) (h : βˆ€ i ∈ S, F i ≀ H) :
finiteEnvelopeMaximum S F ≀ H := by
change sSup (insert (0:ℝ) (F '' (S : Set ΞΉ))) ≀ H
apply csSup_le (show (insert (0:ℝ) (F '' (S : Set ΞΉ))).Nonempty from ⟨0,Or.inl rfl⟩)
intro x hx
rcases hx with rfl | ⟨i,hi,rfl⟩
Β· exact hH
Β· exact h i hi
theorem angularEnvelope_le_of_admissible {n : β„•}
(ΞΌ Ξ½ : Measure (Space (n+2))) (M P : ℝ) (k : β„•) (D a v : ℝ) (Ξ¨ : ℝ β†’ ℝ)
(GoodLeft GoodRight : Set (Space (n+2) Γ— Sphere (n+2)))
{H : ℝ} (hH : 0 ≀ H)
(h : βˆ€ b c, AngularAdmissible k D GoodLeft b β†’ AngularAdmissible k D GoodRight c β†’
independentAngularEnergy a v Ξ¨
(fun z => endpointTransform ΞΌ M b z.1 z.2)
(fun z => endpointTransform Ξ½ P c z.1 z.2) ≀ H) :
angularEnvelope ΞΌ Ξ½ M P k D a v Ξ¨ GoodLeft GoodRight ≀ H := by
apply csSup_le (angularEnergyValues_nonempty ΞΌ Ξ½ M P k D a v Ξ¨ GoodLeft GoodRight)
intro E hE
rcases hE with rfl | ⟨b,c,hb,hc,rfl⟩
Β· exact hH
Β· exact h b c hb hc
theorem AngularAdmissible.cell {n k : β„•} {D : ℝ}
{Good Good' : Set (Space (n+2) Γ— Sphere (n+2))}
{b : Space (n+2) β†’ Sphere (n+2) β†’ β„‚}
(h : AngularAdmissible k D Good b) (hD : 0 ≀ D) (Q : DyadicCube (n+2))
(hGood : βˆ€ x ∈ Q.carrier, βˆ€ w, (x,w) ∈ Good β†’ (x,w) ∈ Good') :
AngularAdmissible k D Good' (cellSymbol Q b) := by
refine ⟨h.1.cell (by norm_num) hD Q,?_⟩
intro x w hw
have hx := cellSymbol_active Q b hw
have hb : b x w β‰  0 := by simpa only [cellSymbol,ite_eq_left hx] using hw
exact hGood x hx w (h.2 x w hb)
theorem child_energy_le_angularEnvelope {n k : β„•} {D : ℝ}
(ΞΌ Ξ½ : Measure (Space (n+2))) [IsFiniteMeasure ΞΌ] [IsFiniteMeasure Ξ½]
(Q₁ Qβ‚‚ : DyadicCube (n+2)) {M P : ℝ} (hM : 0 < M) (hP : 0 < P)
(hD : 0 ≀ D) (a v : ℝ) (Ξ¨ : ℝ β†’ ℝ)
[IsFiniteMeasure (PlanarFalconer.sourceAngularShellMeasure v Ξ¨)]
(GoodLeft GoodRight ChildLeft ChildRight : Set (Space (n+2) Γ— Sphere (n+2)))
(hLeft : βˆ€ x ∈ Q₁.carrier, βˆ€ w, (x,w) ∈ GoodLeft β†’ (x,w) ∈ ChildLeft)
(hRight : βˆ€ x ∈ Qβ‚‚.carrier, βˆ€ w, (x,w) ∈ GoodRight β†’ (x,w) ∈ ChildRight)
(b c : Space (n+2) β†’ Sphere (n+2) β†’ β„‚)
(hb : AngularAdmissible k D GoodLeft b) (hc : AngularAdmissible k D GoodRight c) :
independentAngularEnergy a v Ξ¨
(fun z => endpointTransform (ΞΌ.restrict Q₁.carrier) M b z.1 z.2)
(fun z => endpointTransform (Ξ½.restrict Qβ‚‚.carrier) P c z.1 z.2) ≀
angularEnvelope (ΞΌ.restrict Q₁.carrier) (Ξ½.restrict Qβ‚‚.carrier)
M P k D a v Ξ¨ ChildLeft ChildRight := by
have h := admissible_energy_le_angularEnvelope (ΞΌ.restrict Q₁.carrier) (Ξ½.restrict Qβ‚‚.carrier)
hM hP k D a v Ξ¨ ChildLeft ChildRight (cellSymbol Q₁ b) (cellSymbol Qβ‚‚ c)
(hb.cell hD Q₁ hLeft) (hc.cell hD Qβ‚‚ hRight)
simpa only [endpointTransform_cellSymbol] using h
theorem profile_angular_envelope_terminal {n : β„•} (k : β„•) (D : ℝ)
(Q : DyadicCube (n+2)) (ρ : Measure (Space (n+2)))
{m : ℝ β†’ ℝ} {N : β„•} {s lam : ℝ}
(hreg : Regularization.RegularizedProfileData Q ρ N s lam m) (hN : 0 < N)
{a q : β„•} (ha : a ≀ N) (X Y : List (Fin (n+2) β†’ Bool))
(hX : X.length = a) (hY : Y.length = a) (v : ℝ)
(hv : v ≀ (a:ℝ)+100*q) (Ξ¨ : ℝ β†’ ℝ) {W : ℝ}
(hW : 0 ≀ W) (hΞ¨ : βˆ€ t, Ξ¨ t ≀ W) (hsupp : βˆ€ t, 4 < t β†’ Ξ¨ t = 0)
(GoodLeft GoodRight : Set (Space (n+2) Γ— Sphere (n+2))) :
angularEnvelope (ρ.restrict (Q.descendant X).carrier) (ρ.restrict (Q.descendant Y).carrier)
(profileModelMass m N a) (profileModelMass m N a) k D a v Ξ¨ GoodLeft GoodRight ≀
(4*W*(sphereMeasure (n+2)).real univ^2)*
((2:ℝ)^N)^(100*((n+2:β„•):ℝ)*q/N+4*(((n+2:β„•):ℝ)+1)*lam) := by
apply angularEnvelope_le_of_admissible _ _ _ _ _ _ _ _ _ _ _ (by positivity)
intro b c hb hc
simpa only [one_pow,mul_one] using profile_angular_terminal Q ρ hreg hN ha X Y
hX hY v hv Ξ¨ hW hΞ¨ hsupp (by norm_num : (0:ℝ) ≀ 1) b c hb.1.bound hc.1.bound
/-- The finite maximum uses the same original measures and the actual child good sets. -/
noncomputable def childAngularEnvelopeMaximum {n : β„•}
(Q₁ Qβ‚‚ : DyadicCube (n+2)) (ρ₁ ρ₂ : Measure (Space (n+2))) (j : β„•)
(M P : ℝ) (k : β„•) (D a v : ℝ) (Ξ¨ : ℝ β†’ ℝ)
(GoodLeft GoodRight : List (Fin (n+2) β†’ Bool) β†’
Set (Space (n+2) Γ— Sphere (n+2))) : ℝ :=
finiteEnvelopeMaximum (Q₁.occupiedPaths ρ₁ j Γ—Λ’ Qβ‚‚.occupiedPaths ρ₂ j)
(fun row => angularEnvelope
(ρ₁.restrict (Q₁.descendant row.1).carrier)
(ρ₂.restrict (Qβ‚‚.descendant row.2).carrier)
M P k D a v Ξ¨ (GoodLeft row.1) (GoodRight row.2))
/-- The actual near contribution uses the same finite child maximum as the graph step. -/
theorem profile_near_le_child_angular_envelope {n k : β„•} (D : ℝ) (hD : 0 ≀ D)
(Q : DyadicCube (n+2)) (hQ : Q.side = 1) (ρ : Measure (Space (n+2)))
{m : ℝ β†’ ℝ} {N : β„•} {s lam : ℝ}
(hreg : Regularization.RegularizedProfileData Q ρ N s lam m) (hN : 0 < N)
{a p : β„•} (hap : a ≀ p) (hp : p ≀ N)
(X Y : List (Fin (n+2) β†’ Bool)) (hX : X.length = a) (hY : Y.length = a)
(v : ℝ) (Ξ¨ : ℝ β†’ ℝ)
[IsFiniteMeasure (PlanarFalconer.sourceAngularShellMeasure v Ξ¨)]
(GoodLeft GoodRight : Set (Space (n+2) Γ— Sphere (n+2)))
(ChildLeft ChildRight : List (Fin (n+2) β†’ Bool) β†’
Set (Space (n+2) Γ— Sphere (n+2)))
(hLeft : βˆ€ q ∈ (Q.descendant X).occupiedPaths ρ (p-a),
βˆ€ x ∈ ((Q.descendant X).descendant q).carrier, βˆ€ z,
(x,z) ∈ GoodLeft β†’ (x,z) ∈ ChildLeft q)
(hRight : βˆ€ q ∈ (Q.descendant Y).occupiedPaths ρ (p-a),
βˆ€ x ∈ ((Q.descendant Y).descendant q).carrier, βˆ€ z,
(x,z) ∈ GoodRight β†’ (x,z) ∈ ChildRight q)
(b c : Space (n+2) β†’ Sphere (n+2) β†’ β„‚)
(hb : AngularAdmissible k D GoodLeft b) (hc : AngularAdmissible k D GoodRight c) :
profileNearEnergy (Q.descendant X) (Q.descendant Y) ρ m N a p v Ξ¨ b c ≀
((2*(10*((n+2)+1))+1)^(2*(n+2)):β„•) *
((2:ℝ)^N)^(-2*((m ((p:ℝ)/N)-(((n+2:β„•):ℝ)/2)*(p:ℝ)/N)-
(m ((a:ℝ)/N)-(((n+2:β„•):ℝ)/2)*(a:ℝ)/N))+4*(((n+2:β„•):ℝ)+1)*lam)*
childAngularEnvelopeMaximum (Q.descendant X) (Q.descendant Y) ρ ρ (p-a)
(profileModelMass m N p) (profileModelMass m N p) k D p v Ξ¨
ChildLeft ChildRight := by
let := hreg.probability
have hM : 0 < profileModelMass m N p := by unfold profileModelMass; positivity
apply profile_near_reduction Q hQ ρ hreg hN hap hp X Y hX hY v Ψ b c
hb.1.measurable hc.1.measurable (by norm_num) (by norm_num)
(finiteEnvelopeMaximum_nonneg _ _) hb.1.bound hc.1.bound
intro row hrow
have hr := Finset.mem_product.mp hrow
apply (child_energy_le_angularEnvelope ρ ρ
((Q.descendant X).descendant row.1) ((Q.descendant Y).descendant row.2)
hM hM hD p v Ξ¨ GoodLeft GoodRight (ChildLeft row.1) (ChildRight row.2)
(hLeft row.1 hr.1) (hRight row.2 hr.2) b c hb hc).trans
exact le_finiteEnvelopeMaximum _ (fun row =>
angularEnvelope (ρ.restrict ((Q.descendant X).descendant row.1).carrier)
(ρ.restrict ((Q.descendant Y).descendant row.2).carrier)
(profileModelMass m N p) (profileModelMass m N p) k D p v Ξ¨
(ChildLeft row.1) (ChildRight row.2)) hrow
/-- The graph estimate preserves the fixed symbol budget in the parent and child
suprema. Only the localization estimate uses the enlarged analytic budget. -/
theorem dyadic_profile_angular_envelope_step
(hpublished : PublishedGnomonicSurface) (n k : β„•) (hn : 1 ≀ n)
(Ο† : 𝓒(ℝ, β„‚)) (Ξ¨ : ℝ β†’ ℝ)
(hΟ† : βˆ€ u, Ο† u = (Ξ¨ u : β„‚)) (hΞ¨ : Measurable Ξ¨)
(hpos : βˆ€ u, 0 ≀ Ξ¨ u) (hzero : βˆ€ u ≀ 0, Ξ¨ u = 0)
{W : ℝ} (hW : 0 ≀ W) (hΞ¨W : βˆ€ t, Ξ¨ t ≀ W)
(hsupp : βˆ€ t, Ξ¨ t β‰  0 β†’ t ∈ Ioo (1/4 : ℝ) 4)
{Ξ± : ℝ} (hΞ± : 0 < Ξ±) (T : ℝ) :
βˆƒ A C : ℝ, 0 ≀ A ∧ 0 < C ∧
βˆ€ (Q₁ Qβ‚‚ : DyadicCube (n+2)), Q₁.side = 1 β†’ Qβ‚‚.side = 1 β†’
βˆ€ (ρ₁ ρ₂ : Measure (Space (n+2))) (N : β„•) (s₁ sβ‚‚ lam : ℝ)
(m₁ mβ‚‚ : ℝ β†’ ℝ),
Regularization.RegularizedProfileData Q₁ ρ₁ N s₁ lam m₁ β†’
Regularization.RegularizedProfileData Qβ‚‚ ρ₂ N sβ‚‚ lam mβ‚‚ β†’ 0 < N β†’
βˆ€ (a p g₁ gβ‚‚ : β„•) (Οƒ : ℝ), a ≀ p β†’ p ≀ N β†’ 0 ≀ Οƒ β†’
a ≀ g₁ β†’ g₁ ≀ p β†’ (g₁:ℝ)-a ≀ 2*Οƒ*N β†’
a ≀ gβ‚‚ β†’ gβ‚‚ ≀ p β†’ (gβ‚‚:ℝ)-a ≀ 2*Οƒ*N β†’
βˆ€ (X Y : List (Fin (n+2) β†’ Bool)), X.length = a β†’ Y.length = a β†’
βˆ€ (v Ο„ Ξ΄ H Dsym Dgraph : ℝ), 0 < Ο„ β†’ 0 < Ξ΄ β†’ Ξ΄ ≀ 1/2 β†’
0 ≀ H β†’ 0 ≀ Dsym β†’ Dsym ≀ Dgraph β†’ 1 ≀ Dgraph β†’ δ⁻¹ ≀ Dgraph β†’
Real.sqrt (n+2 : β„•)*(Q₁.descendant X).side ≀ (Ο„/4)*Dgraph β†’
2*Real.sqrt (n+2 : β„•)*((Q₁.descendant X).side/(2:ℝ)^(p-a))+
8*Ξ΄*(Real.sqrt (n+2 : β„•)*(Q₁.descendant X).side) ≀ Ο„/4 β†’
4*Real.pi*((2:ℝ)^N)^Ξ± ≀ (2:ℝ)^v*Ο„ β†’
4*Ο„*((2:ℝ)^(p-a)/(Q₁.descendant X).side) ≀
(⌈4*((2:ℝ)^N)^(30*Οƒ)βŒ‰β‚Š:ℝ) β†’
βˆ€ {ΞΉ : Type*} (K : Finset ΞΉ) (w : ΞΉ β†’ Sphere (n+2))
(Ξ· : ΞΉ β†’ Sphere (n+2) β†’ ℝ),
(βˆ€ j ∈ K, ChartCapControl k (Ξ· j) (w j : Space (n+2)) Ξ΄ H) β†’
(βˆ€ j ∈ K, βˆ€ z, 0 ≀ Ξ· j z) β†’ (βˆ€ z, βˆ‘ j ∈ K, Ξ· j z = 1) β†’
βˆ€ (GoodLeft GoodRight : Set (Space (n+2) Γ— Sphere (n+2)))
(ChildLeft ChildRight : List (Fin (n+2) β†’ Bool) β†’
Set (Space (n+2) Γ— Sphere (n+2))),
(βˆ€ q ∈ (Q₁.descendant X).occupiedPaths ρ₁ (p-a),
βˆ€ x ∈ ((Q₁.descendant X).descendant q).carrier, βˆ€ z,
(x,z) ∈ GoodLeft β†’ (x,z) ∈ ChildLeft q) β†’
(βˆ€ q ∈ (Qβ‚‚.descendant Y).occupiedPaths ρ₂ (p-a),
βˆ€ x ∈ ((Qβ‚‚.descendant Y).descendant q).carrier, βˆ€ z,
(x,z) ∈ GoodRight β†’ (x,z) ∈ ChildRight q) β†’
βˆ€ (W₁ Wβ‚‚ : ℝ),
2*Ο„+2*Ξ΄*(Real.sqrt (n+2 : β„•)*((Q₁.descendant X).side/(2:ℝ)^(g₁-a))) ≀ W₁ β†’
2*Ο„+2*Ξ΄*(Real.sqrt (n+2 : β„•)*((Qβ‚‚.descendant Y).side/(2:ℝ)^(gβ‚‚-a))) ≀ Wβ‚‚ β†’
(βˆ€ q ∈ (Q₁.descendant X).occupiedPaths ρ₁ (p-a),
βˆ€ x ∈ ((Q₁.descendant X).descendant q).carrier,
βˆ€ z : Sphere (n+2), (x,z) ∈ GoodLeft β†’
DyadicParallelTest (Q₁.descendant X) ((Q₁.descendant X).occupiedPaths ρ₁ (p-a))
(g₁-a) q z W₁
⌈((2:ℝ)^N)^(PlanarFalconer.height
(fun j => m₁ ((j:ℝ)/N)-((n+2:β„•):ℝ)/2*j/N) g₁ p+
1000*(((n+2:β„•):ℝ)+1)*Οƒ)βŒ‰β‚Š) β†’
(βˆ€ q ∈ (Qβ‚‚.descendant Y).occupiedPaths ρ₂ (p-a),
βˆ€ x ∈ ((Qβ‚‚.descendant Y).descendant q).carrier,
βˆ€ z : Sphere (n+2), (x,z) ∈ GoodRight β†’
DyadicParallelTest (Qβ‚‚.descendant Y) ((Qβ‚‚.descendant Y).occupiedPaths ρ₂ (p-a))
(gβ‚‚-a) q z Wβ‚‚
⌈((2:ℝ)^N)^(PlanarFalconer.height
(fun j => mβ‚‚ ((j:ℝ)/N)-((n+2:β„•):ℝ)/2*j/N) gβ‚‚ p+
1000*(((n+2:β„•):ℝ)+1)*Οƒ)βŒ‰β‚Š) β†’
βˆ€ [IsFiniteMeasure (PlanarFalconer.sourceAngularShellMeasure v Ξ¨)],
let E := childAngularEnvelopeMaximum (Q₁.descendant X) (Qβ‚‚.descendant Y)
ρ₁ ρ₂ (p-a) (profileModelMass m₁ N p) (profileModelMass mβ‚‚ N p)
k Dsym p v Ξ¨ ChildLeft ChildRight
angularEnvelope (ρ₁.restrict (Q₁.descendant X).carrier)
(ρ₂.restrict (Qβ‚‚.descendant Y).carrier)
(profileModelMass m₁ N a) (profileModelMass mβ‚‚ N a)
k Dsym a v Ξ¨ GoodLeft GoodRight ≀
2*11^(n+2)*((2:ℝ)^N)^(
-((m₁ ((p:ℝ)/N)-((n+2:β„•):ℝ)/2*p/N)-
(m₁ ((a:ℝ)/N)-((n+2:β„•):ℝ)/2*a/N))-
((mβ‚‚ ((p:ℝ)/N)-((n+2:β„•):ℝ)/2*p/N)-
(mβ‚‚ ((a:ℝ)/N)-((n+2:β„•):ℝ)/2*a/N))+
(min (PlanarFalconer.height (fun j => m₁ ((j:ℝ)/N)-((n+2:β„•):ℝ)/2*j/N) a p)
(PlanarFalconer.height (fun j => mβ‚‚ ((j:ℝ)/N)-((n+2:β„•):ℝ)/2*j/N) a p)+
(1000*(((n+2:β„•):ℝ)+1)+32*(n+2:β„•))*Οƒ)+4*(((n+2:β„•):ℝ)+1)*lam)*E +
(2:ℝ)^(((n+2:β„•):ℝ)*(v-a)) *
((profileModelMass m₁ N p/profileModelMass m₁ N a)*
(profileModelMass mβ‚‚ N p/profileModelMass mβ‚‚ N a))^2 *
capGraphError (n+2) k A C W ((2:ℝ)^N) T
(profileModelMass m₁ N p) (profileModelMass mβ‚‚ N p) H 1 Dgraph v Ο„ K.card
((Q₁.descendant X).occupiedPaths ρ₁ (p-a) Γ—Λ’
(Qβ‚‚.descendant Y).occupiedPaths ρ₂ (p-a)).card := by
obtain ⟨A,C,hA,hC,hgraph⟩ := dyadic_profile_graph_energy_step hpublished n k hn Ο† Ξ¨
hφ hΨ hpos hzero hW hΨW hsupp hα T
refine ⟨A,C,hA,hC,?_⟩
intro Q₁ Qβ‚‚ hQ₁ hQβ‚‚ ρ₁ ρ₂ N s₁ sβ‚‚ lam m₁ mβ‚‚ hreg₁ hregβ‚‚ hN
a p g₁ gβ‚‚ Οƒ hap hp hΟƒ hag₁ hgp₁ hgap₁ hagβ‚‚ hgpβ‚‚ hgapβ‚‚ X Y hX hY
v Ο„ Ξ΄ H Dsym Dgraph hΟ„ hΞ΄ hΞ΄small hH hDsym hsymgraph hD hΞ΄D hnorm herr hfreq hL
ΞΉ K w Ξ· hcap hΞ· hpart GoodLeft GoodRight ChildLeft ChildRight
hleft hright W₁ Wβ‚‚ hw₁ hwβ‚‚ htest₁ htestβ‚‚ _
let := hreg₁.probability
let := hregβ‚‚.probability
let E := childAngularEnvelopeMaximum (Q₁.descendant X) (Qβ‚‚.descendant Y)
ρ₁ ρ₂ (p-a) (profileModelMass m₁ N p) (profileModelMass mβ‚‚ N p)
k Dsym p v Ξ¨ ChildLeft ChildRight
have hE : 0 ≀ E := finiteEnvelopeMaximum_nonneg _ _
have hmass (m : ℝ β†’ ℝ) (j : β„•) : 0 < profileModelMass m N j := by
unfold profileModelMass
positivity
have herror : 0 ≀ capGraphError (n+2) k A C W ((2:ℝ)^N) T
(profileModelMass m₁ N p) (profileModelMass mβ‚‚ N p) H 1 Dgraph v Ο„ K.card
((Q₁.descendant X).occupiedPaths ρ₁ (p-a) Γ—Λ’
(Qβ‚‚.descendant Y).occupiedPaths ρ₂ (p-a)).card := by
unfold capGraphError
positivity
apply angularEnvelope_le_of_admissible _ _ _ _ _ _ _ _ _ _ _ (by positivity)
intro b c hb hc
apply hgraph Q₁ Qβ‚‚ hQ₁ hQβ‚‚ ρ₁ ρ₂ N s₁ sβ‚‚ lam m₁ mβ‚‚ hreg₁ hregβ‚‚ hN
a p g₁ gβ‚‚ Οƒ hap hp hΟƒ hag₁ hgp₁ hgap₁ hagβ‚‚ hgpβ‚‚ hgapβ‚‚ X Y hX hY
v Ο„ Ξ΄ H 1 Dgraph hΟ„ hΞ΄ hΞ΄small hH (by norm_num) hD hΞ΄D hnorm herr hfreq hL
K w Ξ· hcap hΞ· hpart b c
(hb.mono hDsym hsymgraph subset_rfl).1
(hc.mono hDsym hsymgraph subset_rfl).1 W₁ Wβ‚‚ hw₁ hwβ‚‚
Β· intro q hq
filter_upwards [ae_restrict_mem ((Q₁.descendant X).descendant q).measurable] with x hx
intro z hz
exact htest₁ q hq x hx z (hb.2 x z hz)
Β· intro q hq
filter_upwards [ae_restrict_mem ((Qβ‚‚.descendant Y).descendant q).measurable] with x hx
intro z hz
exact htestβ‚‚ q hq x hx z (hc.2 x z hz)
Β· exact hE
Β· intro row hrow
have hr := Finset.mem_product.mp hrow
apply (child_energy_le_angularEnvelope ρ₁ ρ₂
((Q₁.descendant X).descendant row.1) ((Qβ‚‚.descendant Y).descendant row.2)
(hmass m₁ p) (hmass mβ‚‚ p) hDsym p v Ξ¨ GoodLeft GoodRight
(ChildLeft row.1) (ChildRight row.2)
(hleft row.1 hr.1) (hright row.2 hr.2) b c hb hc).trans
exact le_finiteEnvelopeMaximum _ (fun row =>
angularEnvelope (ρ₁.restrict ((Q₁.descendant X).descendant row.1).carrier)
(ρ₂.restrict ((Qβ‚‚.descendant Y).descendant row.2).carrier)
(profileModelMass m₁ N p) (profileModelMass mβ‚‚ N p) k Dsym p v Ξ¨
(ChildLeft row.1) (ChildRight row.2)) hrow
end Falconer
end OAI