AFTD Auto-Formalizing Theoretical Domains

dominating_partition_function

def

The dominating set partition function Z_G(lam) of a finite simple graph G is the sum over all dominating sets S of G of lam^{|S|}.

Statement

open Classical in
noncomputable def dominating_partition_function {V : Type*} [Fintype V]
    (G : SimpleGraph V) (lam : ℝ) : ℝ
Defined in
arXiv:2208.10475v2; OP-542
Verified
27 Oct 2026
Axioms
none listed
Built on 1
  • simple_graph_dominating_setsD(G): the dominating sets of G, i.e. the finite vertex sets S such that every vertex of G lies in S or is adjacent to a vertex of S.
Used by 2

Read back from the Lean

For a finite type V, a simple graph G on vertex type V, and a real number lam, dominating_partition_function G lam is defined as the sum over all dominating sets S of G of lam ^ S.card, where a dominating set of G is a subset S ⊆ V such that every vertex w : V is either in S or adjacent in G to some vertex in S.

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

open Classical in
/-- The dominating set partition function Z_G(lam) of a finite simple graph G. -/
noncomputable def dominating_partition_function {V : Type*} [Fintype V]
    (G : SimpleGraph V) (lam : ℝ) : ℝ := ∑ S ∈ simple_graph_dominating_sets G, lam ^ S.card
See it in the graphDiscuss this resultChallenge it