ladder_graph_state_tripartite_info_lower_bound_pair_code
def
The rung code of rung i of the 2-by-n ladder: 1 for rung 0, then the period-9 word 6,14,2,8,12,4,1,13,9 (each code is a hex pair: code/4 = colour of the top vertex, code%4 = colour of the bottom vertex).
Statement
def ladder_graph_state_tripartite_info_lower_bound_pair_code (i : ℕ) : ℕ- Source
- step towards ladder_graph_state_tripartite_info_lower_bound
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Used by 1
- ladder_graph_state_tripartite_info_lower_bound_colourThe four-colouring of the ladder's vertices: vertex (i,0) gets the high nibble of rung code i (i.e. pair_code i / 4), vertex (i,1) the low…
Lean source view module on GitHub
/-- Rung code: 1 for rung 0, else the length-9 motif 6,14,2,8,12,4,1,13,9. -/ def ladder_graph_state_tripartite_info_lower_bound_pair_code (i : ℕ) : ℕ := if i = 0 then 1 else [6, 14, 2, 8, 12, 4, 1, 13, 9].getD ((i - 1) % 9) 0