An ordinary proof of the full outer-radius conjecture, including its weighted formulation. Internally reviewed on 21 November 2026; not externally peer reviewed. The documented priority search found no earlier full resolution and records earlier partial results and access limits.
For , define by sending to . If a real polynomial has degree and every root of belongs to , then every root of satisfies
Hence the largest possible root modulus in this class is exactly , attained by . At , this proves the original conjecture for polynomials whose samples at nonnegative integers form a totally positive sequence. The original and weighted statements are one conjecture family.
The proof extends an earlier equal-parameter tridiagonal argument to complex upper-half-plane parameters, then uses Grace–Walsh–Szegő polarization and Hurwitz's theorem to handle arbitrary independent parameters. The real-root bounds follow from positivity and reflection.
- Complete proof.
- Source and priority audit.
- Analysis review and root review.
- Exact algebra verifier: run
python verify.py; all 73 checks pass. - GitHub investigation.
The original source is Anna Vishnyakova, Polynomials interpolated totally positive sequences, arXiv:2607.06207v1, Open Problem 6.2. The weighted source is her Polynomially Deformed Normalized Pochhammer Sequences Having Generating Functions With Only Real Non-positive Zeros, arXiv:2608.03723v1, Open Problem 7.2. Full source links and exact scope are in the audit.
Lean verification
Lean verifies both the original sampled-sequence theorem and the weighted transform-class theorem for every positive degree and positive weight. The original class uses every finite ordered minor of the infinite Toeplitz matrix of the actual polynomial samples. Lean derives the transform condition from these minors, including initial zero samples.
The proof establishes the centered disks and the exact greatest root moduli. For the original class, the disk has center -1/2 and radius n-1/2. The radius n is attained by a polynomial with samples choose(k+n,n). Every finite ordered Toeplitz minor of this extremizer is proved nonnegative.
The formal proof constructs the actual normalized falling-factorial transform. It proves its inverse and degree identity, polarization through polar derivatives, and the recurrence vector for the tridiagonal argument.
All 17 modules passed strict source checks, the complete declaration and axiom audit, and independent stock-kernel replay. The audit covers 439 declarations, including 387 theorem declarations and 172 private declarations. All 66 required endpoints passed. See the verification receipt, original theorem, and weighted theorem. The combined repository gate remains a separate pending check.