Erdős Problem #1173
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: set theory, 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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1173 is classified OPEN — MANDATORY CRITICAL in the maintained catalogue.
Assume the generalized continuum hypothesis. Let \(\mu=\aleph_\omega\) (a singular cardinal of countable cofinality) and \(\kappa=\mu^+=\aleph_{\omega+1}\). A set mapping
has \(|f(\alpha)\cap f(\beta)|<\mu\) for every distinct \(\alpha,\beta\). Does there exist a free set \(H\subseteq\kappa\) of cardinality \(\kappa\), meaning for all distinct \(\alpha,\beta\in H\) we have \(\beta\notin f(\alpha)\) and \(\alpha\notin f(\beta)\)? Standard literature may also require \(\alpha\notin f(\alpha)\) for every \(\alpha\); deleting possible self-incidence normalizes it. Crucially, the pairwise \(<\aleph_\omega\) condition does not imply a uniform bound \(<\nu\) for any fixed \(\nu<\aleph_\omega\).
A small example
For the eight-cycle mapping \(f(i)=\{i+1\bmod8\}\), each image has size one and distinct images have intersection zero; \(\{0,2,4,6\}\) is free. Exhaustive search over all \(256\) subsets finds that the largest free set has size four, with two such largest sets. The empty mapping instead makes all eight elements free. This shows that small pairwise intersections do not make the entire finite universe free. It is not a counterexample to existence of a free set of size \(\kappa\) under GCH.
What is known
The maintained catalogue [Va99,7.88], [Ko25b,Problem35] keeps #1173 OPEN, with GCH a genuine assumption. A separate online working report offers partial reductions using Hajnal's free-set theorem and Soukup's essentially-disjoint-family theorem. That report is not a source certified proof by GCL, and it expressly leaves the general cofinal-intersection problem unresolved. Countable cofinality of \(\aleph_\omega\) means naive regular-cardinal uniform-thinning arguments need careful justification. Formal-conjectures issue discussions are not Lean certificates.
GCL's current state
GCL posted an authenticated issue-bound research return and independently reproduced only the explicitly finite checks in ci/erdos_compendium_007_phase20_checks.py. This is an unaccepted editorial explanation, not an independent primary-paper verification or theorem proof.
What remains
Mandatory independent critical review. Obtain original Vardi 1999 and Komjáth 2025 Problem35, compare standard free-set definition, GCH and singular-cardinal hypotheses, then independently review the eight-cycle fixture and the cofinal-intersection obstruction. If investigating the external working report, re-prove its dependence on Hajnal 1960/Soukup 2013 and the exact recursion cardinal bounds instead of citing an unchecked AI argument as a theorem. Require non-author mathematical reviewer and proof-of-source receipts before counting one of the twenty required samples.
The source-status and theorem-strength distinctions must be settled before final protected admission. The cohort still has mandatory independent critical-review obligations.
Sources and claim boundaries
https://www.erdosproblems.com/1173 ; [Va99,7.88],[Ko25b,Problem35]; Hajnal 1960; Soukup 2013 arXiv:1207.1971; https://erdosproblemaday.com/report/1173 (unverified working report).
Phase20 exact receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE20.json. Source-fidelity PENDING; protected publication and V2 NOT ADMITTED.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2444 — 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.