Proof step

Iterated real-rootedness preservers

Theorem check of the sequence's own rule iterated preserver

Concludes
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) +…
Premises
none: a direct theorem check
Theorem
[SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ?
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-e01fac3a289a0ac0 · 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 4713c33c61cefd95d85c8e821d138e0e92be74af3d9f637a5e7a244b6b595110, 4,712 bytes (1,381 compressed); download
polytool replayed the certificate when the step was written.
Cited by

References

  1. [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
  2. [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
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.