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_A007318 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
- Premises
- basis_map_A007318 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-2, -1)
- basis_map_A007318 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-e65e097d166f9cf4· 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": { "lower": { "closed": false, "value": "-3" }, "upper": { "closed": false, "value": "-2" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256571cdf6a337d2730507ab6f2dc4055e43b3ea57723dd4b18bd42d5729b06f158, 20,568 bytes (3,833 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-abad200ec25a15c5(real_rooted)n-abad200ec25a15c5(one_signed_coefficients)n-abad200ec25a15c5(hadamard_kernel)n-abad200ec25a15c5(interlacing)