Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver affine, shift 0

Concludes

Premises

T(n,k) = 2^k*binomial(n,2k+1), where 0 <= k <= floor((n-1)/2), n >= 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-7aa8e82847d94a02 · 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 eff3f35bbdccafaef7407a356b13871e2ed229672ea16c352effa970e5fdddaf, 10,034 bytes (2,778 compressed); download

polytool replayed the certificate when the step was written.

Cited by