Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- Triangle read by rows, T(n, k) = Sum_{i=0..n} L'(n, n-i) * binomial(i, k), for k = 0..n-1.
- Premises
- Triangular array A066667 or A008297 unsigned and transposed.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangular array A066667 or A008297 unsigned and transposed.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-be016f00370af8fd· 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" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-2563408442a458f738fa18f5a64ea76f3bda10b4d9cebe11ffadf00adbeca38551f, 11,905 bytes (3,005 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-eb51f16fedb3c293(real_rooted)n-eb51f16fedb3c293(one_signed_coefficients)n-eb51f16fedb3c293(hadamard_kernel)n-eb51f16fedb3c293(interlacing)