Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of derivative of Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n.
- Premises
- derivative of Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- derivative of Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-9f3803ec88469a6b· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-2567c5667f3df72f50b7db0e54a456b28d023edeb17f86249f12d2754d38b19aea4, 7,715 bytes (1,938 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-999d2dacd9cc0a1f(one_signed_coefficients)n-999d2dacd9cc0a1f(hadamard_kernel)n-999d2dacd9cc0a1f(real_rooted)