Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers A173018.
- Premises
- 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]
- 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-13e019b8e4362f83· 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" } } }- Certificate
preserver_image, SHA-256a2aad84d3717e90e6ce9f6b246dce55707c9938b32a9dd7a89cd4da8bcc3e323, 7,896 bytes (2,331 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-45ec3349543b0d37(one_signed_coefficients)n-45ec3349543b0d37(hadamard_kernel)n-45ec3349543b0d37(real_rooted)