ladder_graph_state_tripartite_info_lower_bound_part
def
The part of colour c: the finset of all ladder vertices whose colour is c.
Statement
noncomputable def ladder_graph_state_tripartite_info_lower_bound_part (n : ℕ) (c : Fin 4) : Finset (Fin n × Fin 2)
- 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_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
/-- The part of colour `c`: the fibre of the vertex colouring. -/ noncomputable def ladder_graph_state_tripartite_info_lower_bound_part (n : ℕ) (c : Fin 4) : Finset (Fin n × Fin 2) := Finset.univ.filter (fun v => ladder_graph_state_tripartite_info_lower_bound_colour n v = c)