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) (1<=k<=n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1) + (m*k-m+1)*T(n-1,k), where m = 5.

Premises

Triangle read by rows: T(n,k) (1<=k<=n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1) + (m*k-m+1)*T(n-1,k), whe…
sequence: Every row P_n, n >= 0, 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-2f36d3d73da3c287 · JSON

Operation

Image under a real-rootedness preserver

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

Claims

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

Certificate

preserver_image, SHA-256 f81c1e52bba1ad2becc0543aa7c12f33367304e0a952d85625633f44ee6213d7, 10,741 bytes (2,725 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-05516f61aeaea779 (one_signed_coefficients)
n-05516f61aeaea779 (hadamard_kernel)
n-05516f61aeaea779 (real_rooted)