Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of theta_plus_one of Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.
- Premises
- theta_plus_one of Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- theta_plus_one of Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-42e5a24a96e3ca74· 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-25623be7234ed3cc859196395c8f9b4d8fa902746fae7cac3e5b1d70a8cb37c40fb, 10,083 bytes (2,376 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-cf6c2be86a6239dc(real_rooted)n-cf6c2be86a6239dc(one_signed_coefficients)n-cf6c2be86a6239dc(hadamard_kernel)