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) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1.
- Premises
- Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-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) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-ccf60822171bc8ef· 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" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256b1b2b0b5f8d0a80fc1ce92e7a9d6e28a3950eb2da39fe99fd9c4a791237456fa, 12,943 bytes (3,127 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-8c995547482f9480(interlacing)n-8c995547482f9480(real_rooted)n-8c995547482f9480(one_signed_coefficients)n-8c995547482f9480(hadamard_kernel)