Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- basis_map_A007318 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
- Premises
- T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-1, 0)
- T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-82fe4ff3bda4d8ff· 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": { "lower": { "closed": false, "value": "-2" }, "upper": { "closed": false, "value": "-1" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256080ca78540edd804b146095772ef9e4ed4a197efee34213cd72dde983e079308, 20,317 bytes (3,614 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-0444a4f352052985(one_signed_coefficients)n-0444a4f352052985(hadamard_kernel)n-0444a4f352052985(interlacing)n-0444a4f352052985(real_rooted)