AFTD Auto-Formalizing Theoretical Domains

cyclic_four_block_col_nat

def

Helper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the periodic five-colour assignment to indexed edges, as a natural number.

Statement

def cyclic_four_block_col_nat (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : ℕ
Source
decomposition of cyclic_four_block_graph_exists_rich_neighbor_five_coloring (proof plan of the IN-156 scratch file)
Verified
25 Oct 2026
Axioms
none listed
Used by 4

Lean source view module on GitHub

def cyclic_four_block_col_nat (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : ℕ :=
  if e.1.val+1 = (2*m+5) then ![2,1,0,1,3,4] e.2
  else if e.1.val % 2 = 0 then ![0,1,2,3,3,4] e.2
  else ![0,1,2,4,4,3] e.2
See it in the graphDiscuss this resultChallenge it