Proof step
Laguerre’s theorem on differential operators
Image under a real-rootedness preserver derivative polynomial, shift 0
- Concludes
- one_plus_derivative of reversal of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0]…
- Premises
- reversal of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = …
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- reversal of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = …
- Theorem
- [SP14] polytool ?
- Lean
- RealRooted
RealRooted.splits_add_C_mul_derivative_all,RealRooted.splits_C_mul_add_derivative,Polynomial.Splits.derivative - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-e328c92b880f32de· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256744d639bd785cc1db7660bcd616127d3b7711ad4cffff7bb8b2213c2f08ad7df, 14,111 bytes (3,328 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-8a2aac8e257e6387(real_rooted)n-8a2aac8e257e6387(one_signed_coefficients)n-8a2aac8e257e6387(hadamard_kernel)n-8a2aac8e257e6387(interlacing)
References
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.