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_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) …
- Premises
- basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1…
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1…
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-b294c260ff019fd1· 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-256f50f2e73a12545c05ca5b8df0387b77c17a1ce8d172631140eb1039851f1b536, 12,130 bytes (3,268 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-11a41503366af691(real_rooted)n-11a41503366af691(one_signed_coefficients)n-11a41503366af691(hadamard_kernel)