Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver affine, shift 0

Concludes

Premises

Triangular array binomial(2*n-k, k), k=0..n, n >= 0.
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-64e956c91478ce26 · 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 4cf5f62249ef11ff314fb4703975c8f4aab3188c930cd7a0f64015e426c6be60, 14,133 bytes (3,453 compressed); download

polytool replayed the certificate when the step was written.

Cited by