Proof step e-2f364a7cea083c6e
preserver_image mobius, shift 0 → concludes about mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n. 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 read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n. (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-256833124ac352eeb095d4dede905b4f20aec5f3528020dce83b987ec5fee1d5a59, 11,419 bytes (3,274 compressed); download JSON
Cited by
n-f46004fe8e249122(real_rooted)n-f46004fe8e249122(one_signed_coefficients)n-f46004fe8e249122(hadamard_kernel)