Proof step
Laguerre’s theorem on differential operators
Image under a real-rootedness preserver derivative polynomial, shift 0
- Concludes
- derivative of basis_map_A013610 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
- Premises
- basis_map_A013610 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
- 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-1296c7983fa47a9a· 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": 1, "region": { "upper": { "closed": true, "value": "0" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256329dc88df8846682c9319154240075fd74d116931fce1ce11a09e73202cdd02b, 16,829 bytes (3,938 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-8fb26d3bf722c8bb(interlacing)n-8fb26d3bf722c8bb(real_rooted)n-8fb26d3bf722c8bb(one_signed_coefficients)n-8fb26d3bf722c8bb(hadamard_kernel)
References
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.