Proof step
Laguerre’s theorem on differential operators
Image under a real-rootedness preserver derivative polynomial, shift 0
- Concludes
- one_plus_derivative of Triangular array of generalized Narayana numbers T(n,k) = 2*binomial(n+1,k)* binomial(n-2,k-1)/(n+1) for n >= 1 and 0 <= k <= n-1, read …
- Premises
- Triangular array of generalized Narayana numbers T(n,k) = 2*binomial(n+1,k)* binomial(n-2,k-1)/(n+1) for n >= 1 and 0 <= k <= n-1, read by …
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangular array of generalized Narayana numbers T(n,k) = 2*binomial(n+1,k)* binomial(n-2,k-1)/(n+1) for n >= 1 and 0 <= k <= n-1, read by …
- Theorem
- [SP14] polytool ?
- Lean
- RealRooted
RealRooted.splits_add_C_mul_derivative_all,RealRooted.splits_C_mul_add_derivative,Polynomial.Splits.derivative - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-3495b1ceb6c69ff8· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"derivative_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-25650a7f5ef7fae67e20ed012648ea931a793efbd1f40b832d3001e8e053249e4ed, 16,363 bytes (4,250 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-0987851239956860(real_rooted)n-0987851239956860(one_signed_coefficients)n-0987851239956860(hadamard_kernel)
References
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.