AFTD Auto-Formalizing Theoretical Domains

linearization_coeff

def

For N : ℕ, a, b, c : Fin (N + 1) → ℝ, and m, n, k : Fin (N + 1), the linearization coefficient is the (n, k) entry of the matrix polynomial evaluating recurrence_poly N a b c m.val at recurrence_matrix N a b c.

Statement

noncomputable def linearization_coeff (N : ℕ) (a b c : Fin (N + 1) → ℝ)
    (m n k : Fin (N + 1)) : ℝ
Defined in
arXiv:2611.01561 Sec. 2, Lemma 2.1
Verified
04 Nov 2026
Axioms
none listed
Built on 2
  • recurrence_matrixFor N : ℕ and a, b, c : Fin (N + 1) → ℝ, the tridiagonal matrix of size (N + 1) × (N + 1) has (i, j) entry equal to a i when j.val = i.val…
  • recurrence_polyThe sequence of real polynomials R_n for n : ℕ associated with N : ℕ and a, b, c : Fin (N + 1) → ℝ is defined by R_0 = 1, R_1 = X, and for…
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…
  • has_property_pFor N : ℕ and a, b, c : Fin (N + 1) → ℝ, property (P) holds if linearization_coeff N a b c m n k ≥ 0 for all m, n, k : Fin (N + 1).
  • op_940_dim2_property_p_of_ratio_conditionFor N = 2 and any normalized recurrence coefficients a, b, c : Fin 3 → ℝ, property (P) holds whenever the profile at 1 multiplied by (1 +…

Read back from the Lean

linearization_coeff defines a function taking a natural number N, three coefficient sequences a, b, c : Fin (N + 1) → ℝ, and three indices m, n, k : Fin (N + 1), and returning the real number at row n, column k of the matrix obtained by evaluating the m-th recurrence polynomial recurrence_poly N a b c m.val at the tridiagonal matrix recurrence_matrix N a b c.

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

/-- Linearization coefficient g(m, n; k) = [R_m(J)]_{n, k}. -/
noncomputable def linearization_coeff (N : ℕ) (a b c : Fin (N + 1) → ℝ)
    (m n k : Fin (N + 1)) : ℝ := (Polynomial.aeval (recurrence_matrix N a b c) (recurrence_poly N a b c m.val)) n k
See it in the graphDiscuss this resultChallenge it