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 Triangle read by rows, T(n, k) = Sum_{j=0..n} C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >…
- Premises
- Triangle read by rows, T(n, k) = Sum_{j=0..n} C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >= 0 and …
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in [-1, 0)
- Triangle read by rows, T(n, k) = Sum_{j=0..n} C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >= 0 and …
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-1e4f0d4e4579b71e· 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\":1,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": false, "value": "0" } } }- Certificate
preserver_image, SHA-256c63117fc4c8fba3b35b7fe80b71b239c4a0d85a80c4b183af87491cc1a2285ec, 16,477 bytes (3,217 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-27eab39bb9297ea0(one_signed_coefficients)n-27eab39bb9297ea0(hadamard_kernel)n-27eab39bb9297ea0(real_rooted)