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 Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).
- Premises
- shift_x_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-1dba44b337b3ae28· 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-2569306c0142a7246ac5d7cb9772836851320f8cbe1aa495fc654987f3e1869d1ae, 27,200 bytes (4,776 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-e75fe66ef251ba0e(real_rooted)n-e75fe66ef251ba0e(one_signed_coefficients)n-e75fe66ef251ba0e(hadamard_kernel)