TheoremDB

Problem packetWorkR1271

R1271attemptStatus: open strategyEvidence: ReportedReplay: source only

[#R1271] Resolve the stated acceptance condition

View evidenceOpen source ↗

1Summary

Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 96: For each integer $n \geq 3$, let $U_c(n)$ denote the maximum number of unit-distance pairs among all sets of $n$ points in $\mathbb{R}^2$ that form the vertices of a convex polygon. Here, a unit-distance pair means a pair of points at Euclidean distance exactly $1$. Does there exist a constant $C > 0$ such that $U_c(n) \leq C \cdot n$ for all sufficiently large $n$? Equivalently, is it true that $U_c(n) = O(n)$ as $n \to \infty$?

Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 96: For each integer $n \geq 3$, let $U_c(n)$ denote the maximum number of unit-distance pairs among all sets of $n$ points in $\mathbb{R}^2$ that form the vertices of a convex polygon. Here, a unit-distance pair means a pair of points at Euclidean distance exactly $1$. Does there exist a constant $C > 0$ such that $U_c(n) \leq C \cdot n$ for all sufficiently large $n$? Equivalently, is it true that $U_c(n) = O(n)$ as $n \to \infty$? Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.

Reported evidence. Replay readiness: source only.

2Outcome

Replay package: source only

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

Verification source: www.erdosproblems.com ↗, Editorial research route recorded 2026-07-31

3How it connects

Addresses

Recorded for

4Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1271",
  "content_hash": null,
  "slug": "erdos-problem-96-attempt-resolution-route",
  "type": "attempt",
  "title": "Resolve the stated acceptance condition",
  "summary": "Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 96: For each integer $n \\geq 3$, let $U_c(n)$ denote the maximum number of unit-distance pairs among all sets of $n$ points in $\\mathbb{R}^2$ that form the vertices of a convex polygon. Here, a unit-distance pair means a pair of points at Euclidean distance exactly $1$. Does there exist a constant $C > 0$ such that $U_c(n) \\leq C \\cdot n$ for all sufficiently large $n$? Equivalently, is it true that $U_c(n) = O(n)$ as $n \\to \\infty$?",
  "relevance": "For Linear upper bound for unit distances in convex polygons, record erdos-problem-96-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 96: For each integer $n \\geq 3$, let $U_c(n)$ denote the maximum number of unit-distance pairs among all sets of $n$ points in $\\mathbb{R}^2$ that form the vertices of a convex polygon.",
  "relevance_source": "recorded",
  "body": "Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 96: For each integer $n \\geq 3$, let $U_c(n)$ denote the maximum number of unit-distance pairs among all sets of $n$ points in $\\mathbb{R}^2$ that form the vertices of a convex polygon. Here, a unit-distance pair means a pair of points at Euclidean distance exactly $1$. Does there exist a constant $C > 0$ such that $U_c(n) \\leq C \\cdot n$ for all sufficiently large $n$? Equivalently, is it true that $U_c(n) = O(n)$ as $n \\to \\infty$? Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://www.erdosproblems.com/96",
      "locator": "Editorial research route recorded 2026-07-31"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.erdosproblems.com/96",
    "locator": "Editorial research route recorded 2026-07-31"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1272",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "erdos-problem-96",
      "title": "erdos problem 96",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
erdos-problem-96-source-review
Locator
Editorial research route recorded 2026-07-31
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1271
Stable alias
erdos-problem-96-attempt-resolution-route
Projection
Reproduction fields are derived from the immutable record.

A route someone took, recorded so the next person can reuse it or avoid it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.