Proof step e-ad67990681a86223

preserver_image mobius, shift 0 → concludes about basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals. 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\":1,\"first_degree\":0,\"step\":1}}"
}

Premises

• basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals. (sequence)
  uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]

Claims

• { "claim": "real_rooted", "from_index": 1, "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 4d376af80e5cf8633b4029e45755a1cee8957c4b942885530f59683a62aba2ec, 5,289 bytes (1,592 compressed); download JSON

Cited by

• n-1bf99ad40f056d33 (hadamard_kernel)
• n-1bf99ad40f056d33 (real_rooted)
• n-1bf99ad40f056d33 (one_signed_coefficients)