AFTD Auto-Formalizing Theoretical Domains

split_graph_var_bound

def

For natural numbers n and k, split_graph_var_bound n k is the real number defined by (k : ℝ) * ((n - k : ℕ) : ℝ) * (((n - k : ℕ) : ℝ) - 1)^2 / (n : ℝ)^2, using truncated natural subtraction n - k before casting to the real numbers.

Statement

noncomputable def split_graph_var_bound (n k : ℕ) : ℝ
Defined in
arXiv:2609.14826: Section 3
Verified
10 Nov 2026
Axioms
none listed
Used by 1
  • split_graph_max_varFor a natural number n, split_graph_max_var n is the supremum over all natural numbers k in Finset.Ico 1 n of split_graph_var_bound n k.

Read back from the Lean

The definition split_graph_var_bound is a function that takes two natural numbers $n$ and $k$ and returns the real number given by the expression $\frac{k \cdot (n - k) \cdot ((n - k) - 1)^2}{n^2}$, where $n - k$ is truncated natural number subtraction coerced to $\mathbb{R}$.

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

/-- Variance of the random greedy independent set size on complete split graph K_k + \bar{K}_{n-k}. -/
noncomputable def split_graph_var_bound (n k : ℕ) : ℝ := (k : ℝ) * ((n - k : ℕ) : ℝ) * (((n - k : ℕ) : ℝ) - 1) ^ 2 / ((n : ℝ) ^ 2)
See it in the graphDiscuss this resultChallenge it