Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of shift_x_plus_one of Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
- Premises
- shift_x_plus_one of Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-10b9b38162ca6571· 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": 0, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-256f1e4734710f8d12797d0bb71155d7ad58039aac3969f0d6066685a1636b4730c, 7,856 bytes (2,169 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-ddc69e1dc547b9e6(real_rooted)n-ddc69e1dc547b9e6(one_signed_coefficients)n-ddc69e1dc547b9e6(hadamard_kernel)