Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- 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 entries <= 3.
- 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
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-f899d99709094973· 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-2562273eca82ea3747cc25cdda1c94ffb7ab8534deae8cc3ca8c3c52e934d005191, 21,576 bytes (5,142 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-047228a38014e6d4(real_rooted)n-047228a38014e6d4(one_signed_coefficients)n-047228a38014e6d4(hadamard_kernel)