OAI/Combinatorics/BinaryEdit/Distortion.lean
28 declarations, 0 contain sorry, 0 declared as axioms
Distortion of finite metric spaces under injective maps into real ℓ₁.
- def
OAI.TreeEdit.BinaryLower.expansionRatiosline 17Source documentation
The two finite sets whose maxima define distortion.
def expansionRatios (ρ : X → X → ℝ) (f : X → RealL1) : Set ℝ := …
Mentions: OAI.TreeEdit.RealL1
- def
OAI.TreeEdit.BinaryLower.contractionRatiosline 20 - def
OAI.TreeEdit.BinaryLower.embeddingDistortionsline 23 - lemma
OAI.TreeEdit.BinaryLower.expansionRatios_finiteline 26 - lemma
OAI.TreeEdit.BinaryLower.contractionRatios_finiteline 32 - lemma
OAI.TreeEdit.BinaryLower.expansionRatios_nonemptyline 38 - lemma
OAI.TreeEdit.BinaryLower.contractionRatios_nonemptyline 43 - lemma
OAI.TreeEdit.BinaryLower.expansion_nonnegline 48 - lemma
OAI.TreeEdit.BinaryLower.contraction_nonnegline 55 - lemma
OAI.TreeEdit.BinaryLower.distortion_nonnegline 62 - lemma
OAI.TreeEdit.BinaryLower.exists_injective_L1line 67Source documentation
Every finite set admits an injection into the full sequence space.
lemma exists_injective_L1 (X : Type*) [Finite X] : ∃ f : X → RealL1, Function.Injective f := by …Mentions: OAI.TreeEdit.RealL1
- lemma
OAI.TreeEdit.BinaryLower.embeddingDistortions_nonemptyline 80 - lemma
OAI.TreeEdit.BinaryLower.embeddingDistortions_bddBelowline 85 - lemma
OAI.TreeEdit.BinaryLower.c1_nonnegline 92 - lemma
OAI.TreeEdit.BinaryLower.c1_le_distortionline 98 - lemma
OAI.TreeEdit.BinaryLower.le_c1line 103 - lemma
OAI.TreeEdit.BinaryLower.expansionRatios_comp_subsetline 110 - lemma
OAI.TreeEdit.BinaryLower.contractionRatios_comp_subsetline 117 - lemma
OAI.TreeEdit.BinaryLower.distortion_comp_leline 125Source documentation
Restriction to an isometric subspace cannot increase distortion.
lemma distortion_comp_le [Finite X] [Nontrivial X] [Finite Y] [Nontrivial Y] (ρ : X → X → ℝ) (σ : Y → Y → ℝ) (hσ : ∀ x y, 0 ≤ σ x y) (g : X → Y) (hg : Function.Injective g) (hiso : ∀ x y, σ (g x) (g y) = ρ x y) (f : Y → RealL1) : distortion ρ (f ∘ g) ≤ distortion σ f := by …Mentions: OAI.TreeEdit.RealL1
- lemma
OAI.TreeEdit.BinaryLower.c1_mono_isometryline 144Source documentation
The optimal ℓ₁ distortion is monotone under injective isometries.
lemma c1_mono_isometry [Finite X] [Nontrivial X] [Finite Y] [Nontrivial Y] (ρ : X → X → ℝ) (σ : Y → Y → ℝ) (hσ : ∀ x y, 0 ≤ σ x y) (g : X → Y) (hg : Function.Injective g) (hiso : ∀ x y, σ (g x) (g y) = ρ x y) : c1 X ρ ≤ c1 Y σ := by … - lemma
OAI.TreeEdit.BinaryLower.c1_eq_of_equivline 155 - lemma
OAI.TreeEdit.BinaryLower.c1_le_of_boundsline 169Source documentation
A noncontracting embedding with expansion at most
Dgives the usual upper bound on optimal distortion. No existence theorem is assumed here.lemma c1_le_of_bounds [Finite X] [Nontrivial X] (ρ : X → X → ℝ) (hρ : ∀ x y, 0 ≤ ρ x y) (hpos : ∀ x y, x ≠ y → 0 < ρ x y) (f : X → RealL1) (D : ℝ) (hD : 0 ≤ D) (hlower : ∀ x y, ρ x y ≤ ‖f x - f y‖) (hupper : ∀ x y, ‖f x - f y‖ ≤ D * ρ x y) : c1 X ρ ≤ D := by …Mentions: OAI.TreeEdit.RealL1
- lemma
OAI.TreeEdit.BinaryLower.distortion_comp_le_bilipline 199Source documentation
Comparing two metrics through a scaled bi-Lipschitz injection costs only its ratio of expansion to contraction in the distortion product.
lemma distortion_comp_le_bilip [Finite X] [Nontrivial X] [Finite Y] [Nontrivial Y] (ρ : X → X → ℝ) (σ : Y → Y → ℝ) (hρ : ∀ x y, 0 ≤ ρ x y) (hσ : ∀ x y, 0 ≤ σ x y) (hpos : ∀ x y, x ≠ y → 0 < ρ x y) (g : X → Y) (hg : Function.Injective g) (a b : ℝ) (ha : 0 < a) (hb : 0 ≤ b) (hlower : ∀ x y, a * ρ x y ≤ σ (g x) (g y)) (hupper : ∀ x y, σ (g x) (g y) ≤ b * ρ x y) (f : Y → RealL1) : distortion ρ (f ∘ g) ≤ (b / a) * distortion σ f := by …Mentions: OAI.TreeEdit.RealL1
- lemma
OAI.TreeEdit.BinaryLower.c1_le_bilip_mulline 255Source documentation
Optimal distortion transfer through any scaled bi-Lipschitz injection. In particular,
a=P/804andb=Pgive constant distortion loss.lemma c1_le_bilip_mul [Finite X] [Nontrivial X] [Finite Y] [Nontrivial Y] (ρ : X → X → ℝ) (σ : Y → Y → ℝ) (hρ : ∀ x y, 0 ≤ ρ x y) (hσ : ∀ x y, 0 ≤ σ x y) (hpos : ∀ x y, x ≠ y → 0 < ρ x y) (g : X → Y) (hg : Function.Injective g) (a b : ℝ) (ha : 0 < a) (hb : 0 < b) (hlower : ∀ x y, a * ρ x y ≤ σ (g x) (g y)) (hupper : ∀ x y, σ (g x) (g y) ≤ b * ρ x y) : c1 X ρ ≤ (b / a) * c1 Y σ := by … - lemma
OAI.TreeEdit.BinaryLower.exists_normalized_embeddingline 278Source documentation
Rescaling by the maximal contraction ratio makes an injective embedding noncontracting without changing the distortion bound.
lemma exists_normalized_embedding [Finite X] [Nontrivial X] (ρ : X → X → ℝ) (hρ : ∀ x y, 0 ≤ ρ x y) (hdiag : ∀ x, ρ x x = 0) (hpos : ∀ x y, x ≠ y → 0 < ρ x y) (f : X → RealL1) (hf : Function.Injective f) : ∃ g : X → RealL1, Function.Injective g ∧ ∀ x y, ρ x y ≤ ‖g x - g y‖ ∧ ‖g x - g y‖ ≤ distortion ρ f * ρ x y := by …Mentions: OAI.TreeEdit.RealL1
- lemma
OAI.TreeEdit.BinaryLower.le_c1_of_normalizedline 319Source documentation
An obstruction proved for all normalized embeddings gives a lower bound on the infimum defining
c1. This is the passage used by the two tree routes.lemma le_c1_of_normalized [Finite X] [Nontrivial X] (ρ : X → X → ℝ) (hρ : ∀ x y, 0 ≤ ρ x y) (hdiag : ∀ x, ρ x x = 0) (hpos : ∀ x y, x ≠ y → 0 < ρ x y) (D : ℝ) (hobstruction : ∀ (g : X → RealL1) (A : ℝ), (∀ x y, ρ x y ≤ ‖g x - g y‖ ∧ ‖g x - g y‖ ≤ A * ρ x y) → D ≤ A) : D ≤ c1 X ρ := by …Mentions: OAI.TreeEdit.RealL1
- lemma
OAI.TreeEdit.BinaryLower.exists_nonexpanding_embeddingline 333Source documentation
The dual normalization used verbatim by the finite-tree obstruction: the image distance lies between
ρ / distortionandρ.lemma exists_nonexpanding_embedding [Finite X] [Nontrivial X] (ρ : X → X → ℝ) (hρ : ∀ x y, 0 ≤ ρ x y) (hdiag : ∀ x, ρ x x = 0) (hpos : ∀ x y, x ≠ y → 0 < ρ x y) (f : X → RealL1) (hf : Function.Injective f) : 0 < distortion ρ f ∧ ∃ g : X → RealL1, Function.Injective g ∧ ∀ x y, ρ x y / distortion ρ f ≤ ‖g x - g y‖ ∧ ‖g x - g y‖ ≤ ρ x y := by …Mentions: OAI.TreeEdit.RealL1
- lemma
OAI.TreeEdit.BinaryLower.le_c1_of_nonexpandingline 365