Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of Table: T(n,k) = n!*binomial(n+1,2*k).
- Premises
- Table: T(n,k) = n!*binomial(n+1,2*k).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Table: T(n,k) = n!*binomial(n+1,2*k).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-87d453074c589e9c· 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-256f58d79062b39dab0a4cd2c3a23fa521119903ba03411f071d524553ecacaa4ea, 9,466 bytes (2,634 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-d7283fa0e9ac22b4(real_rooted)n-d7283fa0e9ac22b4(one_signed_coefficients)n-d7283fa0e9ac22b4(hadamard_kernel)