Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
- Premises
- Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-0065c1899d9bc45a· 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" } } }- Certificate
preserver_image, SHA-256c9ddbf7d5a99f88e457c3b477a8c1337971b34d2dad1e56b3d78d821d2ba5fe0, 7,631 bytes (2,034 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-7f1b09730105c8f0(one_signed_coefficients)n-7f1b09730105c8f0(hadamard_kernel)n-7f1b09730105c8f0(real_rooted)