Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- reversal of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).
- Premises
- Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).
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(2n+1, 2k+1).
- 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-77dbb4f6441b1163· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-256a9759c86281dbb8914639692fd6933257fba8ed1b5f390b9ac2caaf65d08c652, 13,661 bytes (3,202 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-fe90ba2487d0ea92(real_rooted)n-fe90ba2487d0ea92(one_signed_coefficients)n-fe90ba2487d0ea92(hadamard_kernel)