AFTD Auto-Formalizing Theoretical Domains

weighted_clique_mean

def

The lambda-weighted mean order of the complete graph K_n, equal to n * lam * (1+lam)^(n-1) / ((1+lam)^n - 1).

Statement

noncomputable def weighted_clique_mean (n : ℕ) (lam : ℝ) : ℝ
Source
step towards op_599_connected_induced_activity_clique_minimum
Verified
28 Oct 2026
Axioms
none listed

Lean source view module on GitHub

/-- mu(n, lam) = n·lam·(1+lam)^(n-1)/((1+lam)^n − 1), the weighted mean order of K_n. -/
noncomputable def weighted_clique_mean (n : ℕ) (lam : ℝ) : ℝ := (n : ℝ) * lam * (1 + lam) ^ (n - 1) / ((1 + lam) ^ n - 1)
See it in the graphDiscuss this resultChallenge it