Proof step e-aeab44183cd7972d

obreschkoff_combination → concludes about obreschkoff_combination of Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2). JSON

Theorem

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

Operation

Obreschkoff combination Pₙ + Pₙ₊₁

{
  "operation": "obreschkoff_combination"
}

Premises

• Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2). (sequence)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
• Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2). (sequence)
  uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1

Claims

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

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: obreschkoff_combination, SHA-256 1058c5c067854196c0dd4e8daec384039e410e5ad95e61f8bf02ba1f616f8418, 11,359 bytes (2,669 compressed); download JSON

Cited by

• n-6c5e699d59b34d2c (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.