AFTD Auto-Formalizing Theoretical Domains

symmetric_oct_f

def

The degree-8 symmetric function F evaluated on an n-dimensional vector x, defined in terms of power sums by 4 p_1^2 (p_3 - 4 p_1^3)^2 + 9 p_2 (p_6 - 8 p_1^2 p_4 + 16 p_1^4 p_2) - 16 p_1^8.

Statement

def symmetric_oct_f {n : ℕ} (x : Fin n → ℝ) : ℝ
Defined in
arXiv:2611.16690, Hilbert's 17th problem for symmetric functions: undecidability and a counterexample, Theorem 3.1
Verified
13 Nov 2026
Axioms
none listed
Built on 1
  • symmetric_power_sumThe r-th power sum of an n-dimensional real vector x is the sum of (x i)^r over all indices i in Fin n.

Read back from the Lean

Given an implicit natural number $n$ and a vector $x : \text{Fin } n \to \mathbb{R}$, symmetric_oct_f x is defined as the real number: $$4 p_1(x)^2 \left(p_3(x) - 4 p_1(x)^3\right)^2 + 9 p_2(x) \left(p_6(x) - 8 p_1(x)^2 p_4(x) + 16 p_1(x)^4 p_2(x)\right) - 16 p_1(x)^8$$ where $p_r(x) = \text{symmetric\_power\_sum } r\ x$.

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

/-- The degree-8 symmetric function F defined in the power sum basis. -/
def symmetric_oct_f {n : ℕ} (x : Fin n → ℝ) : ℝ := 4 * (symmetric_power_sum 1 x) ^ 2 * (symmetric_power_sum 3 x - 4 * (symmetric_power_sum 1 x) ^ 3) ^ 2 + 9 * symmetric_power_sum 2 x * (symmetric_power_sum 6 x - 8 * (symmetric_power_sum 1 x) ^ 2 * symmetric_power_sum 4 x + 16 * (symmetric_power_sum 1 x) ^ 4 * symmetric_power_sum 2 x) - 16 * (symmetric_power_sum 1 x) ^ 8
See it in the graphDiscuss this resultChallenge it