caterpillar_card_eq_of_third_principal_specialization_eq
theoremverified
If two finite caterpillars have equal third principal specializations, their vertex sets have equal cardinalities.
Statement
theorem caterpillar_card_eq_of_third_principal_specialization_eq {V₁ V₂ : Type*} [Fintype V₁] [DecidableEq V₁] [Fintype V₂] [DecidableEq V₂] (T₁ : SimpleGraph V₁) (T₂ : SimpleGraph V₂) [DecidableRel T₁.Adj] [DecidableRel T₂.Adj] (hT₁ : is_caterpillar T₁) (hT₂ : is_caterpillar T₂) (heq : third_principal_specialization T₁ = third_principal_specialization T₂) : Fintype.card V₁ = Fintype.card V₂
- Source
- step towards caterpillar_third_t_chromatic_specialization_fiber_le_two
- Verified
- 28 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- is_caterpillar_isTreeEvery caterpillar graph is a tree.
- third_principal_specialization_card_eqThe third principal specialization of any finite tree on at least one vertex uniquely determines its number of vertices.
- third_principal_specializationThe third principal specialization of the t-chromatic symmetric function of a graph G is the bivariate polynomial in Z[q, t] given by the…
- is_caterpillarA graph is a caterpillar if it is a tree containing a path such that every vertex is either on the path or adjacent to a vertex on the path.
Lean source view module on GitHub
/-- Two finite caterpillars with equal third principal specializations have equal vertex counts. -/ theorem caterpillar_card_eq_of_third_principal_specialization_eq {V₁ V₂ : Type*} [Fintype V₁] [DecidableEq V₁] [Fintype V₂] [DecidableEq V₂] (T₁ : SimpleGraph V₁) (T₂ : SimpleGraph V₂) [DecidableRel T₁.Adj] [DecidableRel T₂.Adj] (hT₁ : is_caterpillar T₁) (hT₂ : is_caterpillar T₂) (heq : third_principal_specialization T₁ = third_principal_specialization T₂) : Fintype.card V₁ = Fintype.card V₂ := by exact third_principal_specialization_card_eq T₁ T₂ (is_caterpillar_isTree T₁ hT₁) (is_caterpillar_isTree T₂ hT₂) heq