math / data /lean /ComparatorChallenges /PlanarL1.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.18 kB
import Mathlib
namespace OAI
namespace PlanarL1
/-- A topological drawing by simple plane arcs, with injective vertex placement,
no vertex in an edge interior, and disjoint interiors for distinct unoriented edges. -/
def IsPlanar {V : Type} (G : SimpleGraph V) : Prop :=
βˆƒ (point : V β†’ ℝ Γ— ℝ) (arc : βˆ€ u v : V, G.Adj u v β†’ C(unitInterval, ℝ Γ— ℝ)),
Function.Injective point ∧
(βˆ€ u v h, (arc u v h) 0 = point u ∧ (arc u v h) 1 = point v) ∧
(βˆ€ u v h, Function.Injective (arc u v h)) ∧
(βˆ€ u v h (t : unitInterval) w, 0 < (t : ℝ) β†’ (t : ℝ) < 1 β†’
(arc u v h) t β‰  point w) ∧
(βˆ€ u v h x y k (s t : unitInterval),
0 < (s : ℝ) β†’ (s : ℝ) < 1 β†’ 0 < (t : ℝ) β†’ (t : ℝ) < 1 β†’
(arc u v h) s = (arc x y k) t β†’
(u = x ∧ v = y) ∨ (u = y ∧ v = x))
/-- The sum of edge lengths along a finite graph walk. -/
def walkLength {V : Type} {G : SimpleGraph V} (length : V β†’ V β†’ ℝ)
{u v : V} : G.Walk u v β†’ ℝ
| .nil => 0
| @SimpleGraph.Walk.cons _ _ u w _ _ p => length u w + walkLength length p
/-- The infimum of lengths of actual walks between the two vertices. -/
noncomputable def graphDistance {V : Type} (G : SimpleGraph V)
(length : V β†’ V β†’ ℝ) (u v : V) : ℝ :=
sInf (Set.range (fun p : G.Walk u v => walkLength length p))
/-- One universal distortion bound for finite connected planar graphs with
arbitrary symmetric positive edge lengths, realized in a real `LΒΉ` space. -/
def MainStatement : Prop :=
βˆƒ C : ℝ, 1 ≀ C ∧
βˆ€ (n : β„•) (G : SimpleGraph (Fin n)) (length : Fin n β†’ Fin n β†’ ℝ),
G.Connected β†’ IsPlanar G β†’
(βˆ€ u v, length u v = length v u) β†’
(βˆ€ u v, G.Adj u v β†’ 0 < length u v) β†’
βˆƒ (Ξ© : Type) (measurable : MeasurableSpace Ξ©)
(ΞΌ : @MeasureTheory.Measure Ξ© measurable)
(f : Fin n β†’ @MeasureTheory.Lp Ξ© ℝ measurable _ 1 ΞΌ),
βˆ€ x y, graphDistance G length x y ≀ β€–f x - f yβ€– ∧
β€–f x - f yβ€– ≀ C * graphDistance G length x y
theorem planar_graph_metrics_embed_L1 : MainStatement := by
sorry
end PlanarL1
end OAI