Proof step e-a929acd24243c7cc

preserver_image mobius, shift 0 → concludes about mobius_x_over_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 … JSON

Theorem

Affine, reversal and Möbius substitutions (elementary) polytool ?

Lean (RealRooted): route fTransform RealRooted.splits_fPolynomial

Operation

Image under a real-rootedness preserver

{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"
}

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)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "lower": { "closed": true, "value": "-1" }, "upper": { "closed": true, "value": "0" } } }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: preserver_image, SHA-256 59084a91236a8faf34551866d998016779117f318decd564441b18ccb90d9d35, 22,366 bytes (5,293 compressed); download JSON

Cited by

• n-33bd4b527bca505e (real_rooted)
• n-33bd4b527bca505e (one_signed_coefficients)
• n-33bd4b527bca505e (hadamard_kernel)