Erdős Problem #701
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: combinatorics, intersecting family.
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
Chvátal's conjecture, Erdős #701 concerns a family F of subsets of a finite nonempty set X that contains every subset of each of its members. Does some element x occur in at least as many members of F as the size of ANY intersecting subfamily of F? The conjecture remains OPEN for arbitrary downsets.
A small example
Take all eight subsets of X={1,2,3}. The four sets containing element 1 form an intersecting star. The eight subsets can be partitioned into four complementary pairs A and X\A; an intersecting family cannot contain both members of a complementary pair. Thus no intersecting subfamily can exceed four, and the star reaches the maximum. This does not settle general downsets.
What is known
Chvátal proved a related theorem under a stronger shifted family closure condition, not just downward closure. Sterboul proved another structured class, and Frankl–Kupavskii established cases with covering number two. The individual hypotheses matter; they cannot be dropped to announce a general proof. The pinned 701.lean encodes the general conjecture via lower sets and intersecting subfamilies, but its theorem body still contains a proof hole.
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: chvatal general downset open; shifted and cover2 special cases not general; pinned fc sorry. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Inspect the exact historical Chvátal, Sterboul and Frankl–Kupavskii theorem pages. Establish a precise structural lemma for a specified shifted family, then check whether its closure assumptions can extend to arbitrary downsets. Full editorial critical review, protected publication, deployed mathematical typesetting and V2 admission remain outstanding.
Sources and claim boundaries
Maintained #701; pinned #701 formal file; authenticated original source return. Full original proof text not inspected; no novel general theorem, protected merge or V2 editorial admission.
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: #1972 — 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.