Proof step e-c52c3082cda5f9b6
preserver_image affine, shift 0 → concludes about basis-map coefficients of Riordan array (1, 3+x). JSON
Theorem
Affine, reversal and Möbius substitutions (elementary) polytool ?
Lean (RealRooted):
Polynomial.Splits.comp_of_degree_le_one
Operation
Image under a real-rootedness preserver
{
"index_shift": 0,
"operation": "preserver_image",
"operator": "{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"-10\"}"
}
Premises
- Riordan array (1, 3+x). (sequence)
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-4/9, 0]
Claims
- { "claim": "real_rooted", "from_index": 1, "region": { "lower": { "closed": false, "value": "86/9" }, "upper": { "closed": true, "value": "10" } } }
- { "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }
Verification and certificate
- polytool: replayed (the certificate replayed when the step was written)
- Lean: not attempted
- certificate:
preserver_image, SHA-25691e0d050f91fee296e96f473e12128806a09674464e4e7cb6118b6afdc6b09df, 19,529 bytes (3,821 compressed); download JSON
Cited by
n-1b374fdc6d596a8d(real_rooted)n-1b374fdc6d596a8d(one_signed_coefficients)n-1b374fdc6d596a8d(interlacing)