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