Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of basis_map_A013610 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.
- Premises
- basis_map_A013610 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-c1f6fabb2f11e287· 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-256fd4ca0b1573e064711714ef5a66875ebd5fb0a2dae8dd8848b5301dd25041fbd, 10,727 bytes (3,075 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-17928b55173ac06a(one_signed_coefficients)n-17928b55173ac06a(hadamard_kernel)n-17928b55173ac06a(real_rooted)