Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver reversal, shift 0

Concludes
Triangle read by rows: Eulerian numbers of type B, T(n,k) (1 <= k <= n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (2*n - 2*k + 1)*T(n-1, k-1) + (2*k -…
Premises
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-6929bfa29b783dac · 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 0fb43f225beded7228e35f75ff2f940ca6a8c1ef132390e4334285b84a2c1ede, 10,764 bytes (2,742 compressed); download
polytool replayed the certificate when the step was written.
Cited by