Proof step e-b1f54f3013fcb96b

preserver_image mobius, shift 0 → concludes about mobius_x_over_x_plus_one of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1. 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 T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1. (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 e4e5c4fe4d7d4795c37fe0866e35ab468b803de0ffc15acee2bbae32998b02af, 11,385 bytes (3,053 compressed); download JSON

Cited by

• n-63f4fccd6debb0ee (real_rooted)
• n-63f4fccd6debb0ee (one_signed_coefficients)
• n-63f4fccd6debb0ee (hadamard_kernel)