AFTD Auto-Formalizing Theoretical Domains

is_log_concave_newton

def

For N : ℕ and d : Fin (N + 1) → ℝ, the profile has log-concave Newton coefficients if newton_coeff N d k ≥ 0 for all 1 ≤ k ≤ N and (newton_coeff N d k)^2 ≥ newton_coeff N d (k - 1) * newton_coeff N d (k + 1) for all 2 ≤ k < N.

Statement

def is_log_concave_newton (N : ℕ) (d : Fin (N + 1) → ℝ) : Prop
Defined in
arXiv:2611.01561 Sec. 3
Verified
04 Nov 2026
Axioms
none listed
Built on 1
  • newton_coeffFor N : ℕ, d : Fin (N + 1) → ℝ, and k : ℕ, the k-th Newton coefficient is the sum over i from 0 to k of (-1)^(k - i) * (k choose i) * d(i)…
Used by 2

Read back from the Lean

Given a natural number N and a sequence d : Fin (N + 1) → ℝ, is_log_concave_newton N d asserts that: 1. For all k ∈ ℕ such that 1 ≤ k ≤ N, newton_coeff N d k is nonnegative (≥ 0); and 2. For all k ∈ ℕ such that 2 ≤ k < N, the square of newton_coeff N d k is at least the product newton_coeff N d (k - 1) * newton_coeff N d (k + 1).

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

/-- A profile has log-concave Newton coefficients without internal zeros. -/
def is_log_concave_newton (N : ℕ) (d : Fin (N + 1) → ℝ) : Prop := (∀ k ∈ Finset.Icc 1 N, 0 ≤ newton_coeff N d k) ∧
  (∀ k ∈ Finset.Ico 2 N, (newton_coeff N d k) ^ 2 ≥ newton_coeff N d (k - 1) * newton_coeff N d (k + 1))
See it in the graphDiscuss this resultChallenge it