Proof step

Laguerre’s theorem on differential operators

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

Concludes

derivative of veronese_section_2_0 of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.

Premises

veronese_section_2_0 of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.
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-0a5d383273a5eee9 · 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"
    }
  }
}

Certificate

preserver_image, SHA-256 fa85e69911f53aac7c7962d37c37c19bfbc10e96248321a73de6c7ae00ff7e6f, 10,206 bytes (2,624 compressed); download

polytool replayed the certificate when the step was written.

Cited by

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