Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- shift_x_plus_one of basis_map_A013609 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
- Premises
- basis_map_A013611 of 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]
- basis_map_A013611 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
- Theorem
- polytool ?
- Lean
- RealRooted
route
reversedRealRooted.X_pow_mul_reverse_eq_zero_or_splits,RealRooted.reflect_eq_zero_or_splits - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-37e809fbc9c74eeb· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-256b8c07080a82d0acbbca932b17492ff819d794416215e1d8fd47f2a7c6317fb6f, 9,555 bytes (2,557 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-a0bec09b71e3cb85(one_signed_coefficients)n-a0bec09b71e3cb85(hadamard_kernel)n-a0bec09b71e3cb85(real_rooted)