Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).
- Premises
- T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-a130aa99e3bceb56· 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-256a162f803a39ef88b085c87c638d36bd421c216adbc9100781294f630a5124fa0, 9,412 bytes (2,697 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-eb97e93fd65cf0d3(real_rooted)n-eb97e93fd65cf0d3(one_signed_coefficients)n-eb97e93fd65cf0d3(hadamard_kernel)