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_A013610 of Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).
- Premises
- basis_map_A013610 of Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-b2492b0576153370· 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-2565eeb1af869d87198eaa25e5fed16dec751de46f22523899338a86a02f397b372, 8,183 bytes (2,363 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-37a4a04e19b7ecf6(real_rooted)n-37a4a04e19b7ecf6(one_signed_coefficients)n-37a4a04e19b7ecf6(hadamard_kernel)