ladder_graph_state_tripartite_info_lower_bound_colour
def
The 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 nibble (pair_code i mod 4), reduced mod 4 into Fin 4.
Statement
def ladder_graph_state_tripartite_info_lower_bound_colour (n : ℕ) (v : Fin n × Fin 2) : Fin 4- Source
- step towards ladder_graph_state_tripartite_info_lower_bound
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Built on 1
- ladder_graph_state_tripartite_info_lower_bound_pair_codeThe 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 =…
- Used by 1
- ladder_graph_state_tripartite_info_lower_bound_partThe part of colour c: the finset of all ladder vertices whose colour is c.
Lean source view module on GitHub
/-- Vertex colour of the ladder witness: channel `a` of rung `i` gets a nibble of the rung code. -/ def ladder_graph_state_tripartite_info_lower_bound_colour (n : ℕ) (v : Fin n × Fin 2) : Fin 4 := ⟨(if v.2 = (0 : Fin 2) then ladder_graph_state_tripartite_info_lower_bound_pair_code v.1 / 4 else ladder_graph_state_tripartite_info_lower_bound_pair_code v.1) % 4, Nat.mod_lt _ (by norm_num)⟩