Proof step e-2762452c13f28e99

obreschkoff_combination → concludes about obreschkoff_combination of Triangle read by rows: T(n,k) = (4n-4k+1) * T(n-1,k-1) + (4k-3) * T(n-1,k). 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) = (4n-4k+1) * T(n-1,k-1) + (4k-3) * T(n-1,k). (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) = (4n-4k+1) * T(n-1,k-1) + (4k-3) * T(n-1,k). (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 25ccc55ce2b12e024642297b16c871ade5cbfe7ee598ed716b4003e2606dade5, 12,263 bytes (2,705 compressed); download JSON

Cited by

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