Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of Triangle T(n,k) read by rows: T(n, k) = (m*n - m*k + 1)*T(n - 1, k - 1) + (9*k - 8)*(m*k - (m - 1))*T(n - 1, k) where m = 0.
- Premises
- Triangle T(n,k) read by rows: T(n, k) = (m*n - m*k + 1)*T(n - 1, k - 1) + (9*k - 8)*(m*k - (m - 1))*T(n - 1, k) where m = 0.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Triangle T(n,k) read by rows: T(n, k) = (m*n - m*k + 1)*T(n - 1, k - 1) + (9*k - 8)*(m*k - (m - 1))*T(n - 1, k) where m = 0.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-75bf6d3fd53731d6· 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": 1, "region": { "upper": { "closed": true, "value": "-1" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256df3d1f32a8f2111348dce87e14f61dcb9ec94bda60cd28011ed7ec078f594e41, 11,895 bytes (3,000 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-a39aac1826daed13(real_rooted)n-a39aac1826daed13(one_signed_coefficients)n-a39aac1826daed13(hadamard_kernel)n-a39aac1826daed13(interlacing)