three_token_k2n_left_count
def
The number of left-part vertices in a three-token configuration.
Statement
noncomputable def three_token_k2n_left_count {n : ℕ} (z : {s : Finset (Fin 2 ⊕ Fin n) // s.card = 3}) : ℕ
- Source
- Explicit construction for three_token_k2n_has_dominating_set and OP-666.
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Used by 3
- three_token_k2n_assemble_layer_coverIf the explicit candidate family has the claimed cardinality and dominates every configuration in each of the three possible left-token…
- three_token_k2n_assemble_three_layersIf the explicit candidate family has the claimed cardinality and dominates each of the layers with zero, one and two left-part tokens, the…
- three_token_k2n_left_count_le_twoEvery three-token configuration over Fin 2 plus Fin n contains at most two vertices from the left part.
Lean source view module on GitHub
noncomputable def three_token_k2n_left_count {n : ℕ} (z : {s : Finset (Fin 2 ⊕ Fin n) // s.card = 3}) : ℕ := by classical exact (z.val.filter (fun v => ∃ i : Fin 2, v = Sum.inl i)).card