Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_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
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-2bd92cd6cc3ac96b· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-2563ed250e5ca0e26d0748c1dbc839c9f595b3d059e8e9004fb5a4b9f86bd414a34, 7,835 bytes (2,307 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-91f8c3beb9aeb119(real_rooted)n-91f8c3beb9aeb119(one_signed_coefficients)n-91f8c3beb9aeb119(hadamard_kernel)