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) = binomial(n,k)*(n-1)!/(k-1)!.
- Premises
- Triangle read by rows: T(n,k) = binomial(n,k)*(n-1)!/(k-1)!.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: T(n,k) = binomial(n,k)*(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-60b9c88fd5e752c7· 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": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-2560deba2787c50c0d5385fadf1b4edea347854ca604f9511f478f216c734e87a4c, 9,199 bytes (2,506 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-54d11b5bf400eddf(real_rooted)n-54d11b5bf400eddf(one_signed_coefficients)n-54d11b5bf400eddf(hadamard_kernel)