AFTD Auto-Formalizing Theoretical Domains

simple_graph_q

def

The invariant $q(G) = C_G(-1)$ of a finite simple graph $G$, obtained by evaluating its clique polynomial at $-1$.

Statement

noncomputable def simple_graph_q {V : Type*} [Fintype V] (G : SimpleGraph V) : ℤ
Defined in
arXiv:2611.14430, Section 4
Verified
11 Nov 2026
Axioms
none listed
Built on 1
  • simple_graph_clique_polynomialThe clique polynomial $C_G(z) = \sum_{t=0}^{|V|} c_t(G) z^t$ of a finite simple graph $G$, where $c_t(G)$ is the number of cliques of…
Used by 1

Read back from the Lean

Given a finite type V and a simple graph G on V, simple_graph_q G is the integer obtained by evaluating the clique polynomial of G (simple_graph_clique_polynomial G) at -1.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The invariant q(G) obtained by evaluating the clique polynomial at -1. -/
noncomputable def simple_graph_q {V : Type*} [Fintype V] (G : SimpleGraph V) : ℤ :=
  (simple_graph_clique_polynomial G).eval (-1)
See it in the graphDiscuss this resultChallenge it