double_star_vertex_count
theoremverified
The double star graph S_{a,b} on vertex type Bool ⊕ Fin a ⊕ Fin b has a + b + 2 vertices.
Statement
theorem double_star_vertex_count (a b : ℕ) :
Fintype.card (Bool ⊕ Fin a ⊕ Fin b) = a + b + 2- Source
- arXiv:2611.15124 Section 1, Domination in token graphs of graphs with domination number two
- Verified
- 15 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext
Read back from the Lean
For all natural numbers $a$ and $b$, the cardinality of the disjoint sum type $\text{Bool} \oplus \text{Fin } a \oplus \text{Fin } b$ is equal to $a + b + 2$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The double star S_{a,b} on Bool ⊕ Fin a ⊕ Fin b has a + b + 2 vertices. -/ theorem double_star_vertex_count (a b : ℕ) : Fintype.card (Bool ⊕ Fin a ⊕ Fin b) = a + b + 2 := by simp omega