Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of theta_plus_one_squared of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by d…
- Premises
- theta_plus_one_squared of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by d…
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- theta_plus_one_squared of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by d…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-914cdd0f42b18019· 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-256a55419b5211f2f56aac28f0ad3a9f5fa5944f5dbaa255d457e551e2205dcecb1, 8,112 bytes (2,306 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-e5ca1fdc048c33b1(one_signed_coefficients)n-e5ca1fdc048c33b1(hadamard_kernel)n-e5ca1fdc048c33b1(real_rooted)