Erdős Problem #229
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: analysis, iterated functions.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Let \(S_1,S_2,\ldots\) be a countable sequence of subsets of the complex plane, each without a finite accumulation point. Erdős asked whether there is a transcendental entire function \(f\) and a corresponding sequence of nonnegative integers \(k_1,k_2,\ldots\) such that
The derivative order \(k_j\) may depend on the set index \(j\) but must be common to all points of \(S_j\). Different sets may overlap, and each set may be infinite.
A small example
If \(S_1=\{0,1\}\) and \(S_2=\{2\}\), then a polynomial such as \(z^2(z-1)^2\) has both \(f(0)=f(1)=0\) and a sufficiently high derivative identically zero, but it is not transcendental. Finite interpolation by polynomials therefore misses the most important requirement.
A set such as \(S=\{1,2,3,\ldots\}\) has no finite accumulation point, although it is infinite. A set accumulating at zero, for example \(\{1,1/2,1/3,\ldots\}\), violates the source hypothesis and cannot be inserted into the theorem unchanged.
What is known
PROVED. K. F. Barth and W. J. Schneider, On a Problem of Erdős Concerning the Zeros of the Derivatives of an Entire Function, Proceedings of the American Mathematical Society 32 (1972), 229–232, proved exactly the simultaneous derivative-zero theorem. Their original abstract states that, for an arbitrary sequence of sets having no finite limit point, one can construct a transcendental entire function whose designated derivatives vanish on those sets.
The proof uses repeated polynomial interpolation and approximation on expanding discs. Local finiteness of every \(S_j\) makes it possible to impose the relevant conditions on a finite region during each stage, while keeping the infinite process convergent.
This is not a theorem that one fixed derivative must vanish on the union of all sets. It is also not an unconstrained interpolation theorem on sets with accumulation points: the identity theorem makes those substantially different.
GCL's current state
Pinned and maintained Erdős #229 classify the question PROVED and report an external Lean formalization. Original issue: #1498. The primary 1972 theorem has been identified, but the full analytic proof and formal axiom audit were not independently replayed by GCL.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded task creates examples of finite and infinite locally finite sets, tests detection of finite accumulation points, and constructs polynomials satisfying finite derivative interpolation constraints with exact rational coefficients. Acceptance: all points in each \(S_j\) use a single \(k_j\), a set accumulating at zero is rejected, and finite polynomial fixtures are never presented as a transcendental entire-function construction.
Sources and claim boundaries
- Barth–Schneider (1972), original derivative-zero interpolation theorem.
- Erdős #229, attribution and reported formalization.
- Original issue #1498.
No new interpolation theorem, independently verified complete analytic proof or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1498 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.