c7_box_k3_graph_decidable_adj
instance
Adjacency in C_7 (box) C_3 is decidable, since it is a Boolean condition on c7_box_k3_distance.
Statement
instance c7_box_k3_graph_decidable_adj : DecidableRel c7_box_k3_graph.Adj- Source
- step towards not_forall_power_well_covered_diam_le_three_and_twin_free_bounded
- Verified
- 21 Oct 2026
- Axioms
- none listed
- Built on 2
- c7_box_k3_graphThe graph C_7 (box) C_3 = C_21(1,7) on Z/7 x {0,1,2}: u and v are adjacent iff they are distinct and c7_box_k3_distance u v = 1.
- c7_box_k3_distanceThe product distance on Z/7 x {0,1,2}: c7_box_k3_distance u v = (cyclic distance of the first coordinates) + (0 if the second coordinates…
Lean source view module on GitHub
/-- Decidability of adjacency in `c7_box_k3_graph`, needed for `decide` on finite facts. -/ instance c7_box_k3_graph_decidable_adj : DecidableRel c7_box_k3_graph.Adj := fun u v => inferInstanceAs (Decidable (u ≠ v ∧ c7_box_k3_distance u v = 1))