Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver mobius, shift 0
- Concludes
- mobius_x_over_x_plus_one of basis-map coefficients of Triangle read by rows: row n consists of n-1 zeros followed by Fibonacci(n).
- Premises
- basis-map coefficients of Triangle read by rows: row n consists of n-1 zeros followed by Fibonacci(n).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis-map coefficients of Triangle read by rows: row n consists of n-1 zeros followed by Fibonacci(n).
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-ceeda1a209bfa43f· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-2565382a7920d7eb49afe5eb69a4efc2e19f4408835bab876f2459e03b1e05c6c61, 9,476 bytes (2,762 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-e621a5e3fc665a4e(real_rooted)n-e621a5e3fc665a4e(one_signed_coefficients)n-e621a5e3fc665a4e(hadamard_kernel)