Proof step

Laguerre’s theorem on differential operators

Image under a real-rootedness preserver derivative polynomial, shift 0

Concludes

one_plus_derivative of basis_map_A013611 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.

Premises

basis_map_A013611 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]

Theorem

[SP14] polytool ?

Lean

RealRooted RealRooted.splits_add_C_mul_derivative_all, RealRooted.splits_C_mul_add_derivative, Polynomial.Splits.derivative

Checked

polytool replayed · Lean not attempted

Technical details

Step id

e-48317c0ca57f97f9 · JSON

Operation

Image under a real-rootedness preserver

{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"
}

Claims

{
  "claim": "real_rooted",
  "from_index": 1,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}

Certificate

preserver_image, SHA-256 2a6e51a6419094193e7b836b83b828674d5e1965e64e2f393337f5f8804e192e, 13,319 bytes (3,621 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-cef261beff6d66d5 (real_rooted)
n-cef261beff6d66d5 (one_signed_coefficients)
n-cef261beff6d66d5 (hadamard_kernel)

References

[SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.