Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver mobius, shift 0
- Concludes
- mobius_x_over_x_plus_one of Second-order Eulerian triangle T(n,k), 1 <= k <= n.
- Premises
- Second-order Eulerian triangle T(n,k), 1 <= k <= n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Second-order Eulerian triangle T(n,k), 1 <= k <= n.
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-7705cedcc1efa387· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-256df90f67e3c9ea80ca92ec95f3d4664a94806784278d732be494a37a78384b409, 10,960 bytes (2,758 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-affbcb84bac5cb29(real_rooted)n-affbcb84bac5cb29(one_signed_coefficients)n-affbcb84bac5cb29(hadamard_kernel)