Proof step e-19ec7bcbd5a09ffd

obreschkoff_combination → concludes about obreschkoff_combination of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n. 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) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n. (sequence)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
• Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n. (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 94f0fef1ed890226f509be2fc661813265b1145b2d231ca39479c4b6c15fbd4c, 11,357 bytes (2,667 compressed); download JSON

Cited by

• n-9f81ae11556c47a0 (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.