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) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 9*x + 1.

Premises

Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 9*x + 1.
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-c7bc55b480a9c929 · 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 8486baf24b6d5843c70fb768f58b3bfb4994ae89038a27614cf77f2159f9d2d5, 10,697 bytes (2,701 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-dcd2d11144e6ea21 (hadamard_kernel)
n-dcd2d11144e6ea21 (real_rooted)
n-dcd2d11144e6ea21 (one_signed_coefficients)