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 read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (…
- Premises
- basis_map_A013610 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-5f9a48ed2f7cde10· 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-256f3a95ea4ebe406983130a46224cd2e082b9d572ddc001c3c9fcaa5f6ab4d2c09, 10,929 bytes (2,921 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-e2a9d8ea2cc2630f(real_rooted)n-e2a9d8ea2cc2630f(one_signed_coefficients)n-e2a9d8ea2cc2630f(hadamard_kernel)n-e2a9d8ea2cc2630f(interlacing)