AFTD Auto-Formalizing Theoretical Domains

split_graph_max_var

def

For 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.

Statement

noncomputable def split_graph_max_var (n : ℕ) : ℝ
Defined in
arXiv:2609.14826: Section 4
Verified
10 Nov 2026
Axioms
none listed
Built on 1
  • split_graph_var_boundFor natural numbers n and k, split_graph_var_bound n k is the real number defined by (k : ℝ) * ((n - k : ℕ) : ℝ) * (((n - k : ℕ) : ℝ) -…

Read back from the Lean

The definition split_graph_max_var assigns to each natural number $n$ the real number given by the indexed supremum over all $k \in \mathbb{N}$ such that $1 \le k < n$ of split_graph_var_bound n k.

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

/-- Maximum variance among complete split graphs on n vertices. -/
noncomputable def split_graph_max_var (n : ℕ) : ℝ := ⨆ k ∈ Finset.Ico 1 n, split_graph_var_bound n k
See it in the graphDiscuss this resultChallenge it