Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver affine, shift 0

Concludes
shift_x_plus_one of shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
Premises
Theorem
polytool ?
Lean
RealRooted Polynomial.Splits.comp_of_degree_le_one
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-4d87134aee2d8957 · 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": {
    "upper": {
      "closed": true,
      "value": "-1"
    }
  }
}
{
  "claim": "interlacing",
  "from_index": 2,
  "kind": "weak",
  "orientation": "unordered"
}
Certificate
preserver_image, SHA-256 d2265399dcbd87e646f72bfba02f7590d96e446004ccdb2ec9eb8af4a4960cee, 9,259 bytes (2,666 compressed); download
polytool replayed the certificate when the step was written.
Cited by