Proof step e-798bfa3a83d1e4b4

obreschkoff_combination → concludes about obreschkoff_combination of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of… JSON

Theorem

Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?

Operation

Obreschkoff combination Pₙ + Pₙ₊₁

{
  "operation": "obreschkoff_combination"
}

Premises

• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length… (sequence)
  uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length… (sequence)
  uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2

Claims

• { "claim": "real_rooted", "from_index": 1, "region": {} }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: obreschkoff_combination, SHA-256 f5a9e8c794a313105309dec21d6a16c65cb973371f26ca744596efffb5279c37, 14,341 bytes (3,238 compressed); download JSON

Cited by

• n-68458fe983bd99b5 (real_rooted)

References

1. [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
2. [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.