Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver mobius, shift 0
- Concludes
- mobius_x_over_x_plus_one of shift_x_plus_one of Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).
- Premises
- shift_x_plus_one of Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-a903433d625176a7· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-2564a62a349877a3fe8ca5ae89f197107eb637f3c2bc6a1569a7d40bd53b13f42dd, 31,146 bytes (10,175 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-47dbbceb54d8e6b2(real_rooted)n-47dbbceb54d8e6b2(one_signed_coefficients)n-47dbbceb54d8e6b2(hadamard_kernel)