Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.
- Premises
- Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-fc73adb260396a1d· 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-256e35850ba5450058673e04a65e11fbb864398b39e169304b734bec9163a5d144c, 10,844 bytes (3,005 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-4b03a2849503b9e9(real_rooted)n-4b03a2849503b9e9(one_signed_coefficients)n-4b03a2849503b9e9(hadamard_kernel)