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 Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one …
- Premises
- veronese_section_2_1 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one …
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- veronese_section_2_1 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one …
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-b84262799eaec4db· 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-256a6cca22504e859fdc568837044a0bdf89925ddd424e4d66e5495e627022e8003, 7,282 bytes (1,939 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-203b1f545fb3066f(real_rooted)n-203b1f545fb3066f(one_signed_coefficients)n-203b1f545fb3066f(hadamard_kernel)