Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.
- Premises
- Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.
- 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-47351770721ccd7b· 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-256260a232cc7ca5bd2a9c90ef28762ed80af5a4ff07d548934bc36713bde8d7e14, 10,711 bytes (2,701 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-9c8a3637306e75dc(hadamard_kernel)n-9c8a3637306e75dc(real_rooted)n-9c8a3637306e75dc(one_signed_coefficients)