Proof step e-5fe876e73621d007
preserver_image mobius, shift 0 → concludes about mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) = (k+1)^2*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) = (k+1)^2*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-256f2d15854e4d6064819d9af72c4a10b59d7b0e8e3ff69966310bda8f73566468e, 7,814 bytes (2,136 compressed); download JSON
Cited by
n-8c39fb67b0147cfb(real_rooted)n-8c39fb67b0147cfb(one_signed_coefficients)n-8c39fb67b0147cfb(hadamard_kernel)