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 T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.
- Premises
- T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.
- Theorem
- polytool ?
- Lean
- RealRooted
route
fTransformRealRooted.splits_fPolynomial - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-6a2c9a503d8f313d· 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-25669276e3ec7caf1f6242137eea886f6a62d3bb3b52426adfe6a3efe074a3cdfde, 11,057 bytes (2,787 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-148a4e95b74cc241(real_rooted)n-148a4e95b74cc241(one_signed_coefficients)n-148a4e95b74cc241(hadamard_kernel)