c7_box_k3_distance
def
The 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 agree, else 1). This is the graph distance in the box product C_7 (box) C_3.
Statement
def c7_box_k3_distance (u v : ZMod 7 × Fin 3) : ℕ- Source
- step towards not_forall_power_well_covered_diam_le_three_and_twin_free_bounded
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Built on 1
- cyclic_distance_sevenThe cyclic distance on Z/7: cyclic_distance_seven a b = min of the two residues (b-a) and (a-b), i.e. the graph distance in the cycle C_7.
- Used by 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_graph_decidable_adjAdjacency in C_7 (box) C_3 is decidable, since it is a Boolean condition on c7_box_k3_distance.
Lean source view module on GitHub
/-- Product distance on `ZMod 7 × Fin 3`: cyclic distance on the first coordinate plus the `Fin 3` part. -/ def c7_box_k3_distance (u v : ZMod 7 × Fin 3) : ℕ := cyclic_distance_seven u.1 v.1 + if u.2 = v.2 then 0 else 1