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_0 of Triangular array binomial(2*n-k, k), k=0..n, n >= 0.
- Premises
- veronese_section_2_0 of Triangular array binomial(2*n-k, k), k=0..n, n >= 0.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- veronese_section_2_0 of Triangular array binomial(2*n-k, k), k=0..n, n >= 0.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-d4e88b0216060505· 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-256413b86bd5f09bcde058913d808390da961598e7d23c07b57db1b83765f6e2927, 8,366 bytes (2,201 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-f8c5650f61f7b39f(real_rooted)n-f8c5650f61f7b39f(one_signed_coefficients)n-f8c5650f61f7b39f(hadamard_kernel)