Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of reversal of Triangle of Eulerian numbers T(n,k), 0 <= k <= n, read by rows.
- Premises
- reversal of Triangle of Eulerian numbers T(n,k), 0 <= k <= n, read by rows.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- reversal of Triangle of Eulerian numbers T(n,k), 0 <= k <= n, read by rows.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-32cceb5c6cccf39f· 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-2563dd70bfb524fad9c1b7d16b8be455ec05081c5a01e7efcb3a6956303c7e55321, 12,805 bytes (3,124 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-6ba8bf97eb6bdb79(one_signed_coefficients)n-6ba8bf97eb6bdb79(hadamard_kernel)n-6ba8bf97eb6bdb79(interlacing)n-6ba8bf97eb6bdb79(real_rooted)