Proof step e-934c3fc770862408
preserver_image euler_polynomial, shift 0 → concludes about Triangle read by rows: row n consists of n zeros followed by n+1. JSON
Theorem
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
Lean (RealRooted):
RealRooted.isMultiplierSequence_eval_of_roots_nonpos, RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos, RealRooted.isMultiplierSequence_iff_preserves
Operation
Image under a real-rootedness preserver
{
"index_shift": 0,
"operation": "preserver_image",
"operator": "{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"
}
Premises
- basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals. (sequence)
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
Claims
- { "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "0" } } }
Verification and certificate
- polytool: replayed (the certificate replayed when the step was written)
- Lean: not attempted
- certificate:
preserver_image, SHA-2560580919240a16f002b0ee461822cddec00b7d91f40cd1b7dc3f72d55f1ae3d79, 6,928 bytes (2,007 compressed); download JSON
Cited by
n-d6ec17c5486fb722(real_rooted)n-d6ec17c5486fb722(one_signed_coefficients)n-d6ec17c5486fb722(hadamard_kernel)
References
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.