Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver affine, shift 0

Concludes
shift_x_plus_one of Triangle read by rows, Ward numbers T(n, k) = Sum_{m=0..k} (-1)^(m + k) * binomial(n + k, n + m) * Stirling2(n + m, m), for n >= 0, 0 <= k …
Premises
Theorem
polytool ?
Lean
RealRooted Polynomial.Splits.comp_of_degree_le_one
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-14476b4328e1fa5a · JSON
Operation
Image under a real-rootedness preserver
{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 1,
  "region": {
    "lower": {
      "closed": false,
      "value": "-2"
    },
    "upper": {
      "closed": true,
      "value": "-1"
    }
  }
}
{
  "claim": "interlacing",
  "from_index": 2,
  "kind": "weak",
  "orientation": "unordered"
}
Certificate
preserver_image, SHA-256 ab335b8f22bb0ff42b0d58a7c7c714f3a408eafbe7b0648b1fc2a455a6ab98ec, 17,482 bytes (3,466 compressed); download
polytool replayed the certificate when the step was written.
Cited by