AFTD Auto-Formalizing Theoretical Domains

connected_induced_mean_order

def

The lambda-weighted mean order of a nonempty connected induced vertex set in a graph G is lambda * Z'_G(lambda) / Z_G(lambda), where Z_G(lambda) is the generating polynomial of connected induced vertex sets.

Statement

open scoped BigOperators Polynomial in
noncomputable def connected_induced_mean_order {V : Type*} [Fintype V] (G : SimpleGraph V) (lam : ℝ) : ℝ
Defined in
knowledge base, OP-599
Verified
28 Oct 2026
Axioms
none listed
Built on 1
  • is_connected_vertex_setA vertex set S of a graph G is connected if the subgraph of G induced by S is connected (in particular S is nonempty).

Read back from the Lean

Given a finite type V, a simple graph G on V, and a real number lam, connected_induced_mean_order G lam is the real number defined by: lam * (Polynomial.derivative Z).eval lam / Z.eval lam where Z is the real polynomial defined as the sum over all finite subsets S of V whose induced subgraph G.induce (↑S : Set V) is connected (is_connected_vertex_set G (↑S : Set V)) of X ^ (Finset.card 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 scoped BigOperators Polynomial in
/-- The lambda-weighted mean order of a nonempty connected induced vertex set in a graph G. -/
noncomputable def connected_induced_mean_order {V : Type*} [Fintype V] (G : SimpleGraph V) (lam : ℝ) : ℝ :=
  let Z := open scoped Classical in
    ∑ S ∈ (Finset.univ.filter (fun (S : Finset V) => is_connected_vertex_set G (↑S : Set V))),
      (Polynomial.X : Polynomial ℝ) ^ Finset.card S
  lam * (Polynomial.derivative Z).eval lam / Z.eval lam
See it in the graphDiscuss this resultChallenge it