math / data /lean /ComparatorChallenges /BoundedTreewidthL1.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.65 kB
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