Proof step e-a72a60f6dc2c6e62
preserver_image mobius, shift 0 → concludes about Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2. 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: row n consists of n-1 zeros followed by n(n+1)/2. (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-256e2758f8a2b804e1649286358383c1d68d984e66c3b8ff5a685466ccb201dbc06, 7,791 bytes (2,083 compressed); download JSON
Cited by
n-511a2225fa2191c9(one_signed_coefficients)n-511a2225fa2191c9(hadamard_kernel)n-511a2225fa2191c9(real_rooted)