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 T(n, k) read by rows: T(n, k) = (Sum_{i=0..k} (-1)^i * binomial(k, i) * (n+i)^n) * (-1)^k / k! for 0 <= k <= n.
Premises
Theorem
polytool ?
Lean
RealRooted Polynomial.Splits.comp_of_degree_le_one
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-aebc80b0839dd915 · 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": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "-1"
    }
  }
}
Certificate
preserver_image, SHA-256 6c639ff831d7a95726957fcdac7d24fec446a129761fd013556fd50ec7b28841, 7,224 bytes (1,978 compressed); download
polytool replayed the certificate when the step was written.
Cited by