odd_component_a
Given a natural number N, coefficients a : Fin (2 * N + 1) → ℝ, and an index n : Fin ((N - 1) + 1), the normalized upward coefficient of the odd component odd_component_a N a n is (ext (2 * n.val + 1) * ext (2 * n.val + 2)) / (ext 1 * ext 2), where ext : ℤ → ℝ extends a by zero outside [0, 2 * N].
Statement
noncomputable def odd_component_a (N : ℕ) (a : Fin (2 * N + 1) → ℝ) (n : Fin ((N - 1) + 1)) : ℝ
- Defined in
- arXiv:2611.01561 Theorem 4.1
- Verified
- 07 Nov 2026
- Axioms
- none listed
Read back from the Lean
The definition odd_component_a takes:
- a natural number N,
- a function a : Fin (2 * N + 1) → ℝ,
- an index n : Fin ((N - 1) + 1),
and produces the real number:
(ext (2 * n.val + 1) * ext (2 * n.val + 2)) / a0
where:
- ext : ℤ → ℝ is the extension of a to the integers, defined by ext k = a ⟨k.toNat, _⟩ if 0 ≤ k ∧ k ≤ 2 * N, and 0 otherwise,
- a0 = ext 1 * ext 2.
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 upward coefficients of the odd component of a symmetric recurrence array of size 2N. -/ noncomputable def odd_component_a (N : ℕ) (a : Fin (2 * N + 1) → ℝ) (n : Fin ((N - 1) + 1)) : ℝ := let ext (k : ℤ) : ℝ := if h : 0 ≤ k ∧ k ≤ 2 * N then a ⟨k.toNat, by omega⟩ else 0 let a0 := ext 1 * ext 2 (ext (2 * n.val + 1) * ext (2 * n.val + 2)) / a0