petrial_nullity_poly_card_one_finset
theoremverified
For every finite vertex set of cardinality one, the partial Petrial nullity polynomial of the induced graph is one plus X.
Statement
theorem petrial_nullity_poly_card_one_finset {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (s : Finset V) (hs : s.card = 1) : petrial_nullity_poly (G.induce (s : Set V)) = 1 + Polynomial.X
- Source
- Singleton finite-set base case for the OP-1239 certificate.
- Verified
- 16 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- petrial_nullity_poly_singleton_inducedThe partial Petrial nullity generating polynomial of the graph induced on one vertex is one plus X.
- petrial_nullity_poly_isoIsomorphic finite simple graphs have the same partial Petrial nullity generating polynomial.
- petrial_nullity_polyThe nullity generating polynomial of a finite graph G on V: the sum over all vertex subsets F of w raised to the nullity of the partial…
Lean source view module on GitHub
set_option maxRecDepth 10000 set_option maxHeartbeats 0 theorem petrial_nullity_poly_card_one_finset {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (s : Finset V) (hs : s.card = 1) : petrial_nullity_poly (G.induce (s : Set V)) = 1 + Polynomial.X := by classical obtain ⟨v, rfl⟩ := Finset.card_eq_one.mp hs let e : (G.induce ((({v} : Finset V)) : Set V)) ≃g G.induce ({v} : Set V) := { toEquiv := Equiv.subtypeEquivRight (fun x => by simp) map_rel_iff' := by rfl } exact (petrial_nullity_poly_iso _ _ e).trans (petrial_nullity_poly_singleton_induced G v)