Proof step e-438bbc5de73b4ca9
obreschkoff_combination → concludes about obreschkoff_combination of Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 9*x + 2. 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) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 9*x + 2. (sequence)
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
- Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 9*x + 2. (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-2560558497f14834567fbf27ce7c03b6cd254f06d76c3f87b4d0c6dd8582a469c28, 12,279 bytes (2,721 compressed); download JSON
Cited by
n-f3255eb099254811(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.