Proof step e-01a8bab2955d58ac
obreschkoff_combination → concludes about obreschkoff_combination of Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1. JSON
Theorem
Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
Operation
Obreschkoff combination Pₙ + Pₙ₊₁
{
"operation": "obreschkoff_combination"
}
Premises
- Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1. (sequence)
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)
- Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1. (sequence)
uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
Claims
- { "claim": "real_rooted", "from_index": 1, "region": {} }
Verification and certificate
- polytool: replayed (the certificate replayed when the step was written)
- Lean: not attempted
- certificate:
obreschkoff_combination, SHA-256cabf9921104fbdbeb6f707c3a4f085af70330e82f614c9a77fd47081926b4827, 14,283 bytes (3,167 compressed); download JSON
Cited by
n-1fefd5af9c8edffe(real_rooted)
References
- [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
- [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.