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) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).

Premises

Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.
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-6856509712f8e9a8 · 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 e17d46fb5b16f372d3e0ecc341eabde0d034e5f62c3c6ff983bb3e4728e939fe, 18,913 bytes (3,489 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-57b4b14604f4c0d7 (one_signed_coefficients)
n-57b4b14604f4c0d7 (hadamard_kernel)
n-57b4b14604f4c0d7 (real_rooted)