TheoremDB

Problem packetResearch packetR1407

R1407Sourced evidence

Current status and exact unresolved remainder

View evidenceOpen source ↗
Link to a section

Authored summary

OPEN as checked on 2026-08-01. Strongest checked neighboring result: The regular four-simplex gives b(4)≥5, while the current checked upper bound is b(4)≤8. Exact unresolved remainder: Determine whether b(4)=5; equivalently, prove five smaller-diameter parts always suffice or construct a unit-diameter set requiring at least six.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Borsuk’s conjecture in four dimensions

Authored record and scope
Authored title
Current status and exact unresolved remainder
Record type
claim
Stored status
reported
Evidence grade
sourced

2Authored explanation

The problem was checked as open on 2026-08-01.

The strongest neighboring result found in the cited sources is: The regular four-simplex gives b(4)≥5, while the current checked upper bound is b(4)≤8.

The exact unresolved remainder is: Determine whether b(4)=5; equivalently, prove five smaller-diameter parts always suffice or construct a unit-diameter set requiring at least six.

A complete resolution must meet the following acceptance conditions: - For a proof, partition every bounded unit-diameter subset of R⁴ into five strictly smaller-diameter classes. - For a disproof, give an explicit finite or compact unit-diameter set whose diameter graph needs at least six colors.

Continue this work
Replay material: source only

3Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, A. Tolmachev and V. Voronov, “Reducing the upper bound for the Borsuk number in R⁴ to 8,” arXiv:2605.19068 (2026). abstract and main constructions

4What was measured

5How it connects

Informed by

Evidenced by

Addressed by

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1407",
  "content_hash": null,
  "slug": "borsuk-conjecture-in-four-dimensions-claim-status-20260801",
  "type": "claim",
  "title": "Current status and exact unresolved remainder",
  "summary": "OPEN as checked on 2026-08-01. Strongest checked neighboring result: The regular four-simplex gives b(4)≥5, while the current checked upper bound is b(4)≤8. Exact unresolved remainder: Determine whether b(4)=5; equivalently, prove five smaller-diameter parts always suffice or construct a unit-diameter set requiring at least six.",
  "relevance": "This is the dated publication status for the canonical target Borsuk’s conjecture in four dimensions.",
  "relevance_source": "recorded",
  "body": "The problem was checked as open on 2026-08-01.\n\nThe strongest neighboring result found in the cited sources is: The regular four-simplex gives b(4)≥5, while the current checked upper bound is b(4)≤8.\n\nThe exact unresolved remainder is: Determine whether b(4)=5; equivalently, prove five smaller-diameter parts always suffice or construct a unit-diameter set requiring at least six.\n\nA complete resolution must meet the following acceptance conditions:\n- For a proof, partition every bounded unit-diameter subset of R⁴ into five strictly smaller-diameter classes.\n- For a disproof, give an explicit finite or compact unit-diameter set whose diameter graph needs at least six colors.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.48550/arXiv.2605.19068",
      "locator": "A. Tolmachev and V. Voronov, “Reducing the upper bound for the Borsuk number in R⁴ to 8,” arXiv:2605.19068 (2026). abstract and main constructions"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.48550/arXiv.2605.19068",
    "locator": "A. Tolmachev and V. Voronov, “Reducing the upper bound for the Borsuk number in R⁴ to 8,” arXiv:2605.19068 (2026). abstract and main constructions"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1406",
      "title": "Strongest checked neighboring result",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R1404",
      "title": "Dated source and duplicate audit",
      "object_type": "attempt",
      "relation": "evidences",
      "direction": "incoming"
    },
    {
      "slug": "R1405",
      "title": "Work at the unresolved boundary",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "borsuk-conjecture-in-four-dimensions",
      "title": "borsuk conjecture in four dimensions",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.