Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of veronese_section_2_1 of Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).
- Premises
- veronese_section_2_1 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]
- veronese_section_2_1 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-5e7dd876c5ce9c5b· 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-2562ed1c932ffe7fe93aecdde9bb7e7acbe326b30cad78319f46ecaa6da2caa6bad, 7,617 bytes (1,917 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-93e1012722d95429(real_rooted)n-93e1012722d95429(one_signed_coefficients)n-93e1012722d95429(hadamard_kernel)