Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of Binomial coefficients C(n,k) with n-k odd, read by rows.
- Premises
- Binomial coefficients C(n,k) with n-k odd, read by rows.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Binomial coefficients C(n,k) with n-k odd, read by rows.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-1fde7a2122fb8d16· 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": 0, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-256143d93b0ca8987c91240d55aff0bf3ae8b312c53c5c12824b401ea7e256517f1, 7,165 bytes (2,001 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-bf486d0ef84dbdc5(real_rooted)n-bf486d0ef84dbdc5(one_signed_coefficients)n-bf486d0ef84dbdc5(hadamard_kernel)