AFTD Auto-Formalizing Theoretical Domains

recurrence_profile

def

For N : ℕ, b, c : Fin (N + 1) → ℝ, and i : Fin (N + 1), the profile is b i + c i.

Statement

noncomputable def recurrence_profile (N : ℕ) (b c : Fin (N + 1) → ℝ) (i : Fin (N + 1)) : ℝ
Defined in
arXiv:2611.01561 Sec. 2
Verified
04 Nov 2026
Axioms
none listed
Used by 3

Read back from the Lean

Given a natural number $N$, two functions (or sequences) $b, c : \text{Fin}(N + 1) \to \mathbb{R}$, and an index $i \in \text{Fin}(N + 1)$, recurrence_profile N b c i is defined as the real number $b(i) + c(i)$.

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

/-- Profile sequence d_i = b_i + c_i on Fin (N + 1). -/
noncomputable def recurrence_profile (N : ℕ) (b c : Fin (N + 1) → ℝ) (i : Fin (N + 1)) : ℝ := b i + c i
See it in the graphDiscuss this resultChallenge it