satisfies_recurrence_2_1
def
Real coefficients a, b, c : Fin (N + 1) → ℝ satisfy condition (2.1) if a 0 = 1, b 0 = 0, c 0 = 0, a N = 0, a i + b i + c i = 1 for all i, a i > 0 for all i with i.val < N, and c i > 0 for all i with 0 < i.val.
Statement
def satisfies_recurrence_2_1 (N : ℕ) (a b c : Fin (N + 1) → ℝ) : Prop
- Defined in
- arXiv:2611.01561, equation (2.1)
- Verified
- 07 Nov 2026
- Axioms
- none listed
- Used by 2
- recurrence_potential_weights_posFor any recurrence satisfying (2.1), the potential weights π_i are strictly positive for all i : Fin (N + 1).
- satisfies_recurrence_2_1_existsFor every integer N ≥ 1, there exist recurrence coefficients a, b, c : Fin (N + 1) → ℝ satisfying condition (2.1).
Read back from the Lean
Given a natural number N and functions a, b, c : Fin (N + 1) → ℝ, asserts the conjunction of the following seven conditions: 1. a at index 0 is equal to 1, 2. b at index 0 is equal to 0, 3. c at index 0 is equal to 0, 4. a at index N is equal to 0, 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 a i > 0, 7. for all i : Fin (N + 1), if 0 < i.val then c i > 0.
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
/-- Condition (2.1) of arXiv:2611.01561 for normalized finite orthogonal polynomial recurrences. -/ def satisfies_recurrence_2_1 (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)