Proof step e-f73e26dac50fbf3d
preserver_image affine, shift 0 → concludes about basis-map coefficients of Riordan array (1+2x,x(1+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\":\"-3\"}"
}
Premises
- Riordan array (1+2x,x(1+x)). (sequence)
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-4, 0]
Claims
- { "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": false, "value": "-1" }, "upper": { "closed": true, "value": "3" } } }
- { "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-25620f81b317223a2aab5566929da949684cb75ed7ceb965832896e2915f1367f46, 19,311 bytes (3,771 compressed); download JSON
Cited by
n-87e7c3f73bb81aac(interlacing)n-87e7c3f73bb81aac(real_rooted)