even_component_c
Given a natural number N, coefficients a, c : Fin (2 * N + 1) → ℝ, and an index n : Fin (N + 1), the normalized downward coefficient of the even component even_component_c N a c n is (ext_c (2 * (n.val : ℤ)) * ext_c (2 * (n.val : ℤ) - 1)) / (ext_a 0 * ext_a 1), where ext_a, ext_c : ℤ → ℝ extend a and c by zero outside [0, 2 * N].
Statement
noncomputable def even_component_c (N : ℕ) (a c : Fin (2 * N + 1) → ℝ) (n : Fin (N + 1)) : ℝ
- Defined in
- arXiv:2611.01561 Theorem 4.1
- Verified
- 07 Nov 2026
- Axioms
- none listed
Read back from the Lean
even_component_c is a definition that takes a natural number N, two functions a, c : Fin (2 * N + 1) → ℝ, and an index n : Fin (N + 1), and returns the real number
(ext_c (2 * n) * ext_c (2 * n - 1)) / (ext_a 0 * ext_a 1)
where ext_a and ext_c extend a and c to ℤ by setting values outside the index range [0, 2 * N] to 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
/-- Normalized downward coefficients of the even component of a symmetric recurrence array of size 2N. -/ noncomputable def even_component_c (N : ℕ) (a c : Fin (2 * N + 1) → ℝ) (n : Fin (N + 1)) : ℝ := let ext_a (k : ℤ) : ℝ := if h : 0 ≤ k ∧ k ≤ 2 * N then a ⟨k.toNat, by omega⟩ else 0 let ext_c (k : ℤ) : ℝ := if h : 0 ≤ k ∧ k ≤ 2 * N then c ⟨k.toNat, by omega⟩ else 0 let a0 := ext_a 0 * ext_a 1 (ext_c (2 * (n.val : ℤ)) * ext_c (2 * (n.val : ℤ) - 1)) / a0