OAI/Analysis/DiamondDistortion/PathBounds.lean
12 declarations, 0 contain sorry, 0 declared as axioms
- lemma
OAI.DiamondDistortion.Midpoint.tail_packingline 18Source documentation
Packing with one finite-rank head and a common tail bound; no head norm estimate and no attained infinite minimum is used.
lemma tail_packing (P : X →L[ℝ] X) [FiniteDimensional ℝ (LinearMap.range P.toLinearMap)] (z : ℕ → X) {R ε T : ℝ} (hz : ∀ i,‖z i‖ ≤ R) (hs : ∀ i j,i ≠ j → ε ≤ ‖z i-z j‖) (ht : ∀ i,‖z i-P (z i)‖ ≤ T) : ε/2 ≤ T := by … - def
OAI.DiamondDistortion.PathApplications.RelativeInputline 50Source documentation
Threshold-removal uses a single head for all deviations at this radius.
def RelativeInput (A : Heads ι X) : Prop := …
- def
OAI.DiamondDistortion.PathApplications.relativeDeltaline 55 - lemma
OAI.DiamondDistortion.PathApplications.relative_parametersline 57 - lemma
OAI.DiamondDistortion.PathApplications.relative_lens_impossibleline 71 - lemma
OAI.DiamondDistortion.PathApplications.relative_actual_childline 87Source documentation
An actual original child exceeds the relative factor, rather than merely a quotient representative or a supremum satisfying a non-strict bound.
lemma relative_actual_child (A : Heads ι X) (hinput : RelativeInput A) {D : ℝ} (hD : 1 ≤ D) {x : X} (z : ℕ → X) (hx : 1 ≤ ‖x‖) (hxD : ‖x‖ ≤ D) (hs : ∀ i j,i ≠ j → 2 ≤ ‖z i-z j‖) : ∃ i,(1+relativeDelta D)*‖x‖ < max ‖x+z i‖ ‖x-z i‖ := by …Mentions: OAI.DiamondDistortion.PathApplications.RelativeInput, OAI.DiamondDistortion.PathApplications.relativeDelta
- theorem
OAI.DiamondDistortion.PathApplications.relative_costline 95 - lemma
OAI.DiamondDistortion.Midpoint.bounded_scalar_subsequenceline 126 - lemma
OAI.DiamondDistortion.Midpoint.bounded_weak_pairline 142 - def
OAI.DiamondDistortion.PathApplications.WeakInputline 158 - lemma
OAI.DiamondDistortion.PathApplications.weak_lensline 163 - theorem
OAI.DiamondDistortion.PathApplications.weak_linearline 190