cyclic_four_block_prev
def
Helper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the previous block index i-1, cyclically mod n=2m+5.
Statement
def cyclic_four_block_prev (m : ℕ) (i : Fin ((2*m+5))) : Fin ((2*m+5))- 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
- cyclic_four_block_witnessStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: witness.
- cyclic_four_block_WHelper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the chosen rich neighbour (a good adjacent edge) of each indexed…
- cyclic_four_block_NHelper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the four indexed edges adjacent to an indexed edge, listed by k :…
- cyclic_four_block_graph_exists_rich_neighbor_five_coloringFor every m>=0, cyclic_four_block_graph m, on 4(2m+5) vertices, admits a rich-neighbor five-edge-coloring.
Lean source view module on GitHub
def cyclic_four_block_prev (m : ℕ) (i : Fin ((2*m+5))) : Fin ((2*m+5)) := ⟨if i.val = 0 then (2*m+5)-1 else i.val-1, by split_ifs <;> omega⟩