Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver mobius, shift 0

Concludes
mobius_x_over_x_plus_one of basis_map_A008277 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
Premises
Theorem
polytool ?
Lean
RealRooted route fTransform RealRooted.splits_fPolynomial
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-ad1281185d1a923f · JSON
Operation
Image under a real-rootedness preserver
{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 1,
  "region": {
    "lower": {
      "closed": true,
      "value": "-1"
    },
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}
Certificate
preserver_image, SHA-256 c2f7dde555eae7ecaa34a4e2c4ddbc19d6a05f0a3714e83f2a6ac450b66964aa, 8,717 bytes (2,188 compressed); download
polytool replayed the certificate when the step was written.
Cited by