Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- reversal of Triangle read by rows, Ward numbers T(n, k) = Sum_{m=0..k} (-1)^(m + k) * binomial(n + k, n + m) * Stirling2(n + m, m), for n >= 0, 0 <= k <= n.
- Premises
- Triangle read by rows, Ward numbers T(n, k) = Sum_{m=0..k} (-1)^(m + k) * binomial(n + k, n + m) * Stirling2(n + m, m), for n >= 0, 0 <= k …
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows, Ward numbers T(n, k) = Sum_{m=0..k} (-1)^(m + k) * binomial(n + k, n + m) * Stirling2(n + m, m), for n >= 0, 0 <= k …
- Theorem
- polytool ?
- Lean
- RealRooted
route
reversedRealRooted.X_pow_mul_reverse_eq_zero_or_splits,RealRooted.reflect_eq_zero_or_splits - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-078dab16fc2f5761· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-256a7e9f2b6b2ba0b2f24b7c06285136413a9e77f5ab44ba6e8b9a2388f6759ac76, 16,041 bytes (3,159 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-4f3d85d3aa6073ea(one_signed_coefficients)n-4f3d85d3aa6073ea(hadamard_kernel)n-4f3d85d3aa6073ea(real_rooted)