OAI/Analysis/TreePotential/CostObstruction.lean
24 declarations, 0 contain sorry, 0 declared as axioms
- lemma
OAI.BoundedTreePotentials.subspace_radial_adjustmentline 13 - lemma
OAI.BoundedTreePotentials.oneSided_growth_boundaryline 39Source documentation
Boundary radius is allowed: correcting a quotient approximant radially costs at most twice its approximation error.
lemma oneSided_growth_boundary {t γ c : ℝ} (ht : 0 < t) (hγ : 0 < γ) (hδ : (γ : EReal) < oneSidedModulus E t) (p : E) (hp : 0 < ‖p‖) (htp : t * ‖p‖ ≤ c) (d : ℕ → E) (hd : WeaklyNull d) (hdn : ∀ n, c ≤ ‖d n‖) : ∃ n, ‖p‖ + γ * ‖p‖ / 2 ≤ ‖p + d n‖ := by …Mentions: OAI.BoundedTreePotentials.oneSidedModulus, OAI.BoundedTreePotentials.WeaklyNull
- theorem
OAI.BoundedTreePotentials.bounded_tree_modulus_eq_zero_leline 56 - lemma
OAI.BoundedTreePotentials.prefix_child_iffline 113 - lemma
OAI.BoundedTreePotentials.rootPath_childline 118 - lemma
OAI.BoundedTreePotentials.single_sequence_weaklyNullline 137 - def
OAI.BoundedTreePotentials.raiseTreeline 148 - lemma
OAI.BoundedTreePotentials.raiseTree_childline 149 - def
OAI.BoundedTreePotentials.linearOuterInsertline 152 - def
OAI.BoundedTreePotentials.linearOuterTreeline 155 - lemma
OAI.BoundedTreePotentials.linearOuterTree_differenceline 158 - lemma
OAI.BoundedTreePotentials.linearOuterTree_weakline 164 - lemma
OAI.BoundedTreePotentials.linearOuterTree_normline 174 - lemma
OAI.BoundedTreePotentials.linearOuterTree_incrementline 180 - def
OAI.BoundedTreePotentials.quadraticOuterInsertline 187 - def
OAI.BoundedTreePotentials.quadraticOuterTreeline 190 - lemma
OAI.BoundedTreePotentials.quadraticOuterTree_differenceline 193 - lemma
OAI.BoundedTreePotentials.quadraticOuterTree_weakline 199 - lemma
OAI.BoundedTreePotentials.quadraticOuterTree_normline 209 - lemma
OAI.BoundedTreePotentials.quadraticOuterTree_incrementline 215 - theorem
OAI.BoundedTreePotentials.linearOuter_renorming_obstructionline 228Source documentation
The boundary radius alpha/beta is included.
theorem linearOuter_renorming_obstruction (e : LinearOuter ≃L[ℝ] Y) {α β t : ℝ} (hα : 0 < α) (hαβ : α ≤ β) (he : ∀ x, α * ‖x‖ ≤ ‖e x‖ ∧ ‖e x‖ ≤ β * ‖x‖) (ht : 0 < t) (htb : t ≤ α/β) : oneSidedModulus Y t = 0 := by …Mentions: OAI.BoundedTreePotentials.LinearOuter, OAI.BoundedTreePotentials.oneSidedModulus
- theorem
OAI.BoundedTreePotentials.quadraticOuter_renorming_obstructionline 244 - theorem
OAI.BoundedTreePotentials.linearOuter_no_equivalent_AUCline 274 - theorem
OAI.BoundedTreePotentials.quadraticOuter_no_equivalent_AUCline 282