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_A013609 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
- Premises
- basis_map_A013609 of 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]
- basis_map_A013609 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-513d17e977517ede· 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-256fda576f002f5507644b4761ae5c2f613077c51ace39fcc7e580fbb4c6342fd4d, 10,848 bytes (2,860 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-6014e4c463d6a6b1(real_rooted)n-6014e4c463d6a6b1(one_signed_coefficients)n-6014e4c463d6a6b1(hadamard_kernel)n-6014e4c463d6a6b1(interlacing)