OAI/Analysis/DiamondDistortion/DiamondGraph.lean
39 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.DiamondDistortion.Diamond.Edgeline 16Source documentation
Stage edges, retaining their parent, child number, and side.
Also declared: ComparatorChallenges/DiamondDistortion.lean:276 (same declaration text).
@[reducible] def Edge : ℕ → Type | 0 => Unit | n + 1 => Edge n × ℕ × Bool /-- At every replacement every parent edge receives countably many distinct new vertices. -/
- def
OAI.DiamondDistortion.Diamond.Vertexline 21Source documentation
At every replacement every parent edge receives countably many distinct new vertices.
Also declared: ComparatorChallenges/DiamondDistortion.lean:281 (same declaration text).
@[reducible] def Vertex : ℕ → Type | 0 => Bool | n + 1 => Vertex n ⊕ (Edge n × ℕ)
Mentions: OAI.DiamondDistortion.Diamond.Edge
- def
OAI.DiamondDistortion.Diamond.endpointline 25Also declared: ComparatorChallenges/DiamondDistortion.lean:285 (same declaration text).
- def
OAI.DiamondDistortion.Diamond.graphline 33Source documentation
The undirected replacement graph.
Also declared: ComparatorChallenges/DiamondDistortion.lean:293 (same declaration text).
def graph (n : ℕ) : SimpleGraph (Vertex n) := …
Mentions: OAI.DiamondDistortion.Diamond.Vertex
- def
OAI.DiamondDistortion.Diamond.baseEdgeline 36 - lemma
OAI.DiamondDistortion.Diamond.endpoint_neline 40 - lemma
OAI.DiamondDistortion.Diamond.adj_iffline 47 - lemma
OAI.DiamondDistortion.Diamond.adj_endpointline 59 - lemma
OAI.DiamondDistortion.Diamond.adj_old_midline 63 - lemma
OAI.DiamondDistortion.Diamond.not_adj_oldline 80 - lemma
OAI.DiamondDistortion.Diamond.not_adj_newline 86 - lemma
OAI.DiamondDistortion.Diamond.replace_adjline 92 - lemma
OAI.DiamondDistortion.Diamond.replace_walkline 100 - lemma
OAI.DiamondDistortion.Diamond.connectedline 111 - lemma
OAI.DiamondDistortion.Diamond.potential_walkline 137 - lemma
OAI.DiamondDistortion.Diamond.distance_potentialline 148 - def
OAI.DiamondDistortion.Diamond.extendPotentialline 160 - lemma
OAI.DiamondDistortion.Diamond.extendPotential_adjline 164 - lemma
OAI.DiamondDistortion.Diamond.dist_oldline 178Source documentation
One subdivision doubles unweighted old-vertex distances.
lemma dist_old (n : ℕ) (u v : Vertex n) : (graph (n+1)).dist (Sum.inl u) (Sum.inl v)=2*(graph n).dist u v := by …Mentions: OAI.DiamondDistortion.Diamond.Vertex, OAI.DiamondDistortion.Diamond.graph
- lemma
OAI.DiamondDistortion.Diamond.dist_siblingsline 192 - theorem
OAI.DiamondDistortion.Diamond.two_atLeastTwoline 203 - def
OAI.DiamondDistortion.Diamond.distanceline 206Source documentation
Final edges have length 2⁻ᵏ: this is the shortest-path metric of the normalized graph.
Also declared: ComparatorChallenges/DiamondDistortion.lean:297 (same declaration text).
def distance (k : ℕ) (u v : Vertex k) : ℝ := …
Mentions: OAI.DiamondDistortion.Diamond.Vertex
- def
OAI.DiamondDistortion.Diamond.HasDistortionline 210Source documentation
The standing all-pairs distortion hypothesis, with its positive arbitrary scale.
def HasDistortion {X : Type*} [NormedAddCommGroup X] (k : ℕ) (f : Vertex k → X) (D s : ℝ) : Prop := …Mentions: OAI.DiamondDistortion.Diamond.Vertex
- lemma
OAI.DiamondDistortion.Diamond.distance_oldline 216 - lemma
OAI.DiamondDistortion.Diamond.distance_edgeline 221 - lemma
OAI.DiamondDistortion.Diamond.distance_siblingsline 225 - def
OAI.DiamondDistortion.Diamond.slopeline 232Source documentation
The oriented slope of a stage edge in the normalized metric.
def slope {n : ℕ} (f : Vertex n → X) (e : Edge n) : X := …Mentions: OAI.DiamondDistortion.Diamond.Vertex, OAI.DiamondDistortion.Diamond.Edge
- def
OAI.DiamondDistortion.Diamond.deviationline 236Source documentation
Midpoint deviations normalized by the lengths of the parent edges.
def deviation {n : ℕ} (f : Vertex (n+1) → X) (e : Edge n) (i : ℕ) : X := …Mentions: OAI.DiamondDistortion.Diamond.Vertex, OAI.DiamondDistortion.Diamond.Edge
- lemma
OAI.DiamondDistortion.Diamond.slope_plus_deviationline 240 - lemma
OAI.DiamondDistortion.Diamond.slope_minus_deviationline 246 - lemma
OAI.DiamondDistortion.Diamond.deviation_subline 252 - lemma
OAI.DiamondDistortion.Diamond.deviation_separatedline 259 - def
OAI.DiamondDistortion.Diamond.QuadraticLensline 270Source documentation
An infinite separated symmetric lens with the exact quadratic constant.
def QuadraticLens (X : Type*) [NormedAddCommGroup X] : Prop := …
- lemma
OAI.DiamondDistortion.Diamond.squared_stretch_lossline 277Source documentation
Supremum-free squared stretch-loss induction. The bound on all final-edge slopes loses s²/4 at each backward step. No maximum child is used.
lemma squared_stretch_loss (hX : QuadraticLens X) (k : ℕ) (f : Vertex k → X) {s B : ℝ} (hs : 0 < s) (hl : ∀ u v,s*distance k u v ≤ ‖f u-f v‖) (hb : ∀ e,‖slope f e‖^2 ≤ B) : s^2*(1+(k:ℝ)/4) ≤ B := by …Mentions: OAI.DiamondDistortion.Diamond.QuadraticLens, OAI.DiamondDistortion.Diamond.Vertex, OAI.DiamondDistortion.Diamond.distance, OAI.DiamondDistortion.Diamond.slope
- lemma
OAI.DiamondDistortion.Diamond.distortion_boundline 313 - def
OAI.DiamondDistortion.Headlineline 334Source documentation
The exact two-model unconditional headline; neither intrinsic estimate is a hypothesis.
def Headline : Prop := …
- theorem
OAI.DiamondDistortion.forest_quadratic_lensline 342Source documentation
The finite forest lens property follows from the proved pooled estimate and the proved approximation of its full dual.
theorem forest_quadratic_lens : Diamond.QuadraticLens ForestDual := by …
Mentions: OAI.DiamondDistortion.Diamond.QuadraticLens, OAI.DiamondDistortion.ForestDual
- theorem
OAI.DiamondDistortion.infinite_quadratic_lensline 349Source documentation
The infinite-height assertion is only for its closed coordinate span, not for the full infinite-height dual.
theorem infinite_quadratic_lens : Diamond.QuadraticLens InfinitePredual := by …
Mentions: OAI.DiamondDistortion.Diamond.QuadraticLens, OAI.DiamondDistortion.InfinitePredual
- theorem
OAI.DiamondDistortion.headlineline 355