AFTD Auto-Formalizing Theoretical Domains

even_component_a

def

Given a natural number N, coefficients a : Fin (2 * N + 1) → ℝ, and an index n : Fin (N + 1), the normalized upward coefficient of the even component even_component_a N a n is (ext (2 * n.val) * ext (2 * n.val + 1)) / (ext 0 * ext 1), where ext : ℤ → ℝ extends a by zero outside [0, 2 * N].

Statement

noncomputable def even_component_a (N : ℕ) (a : 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

Definition even_component_a: given a natural number N, a sequence a : Fin (2 * N + 1) → ℝ, and an index n : Fin (N + 1), it defines a real number as follows: Let ext : ℤ → ℝ be the zero-extension of a, defined by ext(k) = a(k) if 0 ≤ k ≤ 2 * N and 0 otherwise. Let a0 = ext(0) * ext(1). The defined value is (ext(2 * n.val) * ext(2 * n.val + 1)) / a0.

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 even component of a symmetric recurrence array of size 2N. -/
noncomputable def even_component_a (N : ℕ) (a : Fin (2 * N + 1) → ℝ) (n : Fin (N + 1)) : ℝ :=
  let ext (k : ℤ) : ℝ := if h : 0 ≤ k ∧ k ≤ 2 * N then a ⟨k.toNat, by omega⟩ else 0
  let a0 := ext 0 * ext 1
  (ext (2 * n.val) * ext (2 * n.val + 1)) / a0
See it in the graphDiscuss this resultChallenge it