File size: 1,651 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 | import Mathlib
namespace OAI
noncomputable section
namespace BoundedTreewidthL1
universe u_1
variable {V : Type u_1} (G : SimpleGraph V)
/-- Sum of the given positive real edge lengths along a graph walk. -/
def walkLength (β : G.edgeSet β β) : {u v : V} β G.Walk u v β β
| _, _, .nil => 0
| u, _, .cons (v := v) h p => β β¨s(u, v), hβ© + walkLength β p
noncomputable def shortestPathDistance (β : G.edgeSet β β) (u v : V) : β :=
sInf {r : β | β p : G.Walk u v, p.IsPath β§ walkLength G β p = r}
def HasTreeDecomposition [DecidableEq V] (k : β) : Prop :=
β n : β, β T : SimpleGraph (Fin n), β bag : Fin n β Finset V,
T.IsTree β§
(β v : V, β t, v β bag t) β§
(β u v : V, G.Adj u v β β t, u β bag t β§ v β bag t) β§
(β v : V, (T.induce {t | v β bag t}).Connected) β§
(β t, (bag t).card β€ k)
/-- A map to genuine finite-dimensional real ββ, not just a cut pseudometric. -/
def HasL1Embedding (β : G.edgeSet β β) (C : β) : Prop :=
β m : β, β F : V β PiLp (1 : ENNReal) (fun _ : Fin m => β),
β u v : V,
shortestPathDistance G β u v β€ βF u - F vβ β§
βF u - F vβ β€ C * shortestPathDistance G β u v
def MainStatement : Prop :=
β k : β, 2 β€ k β β C : β, 1 β€ C β§
β (V : Type) [Fintype V] [DecidableEq V] [Nonempty V]
(G : SimpleGraph V),
G.Connected β HasTreeDecomposition G k β
β β : G.edgeSet β β, (β e, 0 < β e) β HasL1Embedding G β C
theorem main_theorem : MainStatement := by
sorry
end BoundedTreewidthL1
end
end OAI
|