Proof step e-d13f851235c1b0bb
obreschkoff_combination → concludes about obreschkoff_combination of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers … JSON
Theorem
Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
Operation
Obreschkoff combination Pₙ + Pₙ₊₁
{
"operation": "obreschkoff_combination"
}
Premises
- Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T… (sequence)
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
- Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T… (sequence)
uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
Claims
- { "claim": "real_rooted", "from_index": 0, "region": {} }
Verification and certificate
- polytool: replayed (the certificate replayed when the step was written)
- Lean: not attempted
- certificate:
obreschkoff_combination, SHA-256ce162e3cc0e7fe439354d5d770d302036f662749025c50bdb0bac8a520596738, 10,335 bytes (2,530 compressed); download JSON
Cited by
n-3ab85f10ab048936(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.