proposed
reason
Candidate claim vc_223a0874c10e3623 imported from artifact packet cap_61973ee16b553d57
finding type
open_question
proposed confidence
0.99
confidence basis
agent-imported candidate claim; reviewer acceptance required
frontiers / frontier
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Reviewable change
back to reviewErdős Problem #229 has status 'proved (lean)'. Statement: Let $(S_n)_{n \ge 1}$ be a sequence of sets of complex numbers, none of which have a finite limit point. Does there exist an entire transcendental function $f(z)$ such that, for all $n \ge 1$, there exists some $k_n \ge 0$ such that $f^{(k_n)}(z) = 0$ for all $z \in S_n$. This is Problem 2.30 in [Ha74], where it is attributed to Erdős. Solved in the affirmative by Barth and Schneider [BaSc72]. This was formalized in Lean by Alexeev using Aristotle. Topics: analysis, iterated functions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
accept gate
1 of 4 on recordtimeline
vpr_dc43912f90deb183Candidate claim vc_223a0874c10e3623 imported from artifact packet cap_61973ee16b553d57null→06061005vev_fc129b2400a12d54Candidate claim vc_223a0874c10e3623 imported from artifact packet cap_61973ee16b553d57proposed
reason
Candidate claim vc_223a0874c10e3623 imported from artifact packet cap_61973ee16b553d57
finding type
open_question
proposed confidence
0.99
confidence basis
agent-imported candidate claim; reviewer acceptance required
provenance
proposed by
agent:erdos-spine-ingest
actor type
agent
created at
2026-05-30
target type
finding
affected
inspect finding →Erdős Problem #229 has status 'proved (lean)'. Statement: Let $(S_n)_{n \ge 1}$ be a sequence of sets of complex numbers, none of which have a finite limit point. Does there exist an entire transcendental function $f(z)$ such that, for all $n \ge 1$, there exists some $k_n \ge 0$ such that $f^{(k_n)}(z) = 0$ for all $z \in S_n$. This is Problem 2.30 in [Ha74], where it is attributed to Erdős. Solved in the affirmative by Barth and Schneider [BaSc72]. This was formalized in Lean by Alexeev using Aristotle. Topics: analysis, iterated functions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
vf_c18133423f06ef87Read-only frontier; diff not recomputed.
Erdős problems frontier receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.
The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.
Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.
A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.
Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.
Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.