English
The recurrence T(n−1) = 2 X T(n) − T(n+1) holds for Chebyshev polynomials with integer indices, aligning with the forward recurrence.
Русский
Рекуррентность Чебышёва: T(n−1) = 2 X T(n) − T(n+1) для целочисленных индексов.
LaTeX
$$T(n-1) = 2 X T(n) − T(n+1)$$
Lean4
/-- The canonical isomorphism between a module and the result of tensoring it
from the right by two mutually dual invertible modules. -/
noncomputable abbrev rightCancelEquiv : (P ⊗[R] M) ⊗[R] N ≃ₗ[R] P :=
TensorProduct.assoc R P M N ≪≫ₗ e.lTensor P ≪≫ₗ TensorProduct.rid R P