File size: 6,895 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 | import OAI.Analysis.DiamondDistortion.StartBounds
namespace OAI
universe u v
noncomputable section
open scoped BigOperators Classical Topology
open Set
namespace DiamondDistortion
open scoped ENNReal
/-- Exact positive-rho qualitative result for the complete finite-forest dual. -/
theorem forest_normer_first {Ξ΅ : β} (hΞ΅ : 0 < Ξ΅) :
β Ο : β,0 < Ο β§ Ο < 1 β§ Diamond.UnitLensBound ForestDual Ξ΅ Ο :=
Diamond.QuadraticLens.positive_gap forest_quadratic_lens hΞ΅
theorem forest_qualitative_backward {D : β} (hD : 1 β€ D) :
β Ο : β,0 < Ο β§ Ο < 1 β§ β (k : β) (f : Diamond.Vertex k β ForestDual) (s : β),
Diamond.HasDistortion k f D s β Dβ»ΒΉ β€ Ο^k := by
have hD0 : 0 < D := by linarith
have hΞ± : 0 < Dβ»ΒΉ := inv_pos.2 hD0
obtain β¨Ο,hΟ,hΟ1,hgapβ© := forest_normer_first hΞ±
refine β¨Ο,hΟ,hΟ1,?_β©
intro k f s hf
have hn := Diamond.upper_one_normalization f hf
exact Diamond.backward hΞ± ((inv_le_oneβ hD0).mpr hD) hΟ.le hΟ1
(hgap.mono_separation (by linarith)) k (fun v => (D*s)β»ΒΉ β’ f v)
(fun u v => (hn u v).1) (fun u v => (hn u v).2)
/-- The separately stated exact radial constant C_* = sqrt 2 + sqrt 6.
The proof uses the stronger established bound on the identical norm. -/
theorem forest_radial_deficit {D s : β} (k : β) (f : Diamond.Vertex k β ForestDual)
(hf : Diamond.HasDistortion k f D s) :
(k:β) β€ (Real.sqrt 2+Real.sqrt 6)^2*D*(D-1) := by
have hh := headline.1 k f D s hf
have hD : 1 β€ D := hf.1
have hD0 : 0 β€ D := by linarith
have h2 := Real.sq_sqrt (by norm_num : (0:β) β€ 2)
have h6 := Real.sq_sqrt (by norm_num : (0:β) β€ 6)
have hp := mul_nonneg (Real.sqrt_nonneg 2) (Real.sqrt_nonneg 6)
have hC : 8 β€ (Real.sqrt 2+Real.sqrt 6)^2 := by nlinarith
have hb : (k:β) β€ 8*D*(D-1) := by nlinarith [sq_nonneg (D-1)]
have hm := mul_le_mul_of_nonneg_right hC (mul_nonneg hD0 (by linarith : 0 β€ D-1))
nlinarith
namespace Midpoint
variable {X ΞΉ : Type*} [NormedAddCommGroup X] [NormedSpace β X]
theorem Heads.vanishing_lens_pos (A : Heads ΞΉ X) (hinput : A.TailVanishing) {Ξ΅ : β}
(hΞ΅ : 0 < Ξ΅) : β Ο : β,0 < Ο β§ Ο < 1 β§ Diamond.UnitLensBound X Ξ΅ Ο := by
obtain β¨Ο,hΟ,hΟ1,hlensβ© := A.vanishing_lens hinput hΞ΅
refine β¨(1+Ο)/2,by linarith,by linarith,?_β©
exact fun x z hp hm hs => (hlens x z hp hm hs).trans (by linarith)
end Midpoint
namespace DirectLayers.Regular
variable {X Y I : Type*} [NormedAddCommGroup X] [NormedSpace β X]
[NormedAddCommGroup Y] [NormedSpace β Y] [Preorder I]
lemma transport {A : Midpoint.Heads I X} (hA : Regular A) (e : X ββα΅’[β] Y) :
Regular (A.transport e) where
nonempty := hA.nonempty
upper := hA.upper
nested_left H K hHK x := by
simp only [Midpoint.Heads.transport_projection,e.symm_apply_apply]
rw [hA.nested_left H K hHK]
nested_right H K hHK x := by
simp only [Midpoint.Heads.transport_projection,e.symm_apply_apply]
rw [hA.nested_right H K hHK]
contractive H x := by
rw [Midpoint.Heads.transport_projection,e.norm_map]
exact (hA.contractive H (e.symm x)).trans_eq (e.symm.norm_map x)
end DirectLayers.Regular
namespace PathModel
open RecursiveModel DirectLayers SignCube
instance linearFullDualSeparable : TopologicalSpace.SeparableSpace (StrongDual β FullLinearSpace) := by
let e := linearFullEquiv.toContinuousLinearEquiv.arrowCongr (ContinuousLinearEquiv.refl β β)
exact e.surjective.denseRange.separableSpace e.continuous
theorem linear_full_weak_graph (hinput : PathApplications.WeakInput FullLinearSpace)
{D s : β} (k : β) (f : Diamond.Vertex k β FullLinearSpace) (hf : Diamond.HasDistortion k f D s) :
1+(k:β)/64 β€ D^2 := PathApplications.weak_linear hinput k f hf
theorem linear_full_regular : Regular linearFullHeads := linear_regular.transport linearFullEquiv
theorem full_adaptive_graph (C : β) (hin : SignInput linearFullHeads.projection C)
{D s : β} (k : β) (f : Diamond.Vertex k β FullLinearSpace)
(hf : Diamond.HasDistortion k f D s) :
(k:β)/16 β€ C*(D^2+(k:β)*((2:β)^k)β»ΒΉ^2) β§
C*(D^2+(k:β)*((2:β)^k)β»ΒΉ^2) β€ C*(D^2+1) :=
DirectLayers.adaptive_graph linearFullHeads linear_full_regular hin k f hf
theorem full_predictable_495_graph (hin : PredictableInput linearFullHeads.projection 495)
{D s : β} (k : β) (f : Diamond.Vertex k β FullLinearSpace)
(hf : Diamond.HasDistortion k f D s) : (k:β)/4 β€ 495*(D+1)^2 :=
DirectLayers.predictable_graph linearFullHeads linear_full_regular hin k f hf
theorem full_variation_252_graph (hin : PredictableInput linearFullHeads.projection 252)
{D s : β} (k : β) (f : Diamond.Vertex k β FullLinearSpace)
(hf : Diamond.HasDistortion k f D s) : (k:β)/(16*D^2) β€ 1008 :=
DirectLayers.variation_graph linearFullHeads linear_full_regular hin k f hf
theorem full_leakage_1024_graph (hin : LeakageInput linearFullHeads.projection)
{D s : β} (k : β) (hk : 1 β€ k) (f : Diamond.Vertex k β FullLinearSpace)
(hf : Diamond.HasDistortion k f D s) :
(k:β)/8 β€ 1024*(D^2+(k:β)*(leakageTolerance k)^2) β§
1024*(D^2+(k:β)*(leakageTolerance k)^2) β€ 1024*(D^2+1) :=
DirectLayers.leakage_graph linearFullHeads linear_full_regular hin k hk f hf
theorem full_squared_gap_400_graph (hin : GapInput linearFullHeads.projection)
{D s Ξ³ : β} (k : β) (f : Diamond.Vertex k β FullLinearSpace)
(hf : Diamond.HasDistortion k f D s) (hΞ³ : 0 < Ξ³)
(hΞ³a : Ξ³ < (2/D)/8) (hΞ³k : Ξ³ < 1/((k:β)+1)) :
β T : Protocol FullLinearSpace ForestHead k,
T.Martingale β§ T.Nested β§ T.Anchored β§ T.CommonHeads β§ T.Supported linearFullHeads.projection β§
T.terminalEnergy β€ 4 β§ T.initialEnergy+(k:β)*((2/D)/8)^2/400 β€ T.terminalEnergy β§
(k:β)*((2/D)/8)^2/400 β€ T.initialEnergy+(k:β)*((2/D)/8)^2/400 :=
DirectLayers.gap_graph linearFullHeads linear_full_regular hin k f hf hΞ³ hΞ³a hΞ³k
end PathModel
namespace RecursiveModel
open RecursiveApplications
/-- The weak-null clause on the literal full β_p recursive-array model. -/
theorem full_cubic_weak (hinput : CubicInput fullVectorHeads) {Ξ΅ : β}
(hΞ΅ : 0 < Ξ΅) (hΞ΅1 : Ξ΅ β€ 1) (x : FullVectorSpace) (z : β β FullVectorSpace)
(hz : Midpoint.WeaklyNull z) (hl : β i,Ξ΅ β€ βz iβ)
(hp : β i,βx+z iβ β€ 1) (hm : β i,βx-z iβ β€ 1) : βxβ β€ theta Ξ΅ :=
cubic_weak_lens fullVectorHeads hinput hΞ΅ hΞ΅1 z hz hl hp hm
/-- The infinite separated-lens clause, before the graph specialization. -/
theorem full_sixth_lens (hinput : SixthInput fullVectorHeads) {Ξ΅ : β} (hΞ΅ : 0 < Ξ΅) (hΞ΅1 : Ξ΅ β€ 1) :
Diamond.UnitLensBound FullVectorSpace Ξ΅ (q6 Ξ΅) :=
sixth_lens fullVectorHeads hinput hΞ΅ hΞ΅1
end RecursiveModel
end DiamondDistortion
end
end OAI
|