Proof step e-06d8b869d62a8f95

preserver_image mobius, shift 0 → concludes about mobius_x_over_x_plus_one of Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n. 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\":2}}"
}

Premises

• Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n. (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 a9dcd6f9cb642ec8311a44863b59d4cb6ccd6f4a38da226d2e54e24aa929763d, 5,313 bytes (1,630 compressed); download JSON

Cited by

• n-061162b1b3be9d7f (real_rooted)
• n-061162b1b3be9d7f (one_signed_coefficients)
• n-061162b1b3be9d7f (hadamard_kernel)