AFTD Auto-Formalizing Theoretical Domains

cyclic_four_block_dst

def

Helper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the second endpoint (as a natural number) of the indexed edge (i,j).

Statement

def cyclic_four_block_dst (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
Built on 1
  • 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.
Used by 8

Lean source view module on GitHub

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