Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver mobius, shift 0

Concludes

mobius_x_over_x_plus_one of Triangle read by rows, T(n,k) = (k+1)*(n+1)!*(n+k)!/((k+1)!^2*(n-k)!) with n >= 0 and 0 <= k <= n.

Premises

Triangle read by rows, T(n,k) = (k+1)*(n+1)!*(n+k)!/((k+1)!^2*(n-k)!) with n >= 0 and 0 <= k <= n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Theorem

polytool ?

Lean

RealRooted route fTransform RealRooted.splits_fPolynomial

Checked

polytool replayed · Lean not attempted

Technical details

Step id

e-ce4a58ada30fbec2 · JSON

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}}"
}

Claims

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

Certificate

preserver_image, SHA-256 cce9d790d9ea261da011064eb7ddfdaca8afc14c6402b7b915e043bb485eb389, 10,291 bytes (2,861 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-3f9dac393051c6af (real_rooted)
n-3f9dac393051c6af (one_signed_coefficients)
n-3f9dac393051c6af (hadamard_kernel)