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 of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).
- Premises
- Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-1, 0)
- Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-a640ab33da21403a· 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": "-2" }, "upper": { "closed": false, "value": "-1" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256eefed648ba4fb88016ea759a808a7f1ff188adfcbd71564d8e0c3a7adce1601f, 17,190 bytes (3,354 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-9cb46fc45f534e25(real_rooted)n-9cb46fc45f534e25(one_signed_coefficients)n-9cb46fc45f534e25(hadamard_kernel)n-9cb46fc45f534e25(interlacing)