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 T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).
- Premises
- basis_map_A013610 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-6859df88d728c4d6· 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" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-25662b9c074e9f8ae4abc061e194f8f8d7fe06ff2ca42241bdedc97e03ec32c57dc, 11,745 bytes (2,995 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-e0e61e54d312e320(real_rooted)n-e0e61e54d312e320(one_signed_coefficients)n-e0e61e54d312e320(hadamard_kernel)n-e0e61e54d312e320(interlacing)