Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of veronese_section_2_0 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) wit…
- Premises
- veronese_section_2_0 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) wit…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- veronese_section_2_0 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) wit…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-38616fc1d403522f· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-256f536c16324943cdd3546c1059be22b54ae81e7c3d7ac0cf4d4ce7a06d184938d, 7,844 bytes (2,331 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-c017c74fc2ad81cd(real_rooted)n-c017c74fc2ad81cd(one_signed_coefficients)n-c017c74fc2ad81cd(hadamard_kernel)