cyclic_four_block_edge
def
Helper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the indexed edge (i,j) of cyclic_four_block_graph m as an unordered pair of vertices.
Statement
def cyclic_four_block_edge (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : Sym2 (Fin (4*(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
- Built on 3
- cyclic_four_block_srcHelper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the first endpoint (as a natural number) of the indexed edge (i,j)…
- cyclic_four_block_dstHelper for cyclic_four_block_graph_exists_rich_neighbor_five_coloring: the second endpoint (as a natural number) of the indexed edge (i,j).
- cyclic_four_block_boundsStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: bounds.
- Used by 5
- cyclic_four_block_witnessStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: witness.
- cyclic_four_block_touch_iffStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: touch iff.
- cyclic_four_block_nondiagStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: nondiag.
- cyclic_four_block_properStep of cyclic_four_block_graph_exists_rich_neighbor_five_coloring: proper.
- 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_edge (m : ℕ) (e : (Fin (2*m+5) × Fin 6)) : Sym2 (Fin (4*(2*m+5))) :=
s(⟨cyclic_four_block_src m e,(cyclic_four_block_bounds m e).1⟩,⟨cyclic_four_block_dst m e,(cyclic_four_block_bounds m e).2⟩)