AFTD Auto-Formalizing Theoretical Domains

conn_set_poly_Q

def

The defect polynomial Q_G = ((1+X)^n - 1) * Z_G' - n * (1+X)^(n-1) * Z_G, which measures the deviation of the weighted mean order of G from that of K_n.

Statement

open scoped BigOperators Polynomial Classical in
noncomputable def conn_set_poly_Q {V : Type*} [Fintype V] (G : SimpleGraph V) : Polynomial ℝ
Source
step towards op_599_connected_induced_activity_clique_minimum
Verified
28 Oct 2026
Axioms
none listed
Built on 1
  • conn_set_polyThe connected-set generating polynomial Z_G = sum over nonempty vertex sets S inducing a connected subgraph of X^{|S|}.

Lean source view module on GitHub

open scoped BigOperators Polynomial Classical in
/-- Q_G = ((1+X)^n − 1)·Z_G′ − n·(1+X)^(n−1)·Z_G. -/
noncomputable def conn_set_poly_Q {V : Type*} [Fintype V] (G : SimpleGraph V) : Polynomial ℝ := ((1 + Polynomial.X) ^ Fintype.card V - 1) * Polynomial.derivative (conn_set_poly G)
    - Polynomial.C (Fintype.card V : ℝ) * (1 + Polynomial.X) ^ (Fintype.card V - 1) * conn_set_poly G
See it in the graphDiscuss this resultChallenge it