Proof step

Laguerre’s theorem on differential operators

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

Concludes

one_plus_derivative of Triangle T(n, k) read by rows: T(n, k) = (Sum_{i=0..k} (-1)^i * binomial(k, i) * (n+i)^n) * (-1)^k / k! for 0 <= k <= n.

Premises

Triangle T(n, k) read by rows: T(n, k) = (Sum_{i=0..k} (-1)^i * binomial(k, i) * (n+i)^n) * (-1)^k / k! for 0 <= k <= n.
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-3f8f809bdc2f95ed · 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": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}

Certificate

preserver_image, SHA-256 f16e20163bfd84085a6c3e2705015e8dbfe54756f9e300c00631ec9e801fe9bb, 8,694 bytes (2,282 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-feabd47ffc664156 (real_rooted)
n-feabd47ffc664156 (one_signed_coefficients)
n-feabd47ffc664156 (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.