Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- basis_map_A007318 of Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(…
- Premises
- Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0)
- Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-99c0d8e32864a223· 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": { "lower": { "closed": false, "value": "-3" }, "upper": { "closed": false, "value": "-1" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-2564be20e7126556f3e613fcf4bb8efd58d6dd09dd6029a3ded7034a4f7aab8d122, 16,537 bytes (3,273 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-4a57e8264fe984f4(one_signed_coefficients)n-4a57e8264fe984f4(hadamard_kernel)n-4a57e8264fe984f4(interlacing)n-4a57e8264fe984f4(real_rooted)