AFTD Auto-Formalizing Theoretical Domains

cyclic_four_block_N

def

Helper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the four indexed edges adjacent to an indexed edge, listed by k : Fin 4.

Statement

def cyclic_four_block_N (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) (k : Fin 4) : (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
Built on 2
  • cyclic_four_block_nextHelper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the next block index i+1, cyclically mod n=2m+5.
  • cyclic_four_block_prevHelper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the previous block index i-1, cyclically mod n=2m+5.
Used by 1

Lean source view module on GitHub

def cyclic_four_block_N (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) (k : Fin 4) : (Fin (2*m+5) × Fin 6) :=
  let i := e.1
  ![![(i,(⟨1,by decide⟩ : Fin 6)),(i,(⟨2,by decide⟩ : Fin 6)),(cyclic_four_block_prev m i,(⟨3,by decide⟩ : Fin 6)),(i,(⟨3,by decide⟩ : Fin 6))],
    ![(i,(⟨0,by decide⟩ : Fin 6)),(i,(⟨2,by decide⟩ : Fin 6)),(cyclic_four_block_prev m i,if i.val=0 then (⟨5,by decide⟩ : Fin 6) else (⟨4,by decide⟩ : Fin 6)),(i,(⟨4,by decide⟩ : Fin 6))],
    ![(i,(⟨0,by decide⟩ : Fin 6)),(i,(⟨1,by decide⟩ : Fin 6)),(cyclic_four_block_prev m i,if i.val=0 then (⟨4,by decide⟩ : Fin 6) else (⟨5,by decide⟩ : Fin 6)),(i,(⟨5,by decide⟩ : Fin 6))],
    ![(i,(⟨0,by decide⟩ : Fin 6)),(cyclic_four_block_prev m i,(⟨3,by decide⟩ : Fin 6)),(cyclic_four_block_next m i,(⟨0,by decide⟩ : Fin 6)),(cyclic_four_block_next m i,(⟨3,by decide⟩ : Fin 6))],
    ![(i,(⟨1,by decide⟩ : Fin 6)),(cyclic_four_block_prev m i,if i.val=0 then (⟨5,by decide⟩ : Fin 6) else (⟨4,by decide⟩ : Fin 6)),
      (cyclic_four_block_next m i,if i.val+1=(2*m+5) then (⟨2,by decide⟩ : Fin 6) else (⟨1,by decide⟩ : Fin 6)),
      (cyclic_four_block_next m i,if i.val+1=(2*m+5) then (⟨5,by decide⟩ : Fin 6) else (⟨4,by decide⟩ : Fin 6))],
    ![(i,(⟨2,by decide⟩ : Fin 6)),(cyclic_four_block_prev m i,if i.val=0 then (⟨4,by decide⟩ : Fin 6) else (⟨5,by decide⟩ : Fin 6)),
      (cyclic_four_block_next m i,if i.val+1=(2*m+5) then (⟨1,by decide⟩ : Fin 6) else (⟨2,by decide⟩ : Fin 6)),
      (cyclic_four_block_next m i,if i.val+1=(2*m+5) then (⟨4,by decide⟩ : Fin 6) else (⟨5,by decide⟩ : Fin 6))]] e.2 k
See it in the graphDiscuss this resultChallenge it