AFTD Auto-Formalizing Theoretical Domains

hn_poly

def

For every natural number n, hn_poly n is the cubic polynomial q_n(x) = x^3 - n*x^2 - (2*n^2 - n - 1)*x + (n^2 - n) over the real numbers.

Statement

noncomputable def hn_poly (n : ℕ) : Polynomial ℝ
Defined in
arXiv:2610.18636:210
Verified
23 Oct 2026
Axioms
none listed
Used by 3
  • hn_quotient_matrix_charpolyFor every natural number n, the characteristic polynomial of the quotient matrix hn_quotient_matrix n equals (Polynomial.X + Polynomial.C…
  • hn_spectrumFor every integer n ≥ 2, there exist real numbers l1 > l2 > l3 such that 1/2 < l1 < 2n, 0 < l2 < 1/2, -n < l3 < 0, hn_poly n =…
  • hn_poly_three_rootsFor every integer n ≥ 2, the cubic polynomial hn_poly n has three real roots l1 > l2 > l3 satisfying 1/2 < l1 < 2n, 0 < l2 < 1/2, and -n <…

Read back from the Lean

Definition of a function hn_poly that takes a natural number $n$ and returns the polynomial in $\mathbb{R}[X]$ given by $X^3 - n X^2 - (2n^2 - n - 1)X + (n^2 - n)$ (where $n$ is 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

/-- The cubic polynomial q_n(x) associated with the competitor graph H_n. -/
noncomputable def hn_poly (n : ℕ) : Polynomial ℝ :=
  Polynomial.X ^ 3 - Polynomial.C (n : ℝ) * Polynomial.X ^ 2 -
    Polynomial.C (2 * (n : ℝ) ^ 2 - (n : ℝ) - 1) * Polynomial.X +
    Polynomial.C ((n : ℝ) ^ 2 - (n : ℝ))
See it in the graphDiscuss this resultChallenge it