math / data /lean /OAI /MeasureTheory /FalconerCompletion /Graphs /GraphFiniteHFBound2.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
15.2 kB
import Mathlib
import OAI.MeasureTheory.FalconerCompletion.Angular.AngularHFSmul2
import OAI.MeasureTheory.FalconerCompletion.Graphs.GraphFiniteCutoffEstimate2
import OAI.MeasureTheory.FalconerCompletion.Graphs.GraphFiniteHFBound
namespace OAI
/-! Graph energies and pair estimates. -/
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace GraphLiteralSupport
namespace Attempt4Near
open Set MeasureTheory
open scoped ComplexConjugate
variable {V Ξ± Ξ² ΞΊ : Type*} [MeasurableSpace V]
theorem graphFiniteHFND_bound (d : β„•) (a p v lam₁ lamβ‚‚ : ℝ)
(ΞΌ : Measure V) [IsFiniteMeasure ΞΌ]
(A : Finset Ξ±) (B : Finset Ξ²) (K : Finset ΞΊ)
(G : ΞΊ β†’ (Ξ± Γ— Ξ²) β†’ (Ξ± Γ— Ξ²) β†’ Prop) [βˆ€ k, DecidableRel (G k)]
(Ξ· : ΞΊ β†’ V Γ— V β†’ ℝ)
(hpart : βˆ€α΅ z βˆ‚ΞΌ.prod ΞΌ, (βˆ€ k ∈ K, 0 ≀ Ξ· k z) ∧ βˆ‘ k ∈ K, Ξ· k z=1)
(U : Ξ± β†’ ℝ Γ— V β†’ β„‚) (W : Ξ² β†’ ℝ Γ— V β†’ β„‚)
(hU : βˆ€ i ∈ A, Measurable (U i)) (hW : βˆ€ j ∈ B, Measurable (W j))
(C : Ξ± β†’ ℝ) (E : Ξ² β†’ ℝ)
(hbU : βˆ€ i ∈ A, βˆ€ r, βˆ€α΅ w βˆ‚ΞΌ, β€–U i (r,w)β€– ≀ C i)
(hbW : βˆ€ j ∈ B, βˆ€ r, βˆ€α΅ w βˆ‚ΞΌ, β€–W j (r,w)β€– ≀ E j) {D : ℝ} (hD : 0 ≀ D)
(hrow : βˆ€ k ∈ K, βˆ€ a ∈ A.product B, (((A.product B).filter (G k a)).card : ℝ) ≀ D)
(hcol : βˆ€ k ∈ K, βˆ€ b ∈ A.product B, (((A.product B).filter (fun a => G k a b)).card : ℝ) ≀ D)
{Ξ¨ : ℝ β†’ ℝ} (hΞ¨ : Integrable (fun r => Ξ¨ (r/(2:ℝ)^v))) (hΞ¨pos : βˆ€ r, 0 ≀ Ξ¨ r)
{ψ : V β†’ β„‚} (hmψ : Measurable ψ) (hψ : βˆ€α΅ w βˆ‚ΞΌ, β€–Οˆ wβ€– ≀ 1)
(hi : βˆ€ k ∈ K, βˆ€ a ∈ A.product B, βˆ€ b ∈ A.product B,
Integrable (fun p : ℝ Γ— (V Γ— V) => (Ξ¨ (p.1/(2:ℝ)^v):β„‚)*(Ξ· k p.2:β„‚)*
(((ψ p.2.1*U a.1 (p.1,p.2.1))*W a.2 (p.1,p.2.2))*
conj ((ψ p.2.2*U b.1 (p.1,p.2.2))*W b.2 (p.1,p.2.1)))) (volume.prod (μ.prod μ)))
{Ξ΅ : ℝ} (hΞ΅ : 0 ≀ Ξ΅)
(hne : βˆ€ k ∈ K, βˆ€ a ∈ A.product B, βˆ€ b ∈ A.product B, Β¬G k a b β†’
β€–βˆ« p : ℝ Γ— (V Γ— V), (Ξ¨ (p.1/(2:ℝ)^v):β„‚)*(Ξ· k p.2:β„‚)*
(((ψ p.2.1*U a.1 (p.1,p.2.1))*W a.2 (p.1,p.2.2))*
conj ((ψ p.2.2*U b.1 (p.1,p.2.2))*W b.2 (p.1,p.2.1))) βˆ‚volume.prod (ΞΌ.prod ΞΌ)β€– ≀ Ξ΅) :
sourceAngularHFND d ΞΌ a v Ξ¨ ψ (fun z => lam₁ β€’ βˆ‘ i ∈ A, U i z)
(fun z => lamβ‚‚ β€’ βˆ‘ j ∈ B, W j z) ≀
lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(p-a))*D*
(βˆ‘ i ∈ A, βˆ‘ j ∈ B, sourceAngularHND d ΞΌ p v Ξ¨ (U i) (W j)) +
lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(v-a))*((2:ℝ)^v)⁻¹*
((K.card:ℝ)*((A.card:ℝ)*B.card)^2*Ξ΅) := by
have h := graphFiniteCutoffEstimateND ΞΌ A B K G Ξ· hpart U W hU hW C E hbU hbW
hD hrow hcol hΞ¨ (fun r => hΞ¨pos (r/(2:ℝ)^v)) hmψ hψ hi hΞ΅ hne
have he : (2:ℝ)^((d:ℝ)*(p-a))*(βˆ‘ i ∈ A, βˆ‘ j ∈ B,
sourceAngularHND d ΞΌ p v Ξ¨ (U i) (W j)) =
βˆ‘ i ∈ A, βˆ‘ j ∈ B, sourceAngularHND d ΞΌ a v Ξ¨ (U i) (W j) := by
simp_rw [Finset.mul_sum,← sourceAngularHND_depth d ΞΌ a p v Ξ¨]
have hm := mul_le_mul_of_nonneg_left h
(show 0 ≀ lam₁^2*lamβ‚‚^2*((2:ℝ)^((d:ℝ)*(v-a))*((2:ℝ)^v)⁻¹) by positivity)
rw [sourceAngularHFND_smul]
have hr : lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(p-a))*D*
(βˆ‘ i ∈ A, βˆ‘ j ∈ B, sourceAngularHND d ΞΌ p v Ξ¨ (U i) (W j)) =
lam₁^2*lamβ‚‚^2*D*(βˆ‘ i ∈ A, βˆ‘ j ∈ B, sourceAngularHND d ΞΌ a v Ξ¨ (U i) (W j)) := by
rw [← he]
ring
rw [hr]
simp only [sourceAngularHND,sourceAngularHFND,← Finset.mul_sum] at *
nlinarith only [hm]
end Attempt4Near
end GraphLiteralSupport
end
end
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace GraphLiteralSupport
namespace Attempt4Near
open Set MeasureTheory
variable {V Ξ± Ξ² : Type*} [MeasurableSpace V]
noncomputable def graphChildMaxND (d : β„•) (ΞΌ : Measure V) (p v : ℝ)
(Ξ¨ : ℝ β†’ ℝ) (A : Finset Ξ±) (B : Finset Ξ²) (hAB : (A.product B).Nonempty)
(U : Ξ± β†’ ℝ Γ— V β†’ β„‚) (W : Ξ² β†’ ℝ Γ— V β†’ β„‚) : ℝ :=
(A.product B).sup' hAB (fun q => sourceAngularHND d ΞΌ p v Ξ¨ (U q.1) (W q.2))
lemma graphChildMaxND_nonneg (d : β„•) (ΞΌ : Measure V) (p v : ℝ)
(Ξ¨ : ℝ β†’ ℝ) (hΞ¨ : βˆ€ r, 0 ≀ Ξ¨ r)
(A : Finset Ξ±) (B : Finset Ξ²) (hAB : (A.product B).Nonempty)
(U : Ξ± β†’ ℝ Γ— V β†’ β„‚) (W : Ξ² β†’ ℝ Γ— V β†’ β„‚) :
0 ≀ graphChildMaxND d ΞΌ p v Ξ¨ A B hAB U W := by
obtain ⟨q,hq⟩ := hAB
exact (sourceAngularHND_nonneg d μ p v hΨ (U q.1) (W q.2)).trans
(Finset.le_sup' (fun q => sourceAngularHND d ΞΌ p v Ξ¨ (U q.1) (W q.2)) hq)
lemma graphChild_sum_le_maxND (d : β„•) (ΞΌ : Measure V) (p v : ℝ)
(Ξ¨ : ℝ β†’ ℝ) (A : Finset Ξ±) (B : Finset Ξ²) (hAB : (A.product B).Nonempty)
(U : Ξ± β†’ ℝ Γ— V β†’ β„‚) (W : Ξ² β†’ ℝ Γ— V β†’ β„‚) :
(βˆ‘ i ∈ A, βˆ‘ j ∈ B, sourceAngularHND d ΞΌ p v Ξ¨ (U i) (W j)) ≀
((A.card:ℝ)*B.card)*graphChildMaxND d ΞΌ p v Ξ¨ A B hAB U W := by
rw [← Finset.sum_product (f := fun q : Ξ± Γ— Ξ² => sourceAngularHND d ΞΌ p v Ξ¨ (U q.1) (W q.2))]
calc
_ ≀ βˆ‘ _q ∈ A.product B, graphChildMaxND d ΞΌ p v Ξ¨ A B hAB U W :=
Finset.sum_le_sum (fun q hq => Finset.le_sup'
(fun q => sourceAngularHND d ΞΌ p v Ξ¨ (U q.1) (W q.2)) hq)
_ = _ := by simp [Finset.card_product,mul_assoc]
end Attempt4Near
end GraphLiteralSupport
end
end
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace GraphLiteralSupport
namespace Attempt4Near
lemma graph_profile_prefactorND {N : β„•} (hN : 0 < N) (d a p : ℝ) :
(2:ℝ)^(d*(p-a)) = ((2:ℝ)^N)^(d*(p-a)/(N:ℝ)) := by
rw [← Real.rpow_natCast (2:ℝ) N,← Real.rpow_mul (by norm_num : (0:ℝ) ≀ 2)]
congr 1
have hn : (N:ℝ) β‰  0 := by positivity
field_simp
lemma graph_profile_cancellationND {N : β„•} (hN : 0 < N) (d a p Δ₁ Ξ”β‚‚ loss : ℝ) :
let R : ℝ := (2:ℝ)^N
let I₁ := Δ₁+(d/2)*(p-a)/(N:ℝ)
let Iβ‚‚ := Ξ”β‚‚+(d/2)*(p-a)/(N:ℝ)
(R^(-I₁))^2*(R^(-Iβ‚‚))^2*R^(I₁+Iβ‚‚+loss)*(2:ℝ)^(d*(p-a)) =
R^(-(Δ₁+Ξ”β‚‚)+loss) := by
dsimp only
have hR : 0 < (2:ℝ)^N := by positivity
rw [graph_profile_prefactorND hN]
simp only [← Real.rpow_mul_natCast hR.le,← Real.rpow_add hR]
congr 1
push_cast
ring
theorem graph_profile_coefficient_leND {N : β„•} (hN : 0 < N)
(d a p Δ₁ Ξ”β‚‚ loss degree : ℝ) {D L C : ℝ}
(hD : 0 ≀ D) (hDL : D ≀ C*((2:ℝ)^N)^degree)
(hL : L ≀ ((2:ℝ)^N)^(Δ₁+Ξ”β‚‚+d*(p-a)/(N:ℝ)+loss)) :
((((2:ℝ)^N)^(-(Δ₁+(d/2)*(p-a)/(N:ℝ))))^2*
(((2:ℝ)^N)^(-(Ξ”β‚‚+(d/2)*(p-a)/(N:ℝ))))^2)*
(2:ℝ)^(d*(p-a))*D*L ≀
C*((2:ℝ)^N)^(-(Δ₁+Ξ”β‚‚)+degree+loss) := by
let R : ℝ := (2:ℝ)^N
have hR : 0 < R := by positivity
let I₁ := Δ₁+(d/2)*(p-a)/(N:ℝ)
let Iβ‚‚ := Ξ”β‚‚+(d/2)*(p-a)/(N:ℝ)
have he : Δ₁+Ξ”β‚‚+d*(p-a)/(N:ℝ)=I₁+Iβ‚‚ := by dsimp [I₁,Iβ‚‚]; ring
have h := mul_le_mul_of_nonneg_left
(mul_le_mul_of_nonneg_left hL hD) (show 0 ≀ (R^(-I₁))^2*(R^(-Iβ‚‚))^2*(2:ℝ)^(d*(p-a)) by positivity)
have h' := mul_le_mul_of_nonneg_right hDL (show 0 ≀ R^(I₁+Iβ‚‚+loss) by positivity)
have h'' := mul_le_mul_of_nonneg_left h'
(show 0 ≀ (R^(-I₁))^2*(R^(-Iβ‚‚))^2*(2:ℝ)^(d*(p-a)) by positivity)
change (R^(-I₁))^2*(R^(-Iβ‚‚))^2*(2:ℝ)^(d*(p-a))*D*L ≀ _
change L ≀ R^(Δ₁+Ξ”β‚‚+d*(p-a)/(N:ℝ)+loss) at hL
rw [he] at hL
calc
_ ≀ (R^(-I₁))^2*(R^(-Iβ‚‚))^2*(2:ℝ)^(d*(p-a))*(D*R^(I₁+Iβ‚‚+loss)) := by
simpa only [mul_assoc,he] using h
_ ≀ (R^(-I₁))^2*(R^(-Iβ‚‚))^2*(2:ℝ)^(d*(p-a))*((C*R^degree)*R^(I₁+Iβ‚‚+loss)) := h''
_ = C*((R^(-I₁))^2*(R^(-Iβ‚‚))^2*R^(I₁+Iβ‚‚+loss)*(2:ℝ)^(d*(p-a)))*R^degree := by ring
_ = C*R^(-(Δ₁+Ξ”β‚‚)+loss)*R^degree := by rw [graph_profile_cancellationND hN]
_ = _ := by rw [mul_assoc,← Real.rpow_add hR]; congr 2; ring
end Attempt4Near
end GraphLiteralSupport
end
end
section
section
open Set MeasureTheory
open scoped ComplexConjugate RealInnerProductSpace
namespace GraphLiteralSupport
namespace Attempt4Near
open Set MeasureTheory
open scoped ComplexConjugate
variable {V Ξ± Ξ² ΞΊ : Type*} [MeasurableSpace V]
theorem graphFiniteHND_to_child_max (d : β„•) (a p v lam₁ lamβ‚‚ : ℝ) {N : β„•} (hN : 0<N)
(Δ₁ Ξ”β‚‚ degree loss Cβ‚€ : ℝ)
(hlam₁ : lam₁=((2:ℝ)^N)^(-(Δ₁+(d:ℝ)/2*(p-a)/(N:ℝ))))
(hlamβ‚‚ : lamβ‚‚=((2:ℝ)^N)^(-(Ξ”β‚‚+(d:ℝ)/2*(p-a)/(N:ℝ))))
(ΞΌ : Measure V) [IsFiniteMeasure ΞΌ]
(A : Finset Ξ±) (B : Finset Ξ²) (K : Finset ΞΊ) (hAB : (A.product B).Nonempty)
(hlabels : ((A.card:ℝ)*B.card) ≀ ((2:ℝ)^N)^(Δ₁+Ξ”β‚‚+(d:ℝ)*(p-a)/(N:ℝ)+loss))
(G : ΞΊ β†’ (Ξ± Γ— Ξ²) β†’ (Ξ± Γ— Ξ²) β†’ Prop) [βˆ€ k, DecidableRel (G k)]
(Ξ· : ΞΊ β†’ V Γ— V β†’ ℝ)
(hpart : βˆ€α΅ z βˆ‚ΞΌ.prod ΞΌ, (βˆ€ k ∈ K, 0 ≀ Ξ· k z) ∧ βˆ‘ k ∈ K, Ξ· k z=1)
(U : Ξ± β†’ ℝ Γ— V β†’ β„‚) (W : Ξ² β†’ ℝ Γ— V β†’ β„‚)
(hU : βˆ€ i ∈ A, Measurable (U i)) (hW : βˆ€ j ∈ B, Measurable (W j))
(C : Ξ± β†’ ℝ) (E : Ξ² β†’ ℝ)
(hbU : βˆ€ i ∈ A, βˆ€ r, βˆ€α΅ w βˆ‚ΞΌ, β€–U i (r,w)β€– ≀ C i)
(hbW : βˆ€ j ∈ B, βˆ€ r, βˆ€α΅ w βˆ‚ΞΌ, β€–W j (r,w)β€– ≀ E j) (D : ℝ) (hD : 0 ≀ D)
(hdegree : D ≀ Cβ‚€*((2:ℝ)^N)^degree)
(hrow : βˆ€ k ∈ K, βˆ€ a ∈ A.product B, (((A.product B).filter (G k a)).card : ℝ) ≀ D)
(hcol : βˆ€ k ∈ K, βˆ€ b ∈ A.product B, (((A.product B).filter (fun a => G k a b)).card : ℝ) ≀ D)
{Ξ¨ : ℝ β†’ ℝ} (hΞ¨ : Integrable (fun r => Ξ¨ (r/(2:ℝ)^v))) (hΞ¨pos : βˆ€ r, 0 ≀ Ξ¨ r)
(hi : βˆ€ k ∈ K, βˆ€ a ∈ A.product B, βˆ€ b ∈ A.product B,
Integrable (fun p : ℝ Γ— (V Γ— V) => (Ξ¨ (p.1/(2:ℝ)^v):β„‚)*(Ξ· k p.2:β„‚)*
((U a.1 (p.1,p.2.1)*W a.2 (p.1,p.2.2))*
conj (U b.1 (p.1,p.2.1)*W b.2 (p.1,p.2.2)))) (volume.prod (ΞΌ.prod ΞΌ)))
{Ξ΅ : ℝ} (hΞ΅ : 0 ≀ Ξ΅)
(hne : βˆ€ k ∈ K, βˆ€ a ∈ A.product B, βˆ€ b ∈ A.product B, Β¬G k a b β†’
β€–βˆ« p : ℝ Γ— (V Γ— V), (Ξ¨ (p.1/(2:ℝ)^v):β„‚)*(Ξ· k p.2:β„‚)*
((U a.1 (p.1,p.2.1)*W a.2 (p.1,p.2.2))*
conj (U b.1 (p.1,p.2.1)*W b.2 (p.1,p.2.2))) βˆ‚volume.prod (ΞΌ.prod ΞΌ)β€– ≀ Ξ΅) :
sourceAngularHND d ΞΌ a v Ξ¨ (fun z => lam₁ β€’ βˆ‘ i ∈ A, U i z)
(fun z => lamβ‚‚ β€’ βˆ‘ j ∈ B, W j z) ≀
Cβ‚€*((2:ℝ)^N)^(-(Δ₁+Ξ”β‚‚)+degree+loss)*
graphChildMaxND d ΞΌ p v Ξ¨ A B hAB U W +
lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(v-a))*((2:ℝ)^v)⁻¹*
((K.card:ℝ)*((A.card:ℝ)*B.card)^2*Ξ΅) := by
have h := graphFiniteHND_bound d a p v lam₁ lamβ‚‚ ΞΌ A B K G Ξ· hpart U W hU hW C E hbU hbW
D hrow hcol hΨ hΨpos hi hΡ hne
have hs := graphChild_sum_le_maxND d ΞΌ p v Ξ¨ A B hAB U W
have hmax := graphChildMaxND_nonneg d μ p v Ψ hΨpos A B hAB U W
have hc : lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(p-a))*D*((A.card:ℝ)*B.card) ≀
Cβ‚€*((2:ℝ)^N)^(-(Δ₁+Ξ”β‚‚)+degree+loss) := by
rw [hlam₁,hlamβ‚‚]
exact graph_profile_coefficient_leND hN d a p Δ₁ Ξ”β‚‚ loss degree hD hdegree hlabels
apply h.trans
apply add_le_add _ le_rfl
calc
_ ≀ (lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(p-a))*D)*
(((A.card:ℝ)*B.card)*graphChildMaxND d ΞΌ p v Ξ¨ A B hAB U W) :=
mul_le_mul_of_nonneg_left hs (by positivity)
_ = (lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(p-a))*D*((A.card:ℝ)*B.card))*
graphChildMaxND d ΞΌ p v Ξ¨ A B hAB U W := by ring
_ ≀ _ := mul_le_mul_of_nonneg_right hc hmax
theorem graphFiniteHFND_to_child_max (d : β„•) (a p v lam₁ lamβ‚‚ : ℝ) {N : β„•} (hN : 0<N)
(Δ₁ Ξ”β‚‚ degree loss Cβ‚€ : ℝ)
(hlam₁ : lam₁=((2:ℝ)^N)^(-(Δ₁+(d:ℝ)/2*(p-a)/(N:ℝ))))
(hlamβ‚‚ : lamβ‚‚=((2:ℝ)^N)^(-(Ξ”β‚‚+(d:ℝ)/2*(p-a)/(N:ℝ))))
(ΞΌ : Measure V) [IsFiniteMeasure ΞΌ]
(A : Finset Ξ±) (B : Finset Ξ²) (K : Finset ΞΊ) (hAB : (A.product B).Nonempty)
(hlabels : ((A.card:ℝ)*B.card) ≀ ((2:ℝ)^N)^(Δ₁+Ξ”β‚‚+(d:ℝ)*(p-a)/(N:ℝ)+loss))
(G : ΞΊ β†’ (Ξ± Γ— Ξ²) β†’ (Ξ± Γ— Ξ²) β†’ Prop) [βˆ€ k, DecidableRel (G k)]
(Ξ· : ΞΊ β†’ V Γ— V β†’ ℝ)
(hpart : βˆ€α΅ z βˆ‚ΞΌ.prod ΞΌ, (βˆ€ k ∈ K, 0 ≀ Ξ· k z) ∧ βˆ‘ k ∈ K, Ξ· k z=1)
(U : Ξ± β†’ ℝ Γ— V β†’ β„‚) (W : Ξ² β†’ ℝ Γ— V β†’ β„‚)
(hU : βˆ€ i ∈ A, Measurable (U i)) (hW : βˆ€ j ∈ B, Measurable (W j))
(C : Ξ± β†’ ℝ) (E : Ξ² β†’ ℝ)
(hbU : βˆ€ i ∈ A, βˆ€ r, βˆ€α΅ w βˆ‚ΞΌ, β€–U i (r,w)β€– ≀ C i)
(hbW : βˆ€ j ∈ B, βˆ€ r, βˆ€α΅ w βˆ‚ΞΌ, β€–W j (r,w)β€– ≀ E j) {D : ℝ} (hD : 0 ≀ D)
(hdegree : D ≀ Cβ‚€*((2:ℝ)^N)^degree)
(hrow : βˆ€ k ∈ K, βˆ€ a ∈ A.product B, (((A.product B).filter (G k a)).card : ℝ) ≀ D)
(hcol : βˆ€ k ∈ K, βˆ€ b ∈ A.product B, (((A.product B).filter (fun a => G k a b)).card : ℝ) ≀ D)
{Ξ¨ : ℝ β†’ ℝ} (hΞ¨ : Integrable (fun r => Ξ¨ (r/(2:ℝ)^v))) (hΞ¨pos : βˆ€ r, 0 ≀ Ξ¨ r)
{ψ : V β†’ β„‚} (hmψ : Measurable ψ) (hψ : βˆ€α΅ w βˆ‚ΞΌ, β€–Οˆ wβ€– ≀ 1)
(hi : βˆ€ k ∈ K, βˆ€ a ∈ A.product B, βˆ€ b ∈ A.product B,
Integrable (fun p : ℝ Γ— (V Γ— V) => (Ξ¨ (p.1/(2:ℝ)^v):β„‚)*(Ξ· k p.2:β„‚)*
(((ψ p.2.1*U a.1 (p.1,p.2.1))*W a.2 (p.1,p.2.2))*
conj ((ψ p.2.2*U b.1 (p.1,p.2.2))*W b.2 (p.1,p.2.1)))) (volume.prod (μ.prod μ)))
{Ξ΅ : ℝ} (hΞ΅ : 0 ≀ Ξ΅)
(hne : βˆ€ k ∈ K, βˆ€ a ∈ A.product B, βˆ€ b ∈ A.product B, Β¬G k a b β†’
β€–βˆ« p : ℝ Γ— (V Γ— V), (Ξ¨ (p.1/(2:ℝ)^v):β„‚)*(Ξ· k p.2:β„‚)*
(((ψ p.2.1*U a.1 (p.1,p.2.1))*W a.2 (p.1,p.2.2))*
conj ((ψ p.2.2*U b.1 (p.1,p.2.2))*W b.2 (p.1,p.2.1))) βˆ‚volume.prod (ΞΌ.prod ΞΌ)β€– ≀ Ξ΅) :
sourceAngularHFND d ΞΌ a v Ξ¨ ψ (fun z => lam₁ β€’ βˆ‘ i ∈ A, U i z)
(fun z => lamβ‚‚ β€’ βˆ‘ j ∈ B, W j z) ≀
Cβ‚€*((2:ℝ)^N)^(-(Δ₁+Ξ”β‚‚)+degree+loss)*
graphChildMaxND d ΞΌ p v Ξ¨ A B hAB U W +
lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(v-a))*((2:ℝ)^v)⁻¹*
((K.card:ℝ)*((A.card:ℝ)*B.card)^2*Ξ΅) := by
have h := graphFiniteHFND_bound d a p v lam₁ lamβ‚‚ ΞΌ A B K G Ξ· hpart U W hU hW C E hbU hbW
hD hrow hcol hΨ hΨpos hmψ hψ hi hΡ hne
have hs := graphChild_sum_le_maxND d ΞΌ p v Ξ¨ A B hAB U W
have hmax := graphChildMaxND_nonneg d μ p v Ψ hΨpos A B hAB U W
have hc : lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(p-a))*D*((A.card:ℝ)*B.card) ≀
Cβ‚€*((2:ℝ)^N)^(-(Δ₁+Ξ”β‚‚)+degree+loss) := by
rw [hlam₁,hlamβ‚‚]
exact graph_profile_coefficient_leND hN d a p Δ₁ Ξ”β‚‚ loss degree hD hdegree hlabels
apply h.trans
apply add_le_add _ le_rfl
calc
_ ≀ (lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(p-a))*D)*
(((A.card:ℝ)*B.card)*graphChildMaxND d ΞΌ p v Ξ¨ A B hAB U W) :=
mul_le_mul_of_nonneg_left hs (by positivity)
_ = (lam₁^2*lamβ‚‚^2*(2:ℝ)^((d:ℝ)*(p-a))*D*((A.card:ℝ)*B.card))*
graphChildMaxND d ΞΌ p v Ξ¨ A B hAB U W := by ring
_ ≀ _ := mul_le_mul_of_nonneg_right hc hmax
end Attempt4Near
end GraphLiteralSupport
end
end
end OAI