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) = binomial(n+k-1, 2*k-1).
- Premises
- reversal of Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- reversal of Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-6414e717471aa251· 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\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-256b5483f15f8004578a5fb71a3d2ea1a5d2b4794b8fae1c0251a746c824452f719, 8,396 bytes (2,433 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-0dd9ecc6830a7e8b(real_rooted)n-0dd9ecc6830a7e8b(one_signed_coefficients)n-0dd9ecc6830a7e8b(hadamard_kernel)