evidence boundary
supportsfrontiers / frontier
Erdős problems frontier
- id
- vfr_37aec80d874a0239
- license
- CC-BY-4.0
- findings
- 1,256
- accepted core
- 6
- contested
- 0
- links
- 17
- sources
- 1,234
- evidence
- 1,256
- avg conf
- 0.98
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_72651d4c34844be0"}
- id
- vea_ee63733b10370c01
- frontier
- Erdős problems frontier
- source
- vs_d3efef8ceb2e8bf7
- finding
- vf_53c48b5730a23688
finding binding
boundopen_question
Erdős Problem #1041 has status 'falsifiable'. Statement: Let $$ f(z) = \prod_{i=1}^{n} (z - z_i) \in \mathbb{C}[x] $$ with $|z_i| < 1$ for all $i$. Conjecture: Must there always exist a path of length less than 2 in $$ \{ z \in \mathbb{C} \mid |f(z)| < 1 \} $$ which connects two of the roots of $f$? Topics: analysis. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_72651d4c34844be0
vs_d3efef8ceb2e8bf7
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_72651d4c34844be0"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_e98cb97fd71f0531
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_5d27ecdfc5437daffinding.assertedCandidate claim vc_72651d4c34844be0 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_5264f2a7cf65fda5finding.addCandidate claim vc_72651d4c34844be0 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.