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 3n + 1 preceded by n zeros.
- Premises
- shift_x_plus_one of 3n + 1 preceded by n zeros.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of 3n + 1 preceded by n zeros.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-fccaf9105ed5b632· 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" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256d29dca78afce1d3734304b3cff65b7711a8591175defd33c218fa29c22f936a9, 11,763 bytes (2,914 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-f5424c3aafc4063f(real_rooted)n-f5424c3aafc4063f(one_signed_coefficients)n-f5424c3aafc4063f(hadamard_kernel)n-f5424c3aafc4063f(interlacing)