Proof step e-3568a4fde56c4654
preserver_image mobius, shift 0 → concludes about mobius_x_over_x_plus_one of Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been disting… JSON
Theorem
Affine, reversal and Möbius substitutions (elementary) polytool ?
Lean (RealRooted):
route fTransform
RealRooted.splits_fPolynomial
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}}"
}
Premises
- Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished. (sequence)
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
Claims
- { "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": true, "value": "0" } } }
Verification and certificate
- polytool: replayed (the certificate replayed when the step was written)
- Lean: not attempted
- certificate:
preserver_image, SHA-256ed9f8ee1ad5f56102931f55af50736da113e5d18f7ce2bd5cee8fd4fb76525aa, 7,771 bytes (2,322 compressed); download JSON
Cited by
n-be4c56aa8cc909cd(one_signed_coefficients)n-be4c56aa8cc909cd(hadamard_kernel)n-be4c56aa8cc909cd(real_rooted)