Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.
- Premises
- Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-57e13f12f313687f· 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-256e67419371e1f191965d4e25aed54593f2adfea222c2cfa8151ce78d7d2932e64, 19,221 bytes (4,095 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-85a14e0b559789f0(real_rooted)n-85a14e0b559789f0(one_signed_coefficients)n-85a14e0b559789f0(hadamard_kernel)n-85a14e0b559789f0(interlacing)