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 reversal of Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.
- Premises
- reversal of Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- reversal of Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n.
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-c181ffdd9f997c8e· 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-256c104770ecfd3e3e4a83b9016ff777b6ffdc42ee05e9bccc4509745bf61949e29, 8,906 bytes (2,663 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-c1e56615ee6819d6(real_rooted)n-c1e56615ee6819d6(one_signed_coefficients)n-c1e56615ee6819d6(hadamard_kernel)