Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Subject and independence
The reviewer worked in a fresh context from the commissioning assignment
alone, took no part in writing the page or any page in its folder, and was
charged with refutation. The subject is path
wiki/research/erdos_501/glazer_lemma_4_3_reconstruction.md as it stood at
2026-09-28T05:03:27Z, read in full as of that time.
The artifact is the PDF held under the library card Glazer (2026), eight pages whose physical and printed numbers agree. Physical p. 5 was read in full, in the text layer and as page images rendered at 110 and 160 dots per inch; the 160 dpi image was read for every displayed formula of Lemma 4.3 and of Proposition 4.4 (display (4.1), the cardinality display, the intersection display, and (4.2)). Physical pp. 1, 4 and 8 were read in the text layer for the title, the Section 4 preamble that defines supports, and the reference list; the whole text layer was searched for the source's uses of the -system and cofinality notations (the source defines neither).
Allowed material read: the Statement section and the Source paragraph of
the Proposition 4.4 reconstruction
as of the same time, because the page's Boundary paragraph makes a claim about
it; the provenance paragraph of the Glazer card; the "Whole-claim report" and
"Audit checklist" sections of docs/verification.md (the Erdos-specific
sections and the shared "canonical failure modes" list); the "Source fidelity"
section of docs/evidence.md; docs/math_authoring.md in full; and the
Statement paragraph of wiki/problems/set_theory/E0501/_index.md. No other
reconstruction page was read, since the page cites none as an input.
Exposures: three, all incidental and none bearing on the mathematics
checked. The extraction of the card's provenance paragraph also printed the
card's "Bears on" and "Read status" paragraphs and the opening lines of its
Overview; the "Read status" paragraph records what the card's author did
and did not verify. The extraction of the problem page's Statement
paragraph also printed its Status and Source paragraphs, because that page
uses bold run-in labels rather than headings. The Proposition 4.4 page's
Source paragraph was read together with its Statement. No evidence-folder
content, no other review, nothing among the private working files, and no web
search
reached the reviewer; the untracked evidence/verify directory was only
listed by name before this report was written into it.
Restatement
Work in ZFC plus CH. Let be any sequence of countable sets; "countable" includes finite and empty, and the sequence may repeat values. Then there exist a set with , an injective map from into , and one countable set such that for every pair of distinct . No hypothesis beyond CH is used; no large cardinal, no forcing.
Conventions on the page: an indexed family is a -system with root when every two distinctly indexed members meet exactly in ; is the set of ordinals below of cofinality ; is the set of all countable subsets of , finite ones included.
Relation to the source's (4.1), "every family of countable sets has a -subsystem of size ": a set of countable sets, enumerated injectively, is the special case in which the sequence is injective, and then the distinct indices name distinct members. Conversely the sequence form follows from the set form in ZFC: if the sequence takes distinct values apply the set form to them and pull the indices back; otherwise it takes at most values, so by the regularity of one value is taken times, and that constant subsequence is a -system whose root is the value. The page's precise statement is therefore equivalent to the source's, not stronger.
Checklist
- Quantifiers and scope: pass. Every quantifier of (4.1) is preserved; the page's precise form adds only the trivially equivalent sequence reading shown above. The boundary cases of an empty or finite root are covered by the page's stated convention for (see F2), and the case still yields a regressive value because every is positive.
- Circularity: pass. Nothing equivalent to the conclusion is assumed; the argument runs from the chain construction, Fodor's theorem, and CH to the root.
- Model and convention changes: pass with a note. The two conventions the page introduces (indexed -systems and all-countable-subsets ) are stated before use and match what the proof needs; neither substitutes a different object for the source's. F2 asks that the second be marked as a reading of the source's symbol.
- Finite and statistical overreach: inapplicable. No finite case, sample, or heuristic average appears.
- Uniformity: pass. The one uniform object, the stage , is supplied by Fodor's theorem on a stationary set, and the bound depends on nothing but CH.
- Extremal conclusions: inapplicable. The only extremal-flavored claim is the cardinality , rederived under Weakest steps.
- Consequences and composition: one failure outside the proof. Every "so" and "thus" inside the proof was rederived and holds. The Boundary paragraph's consequence sentence, that the supports in Proposition 4.4 are pairwise distinct because each contains its own block, does not follow and is not guaranteed by the source (F1). The page consumes no local claim; Proposition 4.4 is its consumer, not a premise.
- Computation: inapplicable. The page carries no computation or evidence program.
- Reproduction: inapplicable. The page states no rerun command and no coverage claim.
- Source and verdict fidelity: pass for the lemma, fail for the Boundary characterization. The displayed statement is (4.1) word for word, the label "Lemma 4.3 (Generalized -system)" and physical p. 5 are correct, "draft rev10" and "eight-page" agree with the card's provenance, and the Standing paragraph claims only an author-recorded reconstruction. The Boundary paragraph attributes to the source's Proposition 4.4 setup a distinctness the source neither states nor arranges (F1).
Weakest steps
Bounding the root below its stage. Fix . Since , is a limit ordinal, so by continuity . The root is a subset of the countable set , hence countable. For each let be the least stage with . The set is a countable subset of , and a countable subset of an ordinal of uncountable cofinality is bounded in it; let be a bound (any ordinal below when is empty). The chain is increasing, so for every , that is . The map is thus regressive on , which is stationary in the regular cardinal ; Fodor's theorem gives a stationary and a single with on . A stationary subset of is unbounded, and an unbounded subset of a regular cardinal has that cardinal's size, so . This composes with the next step by placing every root , , inside the one set .
The pigeonhole under CH. Every countable subset of is the range of a function or is empty, so . In ZFC,
and CH makes this . The map sends , of size , into a set of size at most . If every fiber had size at most the domain would have size at most , so some fiber has size , and its common value is countable as a subset of . This composes with the root computation by fixing and with for all .
The root identity. Let in . As is a limit ordinal, , so . The ordinal lies in , so , being the value at of the sequence, which lies in . A countable member of is a subset of it: contains a surjection when is nonempty (its transitive closure is countable), so by elementarity contains such an , and for each the value is the unique with , which elementarity places in . Hence and
the last equality because . The injectivity of on holds because while by choice. Together the three steps give the restated conclusion.
Strongest attack
The strongest attack on the proof aimed at collapsing the -system: either two indices of with , so that the "system" repeats one set, or a pair with , which would break the first equality of the root identity. Both fail for the same reason: has cofinality , so and , whereas was chosen outside . A second attack tried to make the chain construction fail at limit stages of cofinality , where a union of models of size might be feared to grow or to lose elementarity; it has size and is elementary by the union-of-chains lemma (a witness to an existential statement with parameters in the union already lies in some link, which is elementary in ). A third attack tried an empty or finite root, where the source's symbol under its common reading would not count ; the page's stated convention counts all countable subsets, and the cardinal bounds those as well, so the count survives (F2 asks only that the reading be marked).
The attack that landed is on the Boundary paragraph. The source's proof of Proposition 4.4 (physical p. 5) chooses "a countable support for " and enlarges it "to contain "; nothing prevents two names from sharing a support. Witness: take for some , both read from a common countable support ; then is a legitimate choice, each contains its own block, and the sets are not pairwise distinct. The page's sentence asserts the distinctness as a fact and gives a reason that does not entail it. The lemma's own statement and proof are untouched, because the page's precise form is indexed and tolerates repetition; only the reconciliation offered in the Boundary paragraph is wrong.
Premises
- Downward Löwenheim--Skolem for and the union-of-chains lemma. Interface used: for every with and there is with and ; and the union of an increasing chain of elementary submodels of is an elementary submodel of . Cited to T. Jech, Set Theory, third millennium edition, Chapter 12. Not held in the library; checked against the reviewer's knowledge of the standard statements, and the union lemma rederived above. Also used, without being named among the imports: is transitive, so membership and " is a function from onto " are absolute, and the surjection lies in for any uncountable (F3).
- Fodor's theorem. Interface used: a function on a stationary subset of a regular uncountable cardinal with for all is constant on a stationary subset of . Cited to Jech, Chapter 8. Not held; standard statement.
- Stationarity of in . Cited to Jech, Chapter 8. Not held; standard statement (for regular the ordinals below of cofinality form a stationary set).
- The identity . A ZFC theorem, rederived above in one line; the page names it as imported without a locator (F4).
- CH, in the form : the lemma's hypothesis.
- The axiom of choice is used to pick and the elementary submodels; the page works in ZFC, as the source does.
- No local claim is consumed. The page has no
depends_onand cites no L-claim; the Proposition 4.4 page is a consumer.
Findings
F1. Severity: required. Location: Boundary, "there the sets are pairwise distinct because each contains its own block ". Defect: the deduction does not follow, and the conclusion is not guaranteed by the source. Containing a private block does not stop two supports from coinciding; a support may contain several blocks. Witness: source physical p. 5, proof of Proposition 4.4, "choose a countable support for and enlarge it to contain ", with two names read from one support , giving . Proposed replacement text: "The lemma is applied in [Proposition 4.4] to the countable supports of names. Those supports need not be pairwise distinct, since two names may share a support; this is why the statement above is given for an indexed sequence and concludes with an injection on indices rather than with distinct sets. The sequence form is equivalent to the source's family form: a family of sets is the injective case, and a sequence with fewer than distinct values repeats one value times, a -system with that value as root."
F2. Severity: suggested. Location: Definitions, " is the set of its countable subsets". Defect: the convention departs from the common reading of the symbol (subsets of size exactly ) and the page does not say that it is a reading of the source's display, nor that the roots may be finite or empty, which is the case the wider convention exists to cover. Witness: source physical p. 5, display "", and the definition two lines above it. Proposed replacement text: " is the set of all countable subsets of , finite and empty ones included (the roots below may be finite); the source's display is read with this convention, under which its count is unchanged."
F3. Severity: note. Location: Proof, "Let be a regular cardinal" and "Two consequences of the setup are used". Defect: the regularity of is a qualification the source does not state ("a sufficiently large "), and the two consequences are proofs the page supplies for facts the source uses without proof; neither is marked as supplied, and the second relies on the transitivity of and on the surjection belonging to , which the Standing paragraph does not list. Witness: source physical p. 5, "Take a continuous increasing chain ... of elementary submodels of a sufficiently large " and "Since is countable and belongs to , it is a subset of ". Proposed replacement text: "Let be an uncountable regular cardinal (regularity is a convenience the source leaves implicit) large enough that the sequence lies in " and "Two consequences of the setup, stated without proof in the source, are used; both rest on the transitivity of ."
F4. Severity: note. Location: Standing, "the cardinal arithmetic ". Defect: the only import without a locator; the identity is a ZFC theorem. Witness: the Standing paragraph itself, against its two other imports, which name chapters. Proposed replacement text: "the ZFC identity (from ; Jech, Chapter 5)".
Verdict
Source fidelity: faithful with corrections. The statement, the label, the physical page, the revision and the proof outline match the artifact; the one required correction, F1, concerns the Boundary paragraph's characterization of the source's Proposition 4.4 setup, not the lemma.
The argument as reconstructed: sound. Every step of the proof was rederived above; no hypothesis is used that the page does not make available, and no imported theorem is applied outside its hypotheses.
Limitations: the imported results are cited to a textbook the library does not hold, so their interfaces were checked against the reviewer's knowledge of the standard statements rather than against a held copy; the Proposition 4.4 page was read only at its Source and Statement sections, so F1 is a finding about this page's sentence and the source's text, not a review of that page. No computation was involved.
This focused review assigns no tier and changes no status.