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: (i,j)-th entry is binomial(i,j)*3^(i-j)*8^j.
- Premises
- basis_map_A007318 of Triangle read by rows: (i,j)-th entry is binomial(i,j)*3^(i-j)*8^j.
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: (i,j)-th entry is binomial(i,j)*3^(i-j)*8^j.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-56afb9a2370a95a1· 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-256b2019163d3b53740f71a5d71210bcfee57db18efe2b6f29aaff8c955b694a249, 9,269 bytes (2,686 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-36db20e01be4b1a5(real_rooted)n-36db20e01be4b1a5(one_signed_coefficients)n-36db20e01be4b1a5(hadamard_kernel)n-36db20e01be4b1a5(interlacing)