Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Subject and independence
Role: independent reviewer in a fresh context, commissioned to refute one page and given only the assignment. The reviewer took no part in writing the page, the lemma or corollary reconstructions, the result pages or the library cards, read no other review of any of them, and had no contact with their author.
Subject: path wiki/research/erdos_1219/theorem_1_2_reconstruction.md as it
stood at 2026-09-28T05:03:27Z,
the page, read in full as of
that time.
Artifact: the scan held by
Shelah (1975),
shelah_1975_notes_partition_calculus.pdf, twenty pages without a text
layer (text extraction of PDF p. 4 returns only the archive stamp). Page
images rendered and read: PDF pp. 2--5 (printed pp. 1258--1261) at 150 dpi;
PDF p. 4 (printed p. 1260) at 300 dpi, with three crops covering the
statement, the proof and the corollary with its Remark; PDF pp. 19--20
(printed pp. 1275--1276, the reference list) at 130 dpi. Depth: printed
p. 1260 read word by word, every displayed formula included; printed p. 1258
(the statement of Lemma 1.1, its Remark and the first sentence of its proof)
read clause by clause; the reference list read for entries [1] and [4];
PDF pp. 3 and 5 (printed pp. 1259 and 1261) were rendered but not read.
Second artifact: the PDF held by
Komjáth (2025),
PDF p. 25 (printed p. 442), extracted with a text layer and rendered at
110 dpi, read in full for the commentary on Problem 53.
Allowed material read, all as of 2026-09-28T05:03:27Z: the Source, Definitions
and Statement sections of
the Lemma 1.1 reconstruction
(lines 1--28 and 35--163; its Standing paragraph and proof were not read);
the Source, Definitions and Statement sections of
the Corollary 1.3 reconstruction
(lines 1--33 and 39--78; its Standing paragraph and proof were not read); the
Statement section of the result page
theorem_1_2
(lines 1--57: statement, reading note, source and read-depth paragraphs);
lines 84--102 of the Shelah card; lines 1--53 of the Komjáth card; the
Statement paragraph of Problem 1219 (lines
13--24); docs/verification.md, the sections "Audit checklist -- the
canonical failure modes", "Whole-claim report" and "Audit checklist";
docs/evidence.md, the section "Source fidelity"; docs/math_authoring.md
in full.
Exposures: two, both incidental and unused. (1) While locating the Shelah card's provenance line the reviewer also read the card's read-status paragraph (lines 93--101), which records reading depth and says that nothing on the card is independently reviewed. (2) The Komjáth card has no paragraph headed provenance; the search for its source line read the card's citation and digest paragraphs (lines 16--51), one sentence of which characterizes the survey as the acceptance record for Problem 1219. The review of Komjáth (2025) below rests on the page image of printed p. 442 alone. No evidence folder, folder index, assessment, status or standing text, other review, workspace file or web search was consulted.
Restatement
Let be an infinite cardinal and . Hypotheses: (i) , that is, every two-coloring of the two-element subsets of a set of size has a subset of size all of whose pairs have one color; (ii) the sequence , indexed by the cardinals below , is not eventually constant: for every cardinal there is a cardinal with and , hence ; (iii) the sequence is eventually : there is a cardinal with for every cardinal with . The source prints (iii) with in place of ; the page adopts the result page's reading and says so. Conclusion: with , the cardinal sum over all cardinals below , the finite ones included, every has with and constant on ; and moreover every has a set of size homogeneous in color , or one of size homogeneous in color , or one of size homogeneous in color .
Convention: is the ordinary partition relation for pairs, a homogeneous set of size in color for some ; the underlying set may be any set of size , and a homogeneous set of size at least contains one of size exactly . Scope facts that the page proves and this review confirmed: under (i)--(iii), , so is singular, and .
Checklist
- Quantifiers and scope. Pass. The two "eventually" clauses are defined with explicit quantifiers and used in that form (Step 1 fixes and applies the negation of eventual constancy to ). The index set of is stated, and is proved in both directions. Boundary cases: is excluded by the supplied preliminary; cannot satisfy (iii); the block has and , both handled. No shift from "almost all" to "all".
- Circularity. Pass. The target relation is never assumed; (K) is a hypothesis about , not about ; (ER), (S) and (EDM) are external and named as imported.
- Model and convention changes. Pass. The passage from to the pairs of is proved (Step 2(c)--(d)); transport of colorings along bijections is stated in the Definitions; Lemma 1.1 is invoked with , and the property , an interface that matches the lemma reconstruction's Definitions and Statement clause by clause and the printed statement on p. 1258.
- Finite and statistical overreach. Inapplicable: no finite cases, samples or averages appear.
- Uniformity. Pass. The bounds over the family are , (Step 1) and (Step 5); each is proved for every , not from instances, and no constant depends on an unstated parameter.
- Extremal conclusions. Pass. , and are computed in cardinal arithmetic with both inequalities shown; the suprema in Steps 1, 2 and 7 are proved equal, not asserted.
- Consequences and composition. Pass, with one labeling finding (F1). Every "so" and "hence" was re-derived (see Weakest steps). The lemma's four hypothesis groups (regularity and sizes, growth, , (H)) are supplied at the strength the lemma reconstruction's statement demands; the three-color form is composed from the two-color form and (EDM) and is labeled supplied.
- Computation. Inapplicable: the page has no computation.
- Reproduction. Inapplicable: the page states no rerun command or coverage claim.
- Source and verdict fidelity. Faithful with corrections. The statement, the locators (printed p. 1260 is PDF p. 4; the source's [4] is Erdős, Hajnal and Rado (1965), printed p. 1275; Komjáth's p. 442 is PDF p. 25) and the two recorded readings were verified on the page images. One reading in Step 4 is not recorded (F1); the characterization of the Komjáth page is loose (F4); the Sierpiński citation covers, to the reviewer's knowledge, only the countable case (F3).
Weakest steps
1. Step 5: the arithmetic hypotheses of Lemma 1.1. The source asserts that the lemma applies; the page supplies the check, and it is the step on which the whole application rests. Re-derivation. is regular and , so every is bounded by some ; for fixed there are at most such , and there are choices of , so ; the reverse inequality is trivial. For and , gives , so
using ; the empty product is . And because . Both bounds need , which Step 1 can arrange only because : if no cardinal is . The supplied preliminary closes exactly this gap. Composition: without these bounds Lemma 1.1 is unavailable and Step 6 has no sets .
2. Step 4: both colors inside every large subset of a block. This is where the corrected hypothesis (iii) and the imported (ER) are consumed, and where the lemma's (H) is really established. Re-derivation. Fix and with . (ER) with , infinite because , applied to on , gives with either and on , or and on . Since and (hypothesis (iii) through ), the first alternative is a homogeneous subset of one block of size at least , which (N) excludes; so the second holds and any of size serves. The same with gives . Composition: for with , has because is infinite, and holds with , ; depends on alone, so the earlier admissible sequence and the later points are irrelevant, and (H) holds. The printed proof places the two sets in rather than in the arbitrary ; the page's claim carries the reading the lemma needs (F1).
3. Step 7: . The source states it in one clause. Re-derivation. The sets () lie in the pairwise disjoint blocks , so by the sum formula ( infinite, every term ). A subset of of cardinality is unbounded in , since a bounded subset lies inside an ordinal with ; the increase; hence , the last equality from and in Step 1. So . Composition: together with the homogeneity check, which splits into the within-block case ( on ) and the cross-block case (), witnesses .
Strongest attack
The strongest attempt aimed at the application of Lemma 1.1, from two sides. First, the lemma's hypothesis (H) demands a set of size at most inside an arbitrary of size , for every admissible earlier sequence and every choice of later points, while the printed proof exhibits sets inside only. The attack fails against the page: the Step 4 claim is stated and proved for every of size , depends on alone, and has size exactly . What remains is a labeling gap, not a mathematical one (F1). Second, the lemma's arithmetic hypotheses: the attack searched for parameters satisfying (i)--(iii) with or . If , then is impossible and can fail. The page's preliminary shows that contradicts (i) and (iii): a cardinal with is infinite (a finite has finite ), (S) gives a two-coloring of a set of size with no homogeneous set of size , and its restriction to a subset of size refutes . With the recursion places and the growth bound follows as in Weakest step 1. A third attack targeted the reading of the printed bound: with "eventually " and for all , , , all three hypotheses hold as printed, , and fails (partition into pieces of size below and color a pair by whether it lies inside one piece: a homogeneous set of the first color lies in one piece, one of the second color meets each piece at most once). So the printed bound cannot be what the proof proves, and the bound the proof uses, , is the reading the page adopts. A fourth attack, on the imported (ER), ended in the reviewer's own derivation of the relation (Premises) rather than a refutation. Every attack on the mathematics failed.
Premises
- Lemma 1.1 (the reconstruction in this folder), consumed through its Definitions and Statement as of 2026-09-28T05:03:27Z; its proof and its standing were outside the commissioned read set and are not recorded here. Interface used: infinite regular; () regular and strictly increasing; ; for ; for every ; ; (H) as quoted in Weakest step 2. Conclusion used: and with satisfying (1B), for a two-place with empty , and (2). The reconstruction's statement agrees with the printed statement on p. 1258, read clause by clause, including in the hypothesis and the order in (1).
- (ER) Erdős, Hajnal and Rado (1965), not held; it is the source's [4], confirmed on printed p. 1275. Interface: for every infinite ; the two relations the source cites follow by shrinking and by exchanging colors, as the page says. Held anchor: printed p. 442 of Komjáth (2025) prints for infinite inside a remark attributed to Erdős and Hajnal, and labels as Erdős--Rado in the next paragraph, for with , a condition satisfies. Reviewer's own check of the two-color form, so that the import does not rest on a survey sentence alone: let , , and suppose no set of size is homogeneous in color . Take an elementary submodel of a large enough structure containing , with , closed under -sequences (possible since ) and with an ordinal; then . For with , the set lies in and is homogeneous in color ; if then is unbounded in , since a bound would lie in below , so , contradiction; hence some has , and the same holds for minus any initial segment named in . By recursion on choose above the earlier in , a set in by closure under -sequences, with . Then for , so is homogeneous in color of size . This confirms the interface as stated on the page.
- (K) the hypothesis , used once in Step 7; a hypothesis, not an import.
- (S) Sierpiński (1933), not held. Interface: for every infinite , used only in the supplied preliminary. Explicit assumption: that the cited note covers every infinite ; to the reviewer's knowledge it treats , the general case following by the same construction (F3). The relation itself is standard and the reviewer accepts it.
- (EDM) Dushnik and Miller (1941), not held. Interface: for every infinite , applied with , infinite because ; the attribution of the singular case to Erdős within that paper is the standard one.
- Cardinal arithmetic as listed on the page: the sum formula (proved on the page and re-checked), regularity of successors, , boundedness of fewer than ordinals below , and unboundedness of full-size subsets; all standard and used correctly. Two listed facts are not used on the page (F5).
- Reading of the printed bound "eventually " as "": adopted from the result page, confirmed by the counterexample in Strongest attack and by the proof's own choice on p. 1260.
Findings
F1. Severity: required. Location: Step 4, "Claim. For every and every ... there are ", and Reading notes, "The remaining steps follow the printed proof". Defect: the printed proof reads, in the sentence following "so assume there is no such ", "As (by [4]) and hold for every , , there are sets of cardinality such that ..."; the sets are placed in , not in . The lemma's hypothesis (H) needs them inside the given , which is what the page's claim states and proves; the page thereby strengthens the printed sentence to the reading the proof needs without recording it, while listing Step 4 among the steps that follow the printed proof and recording the analogous slip "". Witness: the page image of printed p. 1260, PDF p. 4, lines 5--7 of the proof. Proposed replacement: add to Reading notes the bullet "The printed proof places the two homogeneous sets in ('there are sets '); they are read as subsets of the arbitrary to which the two relations are applied, the form that the lemma's hypothesis (H) needs and that the Step 4 claim states", and in the last paragraph of Step 5 replace "without checking the second and third items" by "without checking the second and third items, and with (H) stated for rather than for the given subset".
F2. Severity: suggested. Location: Preliminary, " is infinite, since is not." Defect: read as written the reason is that is not infinite, which is false, as ; the intended reason is that a finite has a finite . The conclusion is correct and follows from the preceding clause. Witness: the page itself; the paragraph is supplied, so the source has no corresponding sentence. Proposed replacement: " is infinite, because is infinite while is finite for finite ."
F3. Severity: suggested. Location: Imported results, "(S) Sierpiński, Sur un problème de la théorie des relations ... for every infinite cardinal ". Defect: the citation attributes the relation for every infinite to the 1933 note; to the reviewer's knowledge that note establishes the countable case , and the general case is obtained by the same construction, a well-ordering of the functions from to set against their lexicographic order, and is stated in later sources. This could not be checked from held material, and no web search was allowed, so it is filed as a suggestion. Proposed replacement: keep the citation for and add "the same construction, a well-ordering of against its lexicographic order, gives for every infinite , the form used here", or cite a source that states the general form.
F4. Severity: note. Location: Imported results, (ER), "is quoted as the Erdős--Rado theorem in Komjáth's survey, printed p. 442". Defect: on that page the relation is printed as the second half of a remark attributed to Erdős and Hajnal; the label "(Erdős--Rado)" is attached in the following paragraph to for with , of which is an instance. The sentence is right in substance. Witness: the page image of printed p. 442, PDF p. 25, the two paragraphs after Problem 53. Proposed replacement: "is printed in Komjáth's survey, p. 442, PDF p. 25, in the commentary on Problem 53, inside a remark attributed to Erdős and Hajnal, and the general form , of which it is the instance , is labeled there as the Erdős--Rado theorem".
F5. Severity: note. Location: Definitions, "Standard facts used without citation". Defect: two of the listed facts, and the bound on a union of fewer than small sets, are used nowhere on the page (the lemma page uses them); the sentence claims a use. Harmless. Proposed replacement: drop the two facts from the list.
F6. Severity: note. Location: Step 1, "a sequence of cardinals below with , which exists because ". Defect: a cofinal sequence of cardinals also needs to be a limit cardinal, which holds because is singular by the preliminary: from a cofinal sequence of ordinals take , cofinal among the cardinals because for every cardinal . Proposed replacement: "which exists because and , being singular, is a limit cardinal".
Verdict
Source fidelity: faithful with corrections. The statement, with the disclosed reading of the printed bound, the locators (printed p. 1260 is PDF p. 4 of the twenty-page scan; the source's [4] is Erdős, Hajnal and Rado (1965); Komjáth's printed p. 442 is PDF p. 25), the labels of the supplied steps and the two recorded readings all check against the page images. One reading in Step 4 is unrecorded (F1, required); one citation needs a qualification (F3, suggested).
The argument as reconstructed: sound. Every step was re-derived; the imports are applied within their hypotheses and named as imported, and (ER) was independently re-derived; the three-color derivation is correct and labeled as supplied; the reading of the printed bound is forced by the proof and by a counterexample to the printed form.
Limitations: the sources of (ER), (S) and (EDM) are not held, so (ER) rests on the reviewer's derivation and the held survey page, and (S) and (EDM) on the reviewer's knowledge of standard results; the Lemma 1.1 reconstruction was consumed through its statement only, its proof and standing being outside the read set; printed pp. 1259 and 1261 and the rest of the paper were not read.
This focused review assigns no tier and changes no status.