Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- 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
route
reversedRealRooted.X_pow_mul_reverse_eq_zero_or_splits,RealRooted.reflect_eq_zero_or_splits - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-d0cb16645a9ff13d· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":2,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-2561303cf4421795e44c64ff14a71c6a41547011ce48c750fbff6b83c3053947edb, 10,469 bytes (2,497 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-b002679da3d71a0f(real_rooted)n-b002679da3d71a0f(one_signed_coefficients)n-b002679da3d71a0f(hadamard_kernel)