Proof step

Iterated real-rootedness preservers

Theorem check of the sequence's own rule iterated preserver

Concludes: Triangle T(n, k) read by rows: T(n, k)= (m*n-m*k+1)*T(n-1, k-1) + k*(m*k-(m-1))*T(n-1, k) where m = 1.
Premises: none: a direct theorem check
Theorem: [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ?
Lean: RealRooted RealRooted.IsPFPolynomial.generalStep_of_natDegree_le, RealRooted.EulerBidiagonal.generalStep, RealRooted.EulerBidiagonal.comparisonDefect, RealRooted.EulerBidiagonal.generalRowsDep_spec
Checked: polytool replayed · Lean not attempted

Technical details

Step id

e-e4b5b781be9d01fb · 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 250a05f459163decf6dfb5dca5131ab8896b0d4547010ab43b0254734ce7a995, 8,943 bytes (2,112 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.