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 read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and…
- Premises
- Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-b0f32da5923e1ca2· 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-25647a3ca5c5241b9a13f54475b50f08dd0fbc43b58b5dc66cb01288ad430d7318a, 21,400 bytes (5,111 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-563143c7a3f59683(real_rooted)n-563143c7a3f59683(one_signed_coefficients)n-563143c7a3f59683(hadamard_kernel)