five_vertex_t_star_adj_decidable
instance
Adjacency in the T-graph is decidable.
Statement
instance five_vertex_t_star_adj_decidable : DecidableRel five_vertex_t_star.Adj- Source
- step towards lly_positive_edge_connectivity_threshold_five
- Verified
- 17 Oct 2026
- Axioms
- none listed
- Built on 1
- five_vertex_t_starThe tree on 5 vertices with edges 0–1, 0–3, 0–4, 1–2: the path 3–0–1–2 with an extra leaf 4 attached at 0.
- Used by 6
- lly_positive_edge_connectivity_threshold_fivec(5) = 2: every connected graph on 5 vertices with edge-connectivity at least 2 has positive Lin–Lu–Yau curvature on every edge, while the…
- five_vertex_t_star_wasserstein_leFor the T-graph and α in [2/5, 1], the explicit plan π(0,0)=(1−α)/2, π(0,1)=(5α−2)/3, π(0,2)=(1−α)/6, π(1,2)=(1−α)/3, π(3,1)=(1−α)/3,…
- lly_five_vertex_t_star_curvatureFor the tree on 5 vertices with edges 0–1, 0–3, 0–4, 1–2 one has κ_LLY(0,1) = −1/3.
- five_vertex_t_star_dist_eqIn the T-graph: d(0,1) = 1, d(0,2) = 2, d(3,1) = 2, d(4,1) = 2, d(3,2) = d(4,2) = 3.
- five_vertex_t_star_wasserstein_geFor the T-graph and α in [0,1], 4/3 − α/3 ≤ W(μ_0^α, μ_1^α), because f(v) = d(v,2) is 1-Lipschitz and Σ f μ_0^α − Σ f μ_1^α = (2α +…
- five_vertex_t_star_connected_edge_connectivityThe T-graph (edges 0–1, 0–3, 0–4, 1–2) is connected and has edge-connectivity κ' = 1 (it is a tree).
Lean source view module on GitHub
/-- Makes `five_vertex_t_star.Adj` decidable, so `decide` can settle adjacency, degrees and connectivity for it. Necessary because the `DecidableRel` instance of a *named* graph does not synthesise by unfolding. -/ instance five_vertex_t_star_adj_decidable : DecidableRel five_vertex_t_star.Adj := by unfold five_vertex_t_star; infer_instance