A two-element finite type is exhausted by any two distinct elements
Provedfintype_card_two_elim__p2m_551112cf_8b4c_4517_8603_726684976d71_a3approximation-algorithmsplanar-graphstreewidth
If a finite type has cardinality two, then any two distinct elements exhaust that type.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem fintype_card_two_elim__p2m_551112cf_8b4c_4517_8603_726684976d71_a3
{α : Type} [Fintype α]
(hcard : Fintype.card α = 2)
(x y : α)
(hxy : x ≠ y) :
∀ z : α, z = x ∨ z = y := by sorrySource
David P. Williamson and David B. Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011, author electronic manuscript, Section 10.2, proof of Theorem 10.11, pp. 270-272. https://doi.org/10.1017/CBO9780511921735. Bounded tree-width of the pieces: Robertson–Seymour (planar graphs of radius r have tree-width at most 3r+1) / Bodlaender (k-outerplanar graphs have tree-width at most 3k-1).