Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver mobius, shift 0
- Concludes
- mobius_x_over_x_plus_one of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
- Premises
- Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-52aefaf6833022a0· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-256bf77a9ce1fa91eeab4bf617513237f28594f4b116f5f3bcb297e63800c6b4b26, 9,841 bytes (2,578 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-ae5152aa1415203e(real_rooted)n-ae5152aa1415203e(one_signed_coefficients)n-ae5152aa1415203e(hadamard_kernel)