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) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.
- Premises
- 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]
- 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-c9745268a055be71· 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-2564e416a8e73e905d9bc9845c8dafaa59e486c299279067810657d97286bfd73b8, 8,350 bytes (2,448 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-bc2e0a7152956095(one_signed_coefficients)n-bc2e0a7152956095(hadamard_kernel)n-bc2e0a7152956095(real_rooted)