Proof step e-fea99146cab206a8
preserver_image affine, shift 0 → concludes about basis_map_A007318 of Triangle T(n, k) = coefficients of p(x, n) where p(x,n) = (x+1)*p(x, n-1) + n*(n-1)*x*p(x, n-2), read by rows. 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\":\"1\"}"
}
Premises
- Triangle T(n, k) = coefficients of p(x, n) where p(x,n) = (x+1)*p(x, n-1) + n*(n-1)*x*p(x, n-2), read by rows. (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": { "upper": { "closed": true, "value": "-1" } } }
- { "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-256dd59f546736512d4ec856574f5825c094b545622967db667d99629f75379d9e1, 13,832 bytes (3,318 compressed); download JSON
Cited by
n-3ca9019ed589d9c3(one_signed_coefficients)n-3ca9019ed589d9c3(hadamard_kernel)n-3ca9019ed589d9c3(interlacing)n-3ca9019ed589d9c3(real_rooted)