Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- 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 downward antidiagonals.
- 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
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-235159a5aaacbbac· 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-2569f9c6c84ddf5d5bf0cfc2c8c571335c1b6305bcff4126120bc79dc084b7a7be4, 7,998 bytes (2,320 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-a6f555b0e6271a68(one_signed_coefficients)n-a6f555b0e6271a68(hadamard_kernel)n-a6f555b0e6271a68(real_rooted)