Download data/lean/ComparatorChallenges/PlanarL1.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.18 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/ComparatorChallenges/PlanarL1.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/ComparatorChallenges/PlanarL1.lean
-
curl -L -o PlanarL1.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/ComparatorChallenges/PlanarL1.lean
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 | |