Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of Euler's triangle: triangle of Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.
- Premises
- Euler's triangle: triangle of Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Euler's triangle: triangle of Eulerian numbers T(n,k) (n>=0, 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-aed75c9f11c92985· 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": { "upper": { "closed": true, "value": "-1" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256d2c10043a5a9ce3149b524bc6ce759c55b838bedec9cad74b0994e59bba5b30c, 12,818 bytes (3,140 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-d6d713aa669b74c1(real_rooted)n-d6d713aa669b74c1(one_signed_coefficients)n-d6d713aa669b74c1(hadamard_kernel)n-d6d713aa669b74c1(interlacing)