Proof step

Laguerre’s theorem on differential operators

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

Concludes

derivative of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.

Premises

Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
sequence: Every row P_n, n >= 0, 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-52998f866033e3b0 · JSON

Operation

Image under a real-rootedness preserver

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

Claims

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

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

Certificate

preserver_image, SHA-256 d932049ade6841626b706dee37b1f92531fc24c0c823cde19374c1c21121d6f9, 12,492 bytes (3,065 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-c0d162a3ff50a265 (real_rooted)
n-c0d162a3ff50a265 (one_signed_coefficients)
n-c0d162a3ff50a265 (hadamard_kernel)
n-c0d162a3ff50a265 (interlacing)

References

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