AFTD Auto-Formalizing Theoretical Domains

newton_coeff

def

For 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) when i < N + 1, and 0 otherwise.

Statement

noncomputable def newton_coeff (N : ℕ) (d : Fin (N + 1) → ℝ) (k : ℕ) : ℝ
Defined in
arXiv:2611.01561 Sec. 3
Verified
04 Nov 2026
Axioms
none listed
Used by 3
  • op_940_decreasing_ratios_not_all_property_pIt is not the case that for every N ≥ 2 and all normalized recurrence coefficients a, b, c : Fin (N + 1) → ℝ with log-concave Newton…
  • is_log_concave_newtonFor 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…
  • op_940_dim2_property_p_constant_ratioFor N = 2 and any normalized recurrence coefficients a, b, c : Fin 3 → ℝ with log-concave Newton profile, if the ratio sequence is…

Read back from the Lean

newton_coeff N d k defines a real number for any natural numbers N and k and any function d : Fin (N + 1) → ℝ. It is defined as the sum over i from 0 to k (inclusive) of (-1 : ℝ) ^ (k - i) * (Nat.choose k i : ℝ) * d ⟨i, h⟩ if i < N + 1, and 0 otherwise.

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

/-- Newton coefficients of a sequence d on Fin (N + 1). -/
noncomputable def newton_coeff (N : ℕ) (d : Fin (N + 1) → ℝ) (k : ℕ) : ℝ := ∑ i ∈ Finset.range (k + 1),
    if h : i < N + 1 then
      (-1 : ℝ) ^ (k - i) * (Nat.choose k i : ℝ) * d ⟨i, h⟩
    else 0
See it in the graphDiscuss this resultChallenge it