Proof step e-32ad399df63f844d
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\":\"-5\"}"
}
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": "5" } } }
- { "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-256706ea019b2eae3550a15e234d8eed422715d15d42aab3df24ba82233fb501807, 19,308 bytes (3,773 compressed); download JSON
Cited by
n-3f406ce82de8647a(real_rooted)n-3f406ce82de8647a(one_signed_coefficients)n-3f406ce82de8647a(interlacing)