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