proposed
reason
Candidate claim vc_7649423baf6a25d4 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 #505 has status 'disproved (lean)'. Statement: **Erdős Problem 505** (disproved). Borsuk's conjecture is false for sufficiently large $n$: there exists a dimension $n$ and a bounded set $S \subseteq \mathbb{R}^n$ with positive diameter such that $S$ cannot be covered by $n + 1$ subsets each of diameter strictly less than $\operatorname{diam}(S)$. Erdős [Er44] suspected this. Disproved by Kahn–Kalai [KK93] for $n \geq 2015$. Currently known to be false for $n \geq 64$. A formal proof was formalised by Boris Alexeev using Aristotle. Topics: geometry. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
accept gate
1 of 4 on recordtimeline
vpr_2edea63bf5f31a03Candidate claim vc_7649423baf6a25d4 imported from artifact packet cap_61973ee16b553d57null→1c1b95fdvev_3614b565604c5a1eCandidate claim vc_7649423baf6a25d4 imported from artifact packet cap_61973ee16b553d57proposed
reason
Candidate claim vc_7649423baf6a25d4 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 #505 has status 'disproved (lean)'. Statement: **Erdős Problem 505** (disproved). Borsuk's conjecture is false for sufficiently large $n$: there exists a dimension $n$ and a bounded set $S \subseteq \mathbb{R}^n$ with positive diameter such that $S$ cannot be covered by $n + 1$ subsets each of diameter strictly less than $\operatorname{diam}(S)$. Erdős [Er44] suspected this. Disproved by Kahn–Kalai [KK93] for $n \geq 2015$. Currently known to be false for $n \geq 64$. A formal proof was formalised by Boris Alexeev using Aristotle. Topics: geometry. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
vf_34e3c64c8b737a35Read-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.