AFTD Auto-Formalizing Theoretical Domains

odd_component_b

def

Given a natural number N, coefficients a, c : Fin (2 * N + 1) → ℝ, and an index n : Fin ((N - 1) + 1), the normalized diagonal coefficient of the odd component odd_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 1 * ext_a 2, b0 = ext_a 1 * ext_c 2 + ext_c 1 * ext_a 0, and bn = ext_a (2 * n.val + 1) * ext_c (2 * n.val + 2) + ext_c (2 * n.val + 1) * ext_a (2 * n.val).

Statement

noncomputable def odd_component_b (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

A definition odd_component_b which takes: - a natural number N : ℕ, - two functions a, c : Fin (2 * N + 1) → ℝ, - an index n : Fin ((N - 1) + 1), and produces the real number (bn - b0) / a0, where: - ext_a k (for k : ℤ) is a ⟨k.toNat, _⟩ if 0 ≤ k ≤ 2 * N, and 0 otherwise, - ext_c k (for k : ℤ) is c ⟨k.toNat, _⟩ if 0 ≤ k ≤ 2 * N, and 0 otherwise, - a0 = ext_a 1 * ext_a 2, - b0 = ext_a 1 * ext_c 2 + ext_c 1 * ext_a 0, - bn = ext_a (2 * n.val + 1) * ext_c (2 * n.val + 2) + ext_c (2 * n.val + 1) * ext_a (2 * n.val).

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 odd component of a symmetric recurrence array of size 2N. -/
noncomputable def odd_component_b (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
  let b0 := ext_a 1 * ext_c 2 + ext_c 1 * ext_a 0
  let bn := ext_a (2 * n.val + 1) * ext_c (2 * n.val + 2) + ext_c (2 * n.val + 1) * ext_a (2 * n.val)
  (bn - b0) / a0
See it in the graphDiscuss this resultChallenge it