Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of basis_map_A013610 of Pascal-(1,2,1) array read by antidiagonals.
- Premises
- basis_map_A013610 of Pascal-(1,2,1) array read by antidiagonals.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of Pascal-(1,2,1) array read by antidiagonals.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-8e43b33b5140c7cc· 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-25611307887259fd459aaa37515386a1d2e33215b10445c34f0038c9b1efaef2ac8, 17,441 bytes (4,699 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-8825354612a48a23(real_rooted)n-8825354612a48a23(one_signed_coefficients)n-8825354612a48a23(hadamard_kernel)