Proof step
Laguerre’s theorem on multiplier sequences
Image under a real-rootedness preserver euler polynomial, shift 0
- Concludes
- theta_plus_one of one_plus_derivative of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< =…
- Premises
- one_plus_derivative of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1<…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- one_plus_derivative of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1<…
- Theorem
- [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ?
- Lean
- RealRooted
RealRooted.isMultiplierSequence_eval_of_roots_nonpos,RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos,RealRooted.isMultiplierSequence_iff_preserves - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-43f5afa97f48ec38· JSON- 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\"]}]}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-25638fb24e3867b0c8732fa7bb6d0ea0c45ba86f3482181890eea5cfbc343840a81, 9,382 bytes (2,490 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-ef68c61660e41606(real_rooted)n-ef68c61660e41606(one_signed_coefficients)n-ef68c61660e41606(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.