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(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.
- Premises
- reversal of Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.
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(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-5bb2f0c1937d47cc· 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-25602217393b9f33a4afbd0538f549c8a5b482b2a199d0cbae2db606a292ef91f96, 7,899 bytes (2,337 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-51b406bd20106615(real_rooted)n-51b406bd20106615(one_signed_coefficients)n-51b406bd20106615(hadamard_kernel)