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 Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).
- Premises
- basis_map_A007318 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A007318 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-1c6f6cde901894f2· 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" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256ecb7ac2898d4a39bba7c0c50854660d2847bb1f7bad50314dd5e17ea1445d771, 17,804 bytes (4,136 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-c7b2a4255e084d17(real_rooted)n-c7b2a4255e084d17(one_signed_coefficients)n-c7b2a4255e084d17(hadamard_kernel)n-c7b2a4255e084d17(interlacing)