Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).
- Premises
- reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- reversal of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-6b54788a23565e9e· 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" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256a831295bb8ec7601d603c76f37de65f7562a0f8e3998c26788b584992af71501, 22,101 bytes (5,660 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-0248ad0b5ffb0432(real_rooted)n-0248ad0b5ffb0432(one_signed_coefficients)n-0248ad0b5ffb0432(hadamard_kernel)n-0248ad0b5ffb0432(interlacing)