Real-rooted atlas

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 Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.
Premises
Theorem
polytool ?
Lean
RealRooted route fTransform RealRooted.splits_fPolynomial
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-1acb289ff60ec83d · 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\":0,\"first_degree\":0,\"step\":1}}"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "lower": {
      "closed": true,
      "value": "-1"
    },
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}
Certificate
preserver_image, SHA-256 aff1fff02ef5787e992aa6c8af3f1f2817efb1f9f29f927b7e1e7162a0cf448b, 10,085 bytes (2,743 compressed); download
polytool replayed the certificate when the step was written.
Cited by