Proof step

Iterated real-rootedness preservers

Theorem check of the sequence's own rule iterated preserver

Concludes: Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.
Premises: none: a direct theorem check
Theorem: [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] 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-801fb19e5a5536e2 · JSON

Operation

Theorem check of the sequence's own rule

{
  "operation": "theorem_check",
  "theorem": "iterated_preserver"
}

Claims

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

Certificate

theorem_check, SHA-256 fefee82c18df7347d2be867a6db3b568cb1aafa0939789c9353b99f0ef02845a, 4,307 bytes (1,469 compressed); download

polytool replayed the certificate when the step was written.

Cited by

References

[Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
[Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
[SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.