Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.
- Premises
- Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's on the diagonal and 1…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's on the diagonal and 1…
- Theorem
- polytool ?
- Lean
- RealRooted
route
reversedRealRooted.X_pow_mul_reverse_eq_zero_or_splits,RealRooted.reflect_eq_zero_or_splits - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-c418ab35d0c2f0ed· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-2560882912e0d320b86297e13ba35b684f1359249ea1c323dbc2a785a4d434f267f, 11,610 bytes (3,214 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-f24dc5f77f658331(real_rooted)n-f24dc5f77f658331(one_signed_coefficients)n-f24dc5f77f658331(hadamard_kernel)