Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
- Premises
- shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-350089fd6b0d9a4e· 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-2566d2e206aa6d5d1df51836d5049a56dbca9cdc05ecfc9847718a41ea5da0c8363, 4,884 bytes (1,527 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-0d4899845526eba3(real_rooted)n-0d4899845526eba3(one_signed_coefficients)n-0d4899845526eba3(hadamard_kernel)