Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of Triangle read by rows, k!*2^k*S_2(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.
- Premises
- Triangle read by rows, k!*2^k*S_2(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0)
- Triangle read by rows, k!*2^k*S_2(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-510ea83375e1f042· 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": { "lower": { "closed": false, "value": "-3" }, "upper": { "closed": false, "value": "-1" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-25600ec1a5d29d7e18c4339e566afcd22a279bb313a9bcb44cf9f6f720be6e5452c, 17,273 bytes (3,372 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-4e118a5f86e56b36(one_signed_coefficients)n-4e118a5f86e56b36(hadamard_kernel)n-4e118a5f86e56b36(interlacing)n-4e118a5f86e56b36(real_rooted)