recurrence_ratio
def
For N : ℕ, b, c : Fin (N + 1) → ℝ, and i : Fin (N + 1), the ratio is c i / (b i + c i).
Statement
noncomputable def recurrence_ratio (N : ℕ) (b c : Fin (N + 1) → ℝ) (i : Fin (N + 1)) : ℝ
- Defined in
- arXiv:2611.01561 Sec. 6
- Verified
- 04 Nov 2026
- Axioms
- none listed
- Used by 3
- op_940_decreasing_ratios_not_all_property_pIt is not the case that for every N ≥ 2 and all normalized recurrence coefficients a, b, c : Fin (N + 1) → ℝ with log-concave Newton…
- op_940_dim2_property_p_constant_ratioFor N = 2 and any normalized recurrence coefficients a, b, c : Fin 3 → ℝ with log-concave Newton profile, if the ratio sequence is…
- op_940_dim2_property_p_of_ratio_conditionFor N = 2 and any normalized recurrence coefficients a, b, c : Fin 3 → ℝ, property (P) holds whenever the profile at 1 multiplied by (1 +…
Read back from the Lean
A definition: for a natural number $N$, functions $b, c : \mathrm{Fin}(N + 1) \to \mathbb{R}$, and an index $i : \mathrm{Fin}(N + 1)$, recurrence_ratio N b c i is defined to be the real number $c(i) / (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
/-- Ratio sequence r_i = c_i / (b_i + c_i) on Fin (N + 1). -/ noncomputable def recurrence_ratio (N : ℕ) (b c : Fin (N + 1) → ℝ) (i : Fin (N + 1)) : ℝ := c i / (b i + c i)