AFTD Auto-Formalizing Theoretical Domains

two_token_kmn_lefts

abbrev

The set of left vertices (in Fin m) occurring in a 2-element vertex {u,v} of F_2(K_{m,n}).

Statement

abbrev two_token_kmn_lefts {m n : ℕ} (v : {s : Finset (Fin m ⊕ Fin n) // s.card = 2}) : Finset (Fin m)
Source
step towards two_token_kmn_domination_number
Verified
25 Oct 2026
Axioms
none listed
Built on 1
  • two_token_kmnThe 2-token graph F_2(K_{m,n}) of the complete bipartite graph K_{m,n}.
Used by 7
  • two_token_kmn_alThe set of left vertices covered by the LL vertices of S (the 'A-part' of S).
  • two_token_kmn_llA vertex of F_2(K_{m,n}) is of type LL when both of its elements are left vertices.
  • two_token_kmn_clThe set of left vertices appearing in an LR vertex of S (the 'C-left' set, of size alpha).
  • two_token_kmn_rrA vertex of F_2(K_{m,n}) is of type RR when both of its elements are right vertices.
  • two_token_kmn_crThe set of right vertices appearing in an LR vertex of S (the 'C-right' set, of size beta).
  • two_token_kmn_lrA vertex of F_2(K_{m,n}) is of type LR when it contains exactly one left and one right vertex.
  • two_token_kmn_brThe set of right vertices covered by the RR vertices of S (the 'B-part' of S).

Lean source view module on GitHub

/-- Left part of a 2-token vertex of F_2(K_{m,n}). -/
abbrev two_token_kmn_lefts {m n : ℕ} (v : {s : Finset (Fin m ⊕ Fin n) // s.card = 2}) : Finset (Fin m) := v.val.biUnion (fun a => match a with | Sum.inl x => {x} | Sum.inr _ => ∅)
See it in the graphDiscuss this resultChallenge it