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 T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
- Premises
- Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-dd065961f976b7a9· 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-25622fde31cc8cd82173ab3801d13ede38d333e9c95cbfea0b7112c166c443b9dc0, 9,788 bytes (2,555 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-4c8e9ad9dc69215d(real_rooted)n-4c8e9ad9dc69215d(one_signed_coefficients)n-4c8e9ad9dc69215d(hadamard_kernel)