Proof step
Laguerre’s theorem on differential operators
Image under a real-rootedness preserver derivative polynomial, shift 0
- Concludes
- one_plus_derivative of Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).
- Premises
- Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).
- 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-fa43d0c013b25b60· 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" } } }- Certificate
preserver_image, SHA-25678ba5a852b31c1634152af8d4a4f0aff6b0a2182b0ff06170ba0c04601720d88, 10,578 bytes (2,903 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-78dcc9a0c7593b0d(real_rooted)n-78dcc9a0c7593b0d(one_signed_coefficients)n-78dcc9a0c7593b0d(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.