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_A013610 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
- Premises
- basis_map_A013610 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-294d8fb9d4a59a43· 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": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-2566c5f0f5d9e97ffdbd09be85780ff42b9f75be47b4a2b0e9216f3d53a8b585d70, 11,654 bytes (2,953 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-bbf993cd74f140c5(real_rooted)n-bbf993cd74f140c5(one_signed_coefficients)n-bbf993cd74f140c5(hadamard_kernel)n-bbf993cd74f140c5(interlacing)