Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of derivative of Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
- Premises
- derivative of Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- derivative of Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-cb3ffcd488a36d44· 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-2561d347d2ad5df5cc85169c49a2f85917ea6738f5881c9359f037e8b6788bebaf8, 7,015 bytes (2,071 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-2b8510f8f6f9afcd(real_rooted)n-2b8510f8f6f9afcd(one_signed_coefficients)n-2b8510f8f6f9afcd(hadamard_kernel)