Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver reversal, shift 0

Concludes

Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).

Premises

Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=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 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-22bf24bbb6b1c2a7 · 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 fe90f55b0fba2b6b29ce867d25f22bb83ec01c15894749b52b8bc179fa87124c, 13,927 bytes (3,094 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-a6f3b35778192ffb (one_signed_coefficients)
n-a6f3b35778192ffb (hadamard_kernel)
n-a6f3b35778192ffb (real_rooted)