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 Triangle read by rows: T(n, k) = 2^n * [x^k] hypergeom([-n, -n, 1], [1], x).
- Premises
- Triangle read by rows: T(n, k) = 2^n * [x^k] hypergeom([-n, -n, 1], [1], x).
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: T(n, k) = 2^n * [x^k] hypergeom([-n, -n, 1], [1], x).
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-c6b10d6190de873e· 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\":1,\"first_degree\":2,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-256a2bf643ecd57d3e8ec838a4f5d33e9b2c01552d74444dd6f0377a64a426006a0, 11,088 bytes (2,813 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-18383b729ceef751(real_rooted)n-18383b729ceef751(one_signed_coefficients)n-18383b729ceef751(hadamard_kernel)