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_A013611 of Pascal-(1,2,1) array read by antidiagonals.
- Premises
- basis_map_A013611 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_A013611 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-b3f720e505431a82· 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-25662ad40d6be21965fceb2eba3a0ececec12d0c7340a238a159d49eccf2c973765, 17,828 bytes (4,719 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-803405d25c4ebcb0(real_rooted)n-803405d25c4ebcb0(one_signed_coefficients)n-803405d25c4ebcb0(hadamard_kernel)