Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- T(n, k) = Sum_{j=0..n-k} (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)^n. Triangle read by rows, T(n, k) for 1 <= k <= n.
- Premises
- row_factor parent of Triangle read by rows: T(n,k), for k=-n..n-1, is the scaled (by 2^n n!) probability that the sum of n uniform [-1, 1] …
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- row_factor parent of Triangle read by rows: T(n,k), for k=-n..n-1, is the scaled (by 2^n n!) probability that the sum of n uniform [-1, 1] …
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-e03bab4cbe1c5591· 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-256958a6254429e9d427c71eb97cbb6d2f3e86bb2e1acc7602deb1912702d0b4535, 11,998 bytes (3,047 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-3b2b9e31bd278a34(one_signed_coefficients)n-3b2b9e31bd278a34(hadamard_kernel)n-3b2b9e31bd278a34(real_rooted)n-3b2b9e31bd278a34(interlacing)