Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_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 >= 0 and …
- 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
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-155cf4a2764fba90· 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": 1, "region": { "lower": { "closed": true, "value": "-2" }, "upper": { "closed": false, "value": "-1" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256f01978d17b83b0987b5095a1cab2aadda5eaf6e62ff9ee1739f23958aaf051e6, 17,426 bytes (3,458 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-ded0a7d0241d1354(real_rooted)n-ded0a7d0241d1354(one_signed_coefficients)n-ded0a7d0241d1354(hadamard_kernel)n-ded0a7d0241d1354(interlacing)