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 Triangle T(n,k) with diagonals T(n,n-k) = binomial(n, 2*k).
- Premises
- Triangle T(n,k) with diagonals T(n,n-k) = binomial(n, 2*k).
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Triangle T(n,k) with diagonals T(n,n-k) = binomial(n, 2*k).
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-c830e34032c85a28· 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\":1,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-25604a21c47a6c602f9a4a989106a8b6c586de45984e4b204e1017f3d591d3e27d7, 10,016 bytes (2,701 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-4d1e2be69e19d889(real_rooted)n-4d1e2be69e19d889(one_signed_coefficients)n-4d1e2be69e19d889(hadamard_kernel)