Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of one_plus_derivative of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1<…
- Premises
- one_plus_derivative of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1<…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- one_plus_derivative of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1<…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-6a9ddfa19e5c8e04· 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-256abfbe5d27d628d7a5791683d17fb096fb32385fc0c2423dadf4323dec612c441, 7,172 bytes (1,967 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-b70ca67c5fd97364(real_rooted)n-b70ca67c5fd97364(one_signed_coefficients)n-b70ca67c5fd97364(hadamard_kernel)