AFTD Auto-Formalizing Theoretical Domains

odd_component_c

def

Given a natural number N, coefficients a, c : Fin (2 * N + 1) → ℝ, and an index n : Fin ((N - 1) + 1), the normalized downward coefficient of the odd component odd_component_c N a c n is (ext_c (2 * n.val + 1) * ext_c (2 * n.val)) / (ext_a 1 * ext_a 2), where ext_a, ext_c : ℤ → ℝ extend a and c by zero outside [0, 2 * N].

Statement

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

odd_component_c is a definition taking: - a natural number N : ℕ, - two functions a, c : Fin (2 * N + 1) → ℝ, - an index n : Fin ((N - 1) + 1), and returning the real number: (ext_c (2 * n.val + 1) * ext_c (2 * n.val)) / a0 where: - ext_a : ℤ → ℝ maps k to a ⟨k.toNat, _⟩ if 0 ≤ k ≤ 2 * N, and to 0 otherwise; - ext_c : ℤ → ℝ maps k to c ⟨k.toNat, _⟩ if 0 ≤ k ≤ 2 * N, and to 0 otherwise; - a0 : ℝ is defined as ext_a 1 * ext_a 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 downward coefficients of the odd component of a symmetric recurrence array of size 2N. -/
noncomputable def odd_component_c (N : ℕ) (a c : Fin (2 * N + 1) → ℝ) (n : Fin ((N - 1) + 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 1 * ext_a 2
  (ext_c (2 * n.val + 1) * ext_c (2 * n.val)) / a0
See it in the graphDiscuss this resultChallenge it