AFTD Auto-Formalizing Theoretical Domains

is_normalized_recurrence

def

For N : ℕ and a, b, c : Fin (N + 1) → ℝ, the recurrence is normalized if a 0 = 1, b 0 = 0, c 0 = 0, a N = 0, a i + b i + c i = 1 for all i : Fin (N + 1), a i > 0 for all i with i.val < N, c i > 0 for all i with 0 < i.val, and b i ≥ 0 for all i : Fin (N + 1).

Statement

def is_normalized_recurrence (N : ℕ) (a b c : Fin (N + 1) → ℝ) : Prop
Defined in
arXiv:2611.01561 Sec. 2, Eq. (2.1)
Verified
04 Nov 2026
Axioms
none listed
Used by 3

Read back from the Lean

Given a natural number N and functions a, b, c : Fin (N + 1) → ℝ, is_normalized_recurrence N a b c asserts that: 1. a(0) = 1 (where 0 is index 0 of Fin (N + 1)), 2. b(0) = 0, 3. c(0) = 0, 4. a(N) = 0 (where N is index N of Fin (N + 1)), 5. for all i : Fin (N + 1), a(i) + b(i) + c(i) = 1, 6. for all i : Fin (N + 1), if i.val < N then 0 < a(i), 7. for all i : Fin (N + 1), if 0 < i.val then 0 < c(i), and 8. for all i : Fin (N + 1), 0 ≤ b(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

/-- Normalized recurrence coefficients on Fin (N + 1) with row sums one. -/
def is_normalized_recurrence (N : ℕ) (a b c : Fin (N + 1) → ℝ) : Prop := a ⟨0, Nat.zero_lt_succ N⟩ = 1 ∧
  b ⟨0, Nat.zero_lt_succ N⟩ = 0 ∧
  c ⟨0, Nat.zero_lt_succ N⟩ = 0 ∧
  a ⟨N, Nat.lt_succ_self N⟩ = 0 ∧
  (∀ i : Fin (N + 1), a i + b i + c i = 1) ∧
  (∀ i : Fin (N + 1), i.val < N → 0 < a i) ∧
  (∀ i : Fin (N + 1), 0 < i.val → 0 < c i) ∧
  (∀ i : Fin (N + 1), 0 ≤ b i)
See it in the graphDiscuss this resultChallenge it