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,m) = binomial(2*n,2*m) * binomial(n,m).
- Premises
- Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-3b81a934057a3d13· 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-256844fa2d309a4f3b525b1853329d453f3efaf46ade5ec453d8847aa31d6ab4885, 10,291 bytes (2,547 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-6173bcfb68499f9c(real_rooted)n-6173bcfb68499f9c(one_signed_coefficients)n-6173bcfb68499f9c(hadamard_kernel)