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) = C(n+5,5) * C(n,k), 0 <= k <= n.
- Premises
- veronese_section_2_1 of Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- veronese_section_2_1 of Triangle read by rows: T(n,k) = C(n+5,5) * C(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-7ef5306d01c894cd· 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-2568e7ac2be9d0c33edc1b329df89369df09b905875a7af530cc802da134bf97599, 12,410 bytes (3,290 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-b92815c7f855e2d1(real_rooted)n-b92815c7f855e2d1(one_signed_coefficients)n-b92815c7f855e2d1(hadamard_kernel)