recurrence_poly
The 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 n = i + 2, R_{i+2} is (1 / a(i+1)) • ((X - b(i+1)) * R_{i+1} - c(i+1) * R_i) when i + 1 < N + 1, and 0 otherwise.
Statement
noncomputable def recurrence_poly (N : ℕ) (a b c : Fin (N + 1) → ℝ) : ℕ → Polynomial ℝ
- Defined in
- arXiv:2611.01561 Sec. 2, Eq. (2.2)
- 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…
- 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 +…
- linearization_coeffFor 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…
Read back from the Lean
A definition recurrence_poly that takes a natural number N and three functions a, b, c : Fin (N + 1) → ℝ, and recursively defines a sequence of real polynomials P : ℕ → Polynomial ℝ by:
- P 0 = 1
- P 1 = X
- For n = i + 2 with i : ℕ:
- If i + 1 < N + 1, then P (i + 2) = (1 / a ⟨i + 1, h⟩) • ((X - C (b ⟨i + 1, h⟩)) * P (i + 1) - C (c ⟨i + 1, h⟩) * P i)
- Otherwise, P (i + 2) = 0
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
/-- Orthogonal polynomials R_n defined by three-term recurrence. -/ noncomputable def recurrence_poly (N : ℕ) (a b c : Fin (N + 1) → ℝ) : ℕ → Polynomial ℝ | 0 => 1 | 1 => Polynomial.X | i + 2 => if h : i + 1 < N + 1 then (1 / a ⟨i + 1, h⟩) • ((Polynomial.X - Polynomial.C (b ⟨i + 1, h⟩)) * recurrence_poly N a b c (i + 1) - Polynomial.C (c ⟨i + 1, h⟩) * recurrence_poly N a b c i) else 0