Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver affine, shift 0

Concludes

Premises

reversal of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+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-75cbb85b7fbd3496 · 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"
    }
  }
}

{
  "claim": "interlacing",
  "from_index": 1,
  "kind": "weak",
  "orientation": "unordered"
}

Certificate

preserver_image, SHA-256 2f5d9a4cb77708366aab4b017a97251b1b9312e949285cac00dd81f568032575, 13,001 bytes (3,093 compressed); download

polytool replayed the certificate when the step was written.

Cited by