Proof step
Laguerre’s theorem on differential operators
Image under a real-rootedness preserver derivative polynomial, shift 0
- Concludes
- derivative of basis_map_A013609 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
- Premises
- basis_map_A013609 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013609 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
- 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-79bc1fc0541d415b· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"0\"],\"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-2567ff7a91f3d513f24d417bbbc530f0e80abd1fd34f10cd4f09c73ca45d141dcf5, 13,317 bytes (3,153 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-c67a9ecf29f2d564(real_rooted)n-c67a9ecf29f2d564(one_signed_coefficients)n-c67a9ecf29f2d564(hadamard_kernel)n-c67a9ecf29f2d564(interlacing)
References
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.