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