Proof step e-b4aa148b93b9dcb2
preserver_image affine, shift 0 → concludes about basis-map coefficients of Riordan array (1, 3+3x). 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\":\"-8\"}"
}
Premises
- Riordan array (1, 3+3x). (sequence)
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-4/3, 0]
Claims
- { "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": false, "value": "20/3" }, "upper": { "closed": true, "value": "8" } } }
- { "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }
Verification and certificate
- polytool: replayed (the certificate replayed when the step was written)
- Lean: not attempted
- certificate:
preserver_image, SHA-256a0536bbb0269b95a5e704c3ce904a62e4116b0f16d3374ab9999111a550e92e6, 19,438 bytes (3,787 compressed); download JSON
Cited by
n-b2ac077f0522ccfd(real_rooted)n-b2ac077f0522ccfd(one_signed_coefficients)n-b2ac077f0522ccfd(interlacing)