petrial_nullity_poly_empty_finset
theoremverified
The partial Petrial nullity polynomial of the graph induced on the empty finite vertex set is one.
Statement
theorem petrial_nullity_poly_empty_finset {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : petrial_nullity_poly (G.induce (((∅ : Finset V)) : Set V)) = 1
- Source
- Empty finite-set base case for the OP-1239 certificate.
- Verified
- 16 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- petrial_nullity_poly_empty_inducedThe partial Petrial nullity generating polynomial of the empty induced graph is one.
- 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_empty_finset {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : petrial_nullity_poly (G.induce (((∅ : Finset V)) : Set V)) = 1 := by classical let e : (G.induce (((∅ : Finset V)) : Set V)) ≃g G.induce (∅ : Set V) := { toEquiv := Equiv.subtypeEquivRight (fun x => by simp) map_rel_iff' := by rfl } exact (petrial_nullity_poly_iso _ _ e).trans (petrial_nullity_poly_empty_induced G)