AFTD Auto-Formalizing Theoretical Domains

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

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
See it in the graphDiscuss this resultChallenge it