Erdős Problem #827
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: geometry.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Define \(n_k\) as least N such that EVERY N-point planar set in general position has a k-point subset whose \(\binom{k}{3}\) triples all have pairwise DISTINCT circumradii. All triples are noncollinear; exact general-position conditions (no three collinear vs no four cocircular) must be preserved for both source and problem. Estimate sharp \(n_k\).
A small example
Four points (0,0),(0,1),(1,0),(1,2) have no collinear triples and their squared circumradii for all four triples are exactly 1/2,5/2,5/4,1, all distinct. This is an existence EXAMPLE not a guarantee for every four points. Squared radii compare exactly as rational numbers.
The example can be checked exactly. A finite witness does not replace the universal, asymptotic, or infinitely-often quantifiers in the original question.
What is known
Maintained https://www.erdosproblems.com/latex/827 OPEN for optimal size. Erdős 1978 finiteness argument and proposed bound \(k+2\binom{k-1}{2}\binom{k-1}{3}\) was flawed. Martínez and Roldán-Pensado [MaRo15], Points defining triangles with distinct circumradii, Acta Math Hungar (2015), 136–141, correct and prove \(n_k=O(k^9)\) and \(n_4\le9,\ n_5\le37\) under a weak general position assumption; an independent probabilistic argument in catalogue comments claims \(O(k^5)\), requiring proof readback. Sharp order remains OPEN. Formal \(n_k\) 'exists' is NOT open.
For three noncollinear points \(P,Q,R\) with squared side lengths \(u,v,w\) and twice the signed triangle area represented by determinant \(\Delta\), the squared circumradius is the exact rational expression
Comparing squared radii avoids square roots and numerical tolerances. A concrete four-point sample has four distinct squared radii; this demonstrates possibility, not the universal selection threshold. The corrected 2015 finiteness proof and the newer comment-based \(O(k^5)\) claim have different evidence status.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: open sharp distinct circumradius subset threshold k5 upper. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Implement exact Fraction circumradius-squared oracle and check general position and sample. Inspect 2015 corrected argument and commentary \(O(k^5)\) proof, clarify hypotheses and which full \(n_k\) statements remain open.
Independent critical review must compare the historical primary theorem to the written quantifiers, inspect the exact finite fixture, determine whether a claimed status refers to the whole question or a subcase, and validate the actual rendered mathematical output. No protected admission or formal theorem certification is claimed.
Sources and claim boundaries
- Maintained Erdős problem #827 and its LaTeX/bibliography, read 14 October 2026.
- Authenticated original GitHub source-return record. All original historical bibliography, quantified status limitations and exact source observations are recorded in that return.
- Source theorem proof: PARTIAL and identified where unread. Independent mathematical acceptance: PENDING. Protected merge: NONE. Deployed MathJax: NOT VERIFIED. External Lean certification by GCL: NONE.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2098 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.