Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver affine, shift 0

Concludes

Premises

Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Theorem

polytool ?

Lean

RealRooted Polynomial.Splits.comp_of_degree_le_one

Checked

polytool replayed · Lean not attempted

Technical details

Step id

e-8993c0aadbc63b77 · 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 0f76f579316ec41bf6dc3d6e59388ec8be400f1c4a280565f1876134ab6e587f, 10,090 bytes (2,822 compressed); download

polytool replayed the certificate when the step was written.

Cited by