Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.
- Premises
- 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]
- 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-fecb341bf83c7f44· 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-2562dd34d857c19f86a98bbe1e2ee109e32e9b32a38b8cea7132c8738a860e77be3, 8,928 bytes (2,454 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-622af52a4165c278(real_rooted)n-622af52a4165c278(one_signed_coefficients)n-622af52a4165c278(hadamard_kernel)