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(2*n, k) * binomial(3*n - k, 2*n).
- Premises
- Triangle read by rows T(n, k) = binomial(2*n, k) * binomial(3*n - k, 2*n).
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) = binomial(2*n, k) * binomial(3*n - k, 2*n).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-b2d87ada83badb27· 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-25684bb4742b84727bfb68c42d10eb981453529f2126c544362bba2f272ea837ea1, 8,611 bytes (2,584 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-f721652c141580b8(real_rooted)n-f721652c141580b8(one_signed_coefficients)n-f721652c141580b8(hadamard_kernel)