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_A013611 of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).
- Premises
- basis_map_A013611 of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013611 of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-6bf2133ea5312077· 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-256b4d1357e233cb692157eb635d56c1ced2341775c61b9564a67d54c5d93afe7f1, 14,215 bytes (3,492 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-208323846157519b(real_rooted)n-208323846157519b(one_signed_coefficients)n-208323846157519b(hadamard_kernel)n-208323846157519b(interlacing)