Skip to content

Erdős Problem #789

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: additive combinatorics.

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

This is a length-rigidity problem for additive equalities: can a large subset ensure that equal sums use the same number of terms? Repetition is an essential unresolved interpretation in the compact formulation.

Given finite A subset Z with |A|=n, maximize h(n) universally guaranteeing B subset A such that an equality of sums of r and s elements of B implies r=s. The printed catalogue does not explicitly require all summands to be distinct, but its stated bounds h(n)>> (n log n)^{1/3} are incompatible with UNRESTRICTED REPETITION: any distinct positive u,v in B give v copies of u = u copies of v (after dividing by gcd as needed), with unequal lengths. Even B={0} fails (0=0+0). This is a substantive source-normalization hold, not a new disproof of intended problem.

A small example

With unrestricted repetition, the set {2,3} fails because 2+2+2=3+3, although the distinct-subset convention does not have this collision. This single example exposes the necessary source-fidelity distinction.

Finite exact counterfixture: B={2,3}, 2+2+2=3+3 has r=3 vs s=2; B={1,2,3} has 1+2=3 if distinct terms are allowed but different cardinalities. For subsets with at most one use of each member on each side, {2,3} has no distinct-cardinality equality between its different subsets, illustrating the semantic split. In Z, negative and zero elements create further exceptions.

What is known

Maintained https://www.erdosproblems.com/789 OPEN, cites Erdős [Er62c] and Choi [Ch74b] lower (n log n)^{1/3}, and Straus [St66] upper n^{1/2}. These results can only apply under a suitable signed/distinct-summands restriction or other unstated convention. Original [Er65] p.188, [Er73] p.130, and [Er62c]/[Ch74b]/[St66] full proofs NOT independently inspected. Related #786 also highlights repetition ambiguity, so don't infer the original intent without the primary source.

GCL's current state

The original authenticated RESULT/1 source return has historical disposition STATUS_CONFLICT. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.

Source interpretation and unresolved mathematical qualification: Unrestricted repeated positive summands trivialize the additive equation; historical distinct or signed-summand convention needs primary locking.

The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.

What remains

Successor: source-lock original Erdős [Er65] and Straus [St66], define distinct subset-sum cardinality separation precisely (including overlap/common element cancellation and the empty subset), implement finite tests under both conventions, hold all quantitative asymptotic claims until hypotheses matched. Publication of a draft does not resolve the convention mismatch.

Adversarial editorial checking must verify the original theorem hypotheses and examples and later inspect actual HTML/MathJax output. These prerequisites are not discharged by the existence of the draft.

Sources and claim boundaries

  • Maintained Erdős Problem #789 and authenticated source-return record.
  • Pinned teorth/erdosproblems source commit 536408716724a2402bdfa7c1d764bf83d64a8c89 at data/problems.yaml. Primary historical references are identified by their bibliography keys in the original return; any not directly inspected are explicitly unverified.
  • Source review: PARTIAL. Independent mathematical critical review: PENDING. Protected merge: NONE. Public browser MathJax: NOT VERIFIED. GCL theorem certification: NONE.

Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2060 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction