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_A013609 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, …
- Premises
- basis_map_A013609 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013609 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-7552b95831f8dbdd· 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-256500f2b6287909b60b0b72ff2e59be7720772659cb5b0c34f7f92c52b7d7cd831, 10,018 bytes (2,652 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-ab955e73adb3d5d4(real_rooted)n-ab955e73adb3d5d4(one_signed_coefficients)n-ab955e73adb3d5d4(hadamard_kernel)