Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of shift_x_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...]…
- Premises
- shift_x_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...]…
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...]…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-c768c550721f3977· 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": 1, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-256c8aae1afcc42c8dc2c3386214e4ca34c10478d87c7d3388056c11ba450a978b1, 8,393 bytes (2,471 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-807e6aacfea7db8a(real_rooted)n-807e6aacfea7db8a(one_signed_coefficients)n-807e6aacfea7db8a(hadamard_kernel)