Proof step e-fd8a72d8822c546e

obreschkoff_combination → concludes about obreschkoff_combination of Triangle of increasing mobiles (circular rooted trees) with n nodes and k leaves. JSON

Theorem

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

Operation

Obreschkoff combination Pₙ + Pₙ₊₁

{
  "operation": "obreschkoff_combination"
}

Premises

• Triangle of increasing mobiles (circular rooted trees) with n nodes and k leaves. (sequence)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
• Triangle of increasing mobiles (circular rooted trees) with n nodes and k leaves. (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 e322fede305d6c3d2a9fcc2c3c3fe07aa666c9055debe5bf9679428096070ae4, 13,004 bytes (2,796 compressed); download JSON

Cited by

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