Real-rooted atlas

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: T(n, k) (0<=k<=2n) is the number of Delannoy paths of length n, having k steps.
Premises
Theorem
polytool ?
Lean
RealRooted Polynomial.Splits.comp_of_degree_le_one
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-94901725fd2b2473 · 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 d2a199f22f13b3f32242f9498ee8e3f2cc5fe52190a76eb4b86ba8f13a93ad49, 9,733 bytes (2,537 compressed); download
polytool replayed the certificate when the step was written.
Cited by