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 T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).
- Premises
- T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-97db3bd73c62b68d· 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-25625b6effa02cbe67d2eacea4af42c105e5e262f4038be85b11f8d544c3bf4764e, 9,934 bytes (2,822 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-0b806d8871f729f4(real_rooted)n-0b806d8871f729f4(one_signed_coefficients)n-0b806d8871f729f4(hadamard_kernel)