cyclic_four_block_W
def
Helper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the chosen rich neighbour (a good adjacent edge) of each indexed edge.
Statement
def cyclic_four_block_W (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : (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 2
- cyclic_four_block_witnessStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: witness.
- 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_W (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : (Fin (2*m+5) × Fin 6) := let i := e.1 ![(i,(⟨1,by decide⟩ : Fin 6)),(i,(⟨2,by decide⟩ : Fin 6)),(i,(⟨1,by decide⟩ : Fin 6)), if i.val+1=(2*m+5) then (cyclic_four_block_prev m i,(⟨3,by decide⟩ : Fin 6)) else if i.val=0 then (cyclic_four_block_next m i,(⟨0,by decide⟩ : Fin 6)) else (i,(⟨0,by decide⟩ : Fin 6)), (i,(⟨1,by decide⟩ : Fin 6)),(i,(⟨2,by decide⟩ : Fin 6))] e.2