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_A013610 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
- Premises
- basis_map_A013610 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-d4c886dee13c11ec· 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-256159d04605a67f9976f89a504aa01790872aab1b878e134384ce5782ba5049570, 10,765 bytes (2,843 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-66d46e23b1cea6df(real_rooted)n-66d46e23b1cea6df(one_signed_coefficients)n-66d46e23b1cea6df(hadamard_kernel)n-66d46e23b1cea6df(interlacing)