even_component_b
Given a natural number N, coefficients a, c : Fin (2 * N + 1) → ℝ, and an index n : Fin (N + 1), the normalized diagonal coefficient of the even component even_component_b N a c n is (bn - b0) / a0, where ext_a, ext_c : ℤ → ℝ extend a and c by zero outside [0, 2 * N], a0 = ext_a 0 * ext_a 1, b0 = ext_c 0 * ext_a (-1) + ext_a 0 * ext_c 1, and bn = ext_c (2 * n.val) * ext_a (2 * n.val - 1) + ext_a (2 * n.val) * ext_c (2 * n.val + 1).
Statement
noncomputable def even_component_b (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_b is a definition taking a natural number N, two tuples of real numbers a, c : Fin (2 * N + 1) → ℝ, and an index n : Fin (N + 1), and returning the real number (bn - b0) / a0, where:
- ext_a and ext_c are the extensions of a and c from {0, ..., 2N} to ℤ → ℝ, defined to be 0 outside the range [0, 2N];
- a0 = ext_a 0 * ext_a 1;
- b0 = ext_c 0 * ext_a (-1) + ext_a 0 * ext_c 1 (note that ext_a (-1) = 0);
- bn = ext_c (2 * n) * ext_a (2 * n - 1) + ext_a (2 * n) * ext_c (2 * n + 1).
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 diagonal coefficients of the even component of a symmetric recurrence array of size 2N. -/ noncomputable def even_component_b (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 let b0 := ext_c 0 * ext_a (-1) + ext_a 0 * ext_c 1 let bn := ext_c (2 * n.val) * ext_a (2 * n.val - 1) + ext_a (2 * n.val) * ext_c (2 * n.val + 1) (bn - b0) / a0