OAI/Analysis/DiamondDistortion/ForestModels.lean
19 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.DiamondDistortion.ForestNodeline 13Also declared: ComparatorChallenges/DiamondDistortion.lean:236 (same declaration text).
- def
OAI.DiamondDistortion.ForestAncestorline 15Also declared: ComparatorChallenges/DiamondDistortion.lean:238 (same declaration text).
- def
OAI.DiamondDistortion.forestAncestryline 18Also declared: ComparatorChallenges/DiamondDistortion.lean:241 (same declaration text).
- def
OAI.DiamondDistortion.forestSegmentsline 31Also declared: ComparatorChallenges/DiamondDistortion.lean:254 (same declaration text).
- def
OAI.DiamondDistortion.infiniteAncestryline 35Source documentation
Prefix order on all finite words, explicitly distinct from their lexicographic order.
Also declared: ComparatorChallenges/DiamondDistortion.lean:258 (same declaration text).
@[instance_reducible] def infiniteAncestry : Ancestry (List ℕ) where …
Mentions: OAI.DiamondDistortion.Ancestry
- def
OAI.DiamondDistortion.infiniteSegmentsline 44Source documentation
The infinite-height tree of all finite words; this includes the empty root.
Also declared: ComparatorChallenges/DiamondDistortion.lean:267 (same declaration text).
def infiniteSegments : SegmentSystem (List ℕ) := …
Mentions: OAI.DiamondDistortion.SegmentSystem
- lemma
OAI.DiamondDistortion.infinite_finite_headsline 47 - lemma
OAI.DiamondDistortion.forest_finite_headsline 55 - def
OAI.DiamondDistortion.Forest.componentline 68 - lemma
OAI.DiamondDistortion.Forest.same_componentline 70 - lemma
OAI.DiamondDistortion.Forest.segment_card_leline 76 - lemma
OAI.DiamondDistortion.Forest.primal_sq_bounded_componentsline 97 - def
OAI.DiamondDistortion.Forest.coefficientsline 113 - lemma
OAI.DiamondDistortion.Forest.coefficients_boundedline 116 - lemma
OAI.DiamondDistortion.Forest.finite_component_tailline 152 - lemma
OAI.DiamondDistortion.Forest.component_set_ancestralline 183 - lemma
OAI.DiamondDistortion.Forest.full_dual_approximationline 195Source documentation
The full finite-height forest dual really has finite ancestral head approximation. Both the component tail and coordinate tail arguments are proved from its disjoint-segment norm, rather than imposed as hypotheses.
lemma full_dual_approximation (x : forestSegments.Dual) {ε : ℝ} (hε : 0 < ε) : ∃ H : Finset ForestNode, Ancestry.Ancestral (A := forestAncestry) (H : Set ForestNode) ∧ …Mentions: OAI.DiamondDistortion.ForestNode, OAI.DiamondDistortion.Ancestry.Ancestral, OAI.DiamondDistortion.forestAncestry
- abbrev
OAI.DiamondDistortion.ForestDualline 271Also declared: ComparatorChallenges/DiamondDistortion.lean:270 (same declaration text).
- abbrev
OAI.DiamondDistortion.InfinitePredualline 272Also declared: ComparatorChallenges/DiamondDistortion.lean:271 (same declaration text).