Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver reversal, shift 0

Concludes

Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).

Premises

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

Theorem

polytool ?

Lean

RealRooted route reversed RealRooted.X_pow_mul_reverse_eq_zero_or_splits, RealRooted.reflect_eq_zero_or_splits

Checked

polytool replayed · Lean not attempted

Technical details

Step id

e-9ea110c989c7fe75 · JSON

Operation

Image under a real-rootedness preserver

{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"
}

Claims

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

Certificate

preserver_image, SHA-256 312b0634f7d5885874658f8f199beb8efa2cfc8f0bac8b1dcf10e9b454e3afdd, 8,015 bytes (2,343 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-976cdb6e4a693ec8 (hadamard_kernel)
n-976cdb6e4a693ec8 (real_rooted)
n-976cdb6e4a693ec8 (one_signed_coefficients)