recurrence_potential_weights
For N : ℕ, a, c : Fin (N + 1) → ℝ, and i : Fin (N + 1), the potential weight π_i is the product over j < i.val of a(j) / c(j + 1).
Statement
noncomputable def recurrence_potential_weights (N : ℕ) (a c : Fin (N + 1) → ℝ) (i : Fin (N + 1)) : ℝ
- Defined in
- arXiv:2611.01561, Proof of Lemma 2.1
- Verified
- 07 Nov 2026
- Axioms
- none listed
- Used by 1
- recurrence_potential_weights_posFor any recurrence satisfying (2.1), the potential weights π_i are strictly positive for all i : Fin (N + 1).
Read back from the Lean
A definition recurrence_potential_weights that takes:
- a natural number $N$,
- two functions $a, c : \mathrm{Fin}(N + 1) \to \mathbb{R}$,
- an index $i : \mathrm{Fin}(N + 1)$,
and computes the real number given by the finite product over $j : \mathrm{Fin}(i.\mathrm{val})$ of
$$\frac{a(j)}{c(j + 1)}$$
where $j$ is coerced to $\mathrm{Fin}(N + 1)$ via $j < i < N + 1$, and $j + 1$ is coerced to $\mathrm{Fin}(N + 1)$ via $j + 1 \le i < N + 1$.
In other words, it computes $\prod_{j=0}^{i.\mathrm{val} - 1} \frac{a(j)}{c(j + 1)}$, which evaluates to $1$ when $i.\mathrm{val} = 0$ (the empty product).
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
/-- Potential weights π_i for a finite recurrence array, defined by π_0 = 1 and π_{i+1} = π_i * a_i / c_{i+1}. -/ noncomputable def recurrence_potential_weights (N : ℕ) (a c : Fin (N + 1) → ℝ) (i : Fin (N + 1)) : ℝ := ∏ j : Fin i.val, a ⟨j.val, lt_trans j.isLt i.isLt⟩ / c ⟨j.val + 1, Nat.lt_of_le_of_lt (Nat.succ_le_of_lt j.isLt) i.isLt⟩