AFTD Auto-Formalizing Theoretical Domains

recurrence_matrix

def

For 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 + 1, b i when j.val = i.val, c i when i.val = j.val + 1, and 0 otherwise.

Statement

noncomputable def recurrence_matrix (N : ℕ) (a b c : Fin (N + 1) → ℝ) :
    Matrix (Fin (N + 1)) (Fin (N + 1)) ℝ
Defined in
arXiv:2611.01561 Sec. 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

The definition recurrence_matrix takes a natural number N and three sequences a, b, c : Fin (N + 1) → ℝ, and produces an (N + 1) × (N + 1) real matrix whose entry at row i and column j is: - a i if j = i + 1 (the superdiagonal), - b i if j = i (the main diagonal), - c i if i = j + 1 (the subdiagonal), - 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

/-- Tridiagonal recurrence matrix J on Fin (N + 1). -/
noncomputable def recurrence_matrix (N : ℕ) (a b c : Fin (N + 1) → ℝ) :
    Matrix (Fin (N + 1)) (Fin (N + 1)) ℝ := Matrix.of fun i j =>
    if j.val = i.val + 1 then a i
    else if j.val = i.val then b i
    else if i.val = j.val + 1 then c i
    else 0
See it in the graphDiscuss this resultChallenge it