Published November 18, 2026 | Version 1.0

The Kung–Traub Barrier: Sharp Polynomial Information Bounds for Complex Root-Finding

  • 1. Universidad de Valparaiso, Instituto de Matemáticas, Chile

Description

We study the polynomial order of the information available for approximating a simple root of a complex-valued function using n evaluations of the function or its derivatives. Nodes and derivative orders may be chosen from previous responses, without requiring continuity or computability of the rules.

We work with a uniform class of entire functions sufficiently close to the identity and consider their unique distinguished roots in the unit disk. Polynomial order is defined using families of functions that yield the same information and differ from a base function by polynomials of degree at most n.

We prove that, among all causal information procedures using exactly n ≥ 1 evaluations and locally valid on this class, the maximal polynomial information order is 2^(n−1).

For the upper bound, we construct a fixed entire function and polynomial perturbations of degree at most n, whose coefficients tend to zero, that preserve all query responses exactly while separating the roots sufficiently to exclude every larger exponent. The construction uses two systems of polynomial kernels, concentration of Wronskian zeros, and diagonalization.

For the reverse inequality, we construct an explicit information procedure based on inverse Hermite interpolation and establish a uniform bound on the separation of the roots of any two functions in the class yielding identical information, without requiring their difference to be polynomial.

Consequently, the Kung–Traub barrier is attained for the polynomial information order and the mathematical model considered here.

Notes (English)

Historical provenance of the research

The author's earlier investigation of the real case of the Kung–Traub conjecture is documented in surviving manuscripts dated September 17 and 18, 2026. These documents are identified in a historical archive deposited on Zenodo on November 11, 2026 (DOI: 10.5281/zenodo.24147519).

The manuscript by Matthew J. Colbrook, Adversarial Wronskians: A proof of the Kung–Traub conjecture, bears the date September 19, 2026, and its arXiv record identifies September 20, 2026, as the initial submission date.

The dates appearing on the author's real-case manuscripts therefore precede Colbrook's recorded submission date. This chronology documents the development of the author's research but does not, by itself, constitute independent certification of absolute scientific priority.

The complex extension and the bounded-degree polynomial information results presented in this preprint belong to a subsequent stage of the research. Further documentary details are provided in Section 10.3 of the manuscript.

Files

Kung_Traub_Complex_Polynomial.pdf

Files (500.5 kB)

Name Size
md5:8b3a1cb9df86651fbf903dd5dc3949c4
500.5 kB Preview Download

Additional details

Related works