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: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1).
- Premises
- Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-43a96831412e78bb· 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-2569e9d390727c9117c627a0f36f38c363f2a6af21191dd1710f4fc8abb987a1bb3, 9,353 bytes (2,532 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-227b620650ca6bf3(real_rooted)n-227b620650ca6bf3(one_signed_coefficients)n-227b620650ca6bf3(hadamard_kernel)