Wiki
Wiki

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 λ\lambda be an infinite cardinal and κ=cf⁡λ\kappa=\operatorname{cf}\lambda. Hypotheses: (i) κ→(κ)22\kappa\to(\kappa)^2_2, that is, every two-coloring of the two-element subsets of a set of size κ\kappa has a subset of size κ\kappa all of whose pairs have one color; (ii) the sequence ⟨2μ:μ<λ⟩\langle2^\mu:\mu<\lambda\rangle, indexed by the cardinals below λ\lambda, is not eventually constant: for every cardinal ν<λ\nu<\lambda there is a cardinal μ\mu with ν<μ<λ\nu<\mu<\lambda and 2μ≠2ν2^\mu\ne2^\nu, hence 2μ>2ν2^\mu>2^\nu; (iii) the sequence is eventually ≥λ\ge\lambda: there is a cardinal μ0<λ\mu_0<\lambda with 2μ≥λ2^\mu\ge\lambda for every cardinal μ\mu with μ0≤μ<λ\mu_0\le\mu<\lambda. The source prints (iii) with κ\kappa in place of λ\lambda; the page adopts the result page's reading ≥λ\ge\lambda and says so. Conclusion: with χ=∑μ<λ2μ\chi=\sum_{\mu<\lambda}2^\mu, the cardinal sum over all cardinals below λ\lambda, the finite ones included, every f:[χ]2→2f:[\chi]^2\to2 has H⊆χH\subseteq\chi with ∣H∣=λ|H|=\lambda and ff constant on [H]2[H]^2; and moreover every f:[χ]2→3f:[\chi]^2\to3 has a set of size λ\lambda homogeneous in color 00, or one of size λ\lambda homogeneous in color 11, or one of size ω\omega homogeneous in color 22.

Convention: θ→(μ0,…,μk−1)2\theta\to(\mu_0,\ldots,\mu_{k-1})^2 is the ordinary partition relation for pairs, a homogeneous set of size μν\mu_\nu in color ν\nu for some ν<k\nu<k; the underlying set may be any set of size θ\theta, and a homogeneous set of size at least μν\mu_\nu contains one of size exactly μν\mu_\nu. Scope facts that the page proves and this review confirmed: under (i)--(iii), κ<λ\kappa<\lambda, so λ\lambda is singular, and χ=sup⁡μ<λ2μ>λ\chi=\sup_{\mu<\lambda}2^\mu>\lambda.

Checklist

  • Quantifiers and scope. Pass. The two "eventually" clauses are defined with explicit quantifiers and used in that form (Step 1 fixes μ0\mu_0 and applies the negation of eventual constancy to ν=ρi\nu=\rho_i). The index set of χ\chi is stated, and χ=sup⁡μ<λ2μ\chi=\sup_{\mu<\lambda}2^\mu is proved in both directions. Boundary cases: κ=λ\kappa=\lambda is excluded by the supplied preliminary; λ=ω\lambda=\omega cannot satisfy (iii); the block i=0i=0 has A0=λ0A_0=\lambda_0 and λ0=1\lambda^0=1, both handled. No shift from "almost all" to "all".
  • Circularity. Pass. The target relation is never assumed; (K) is a hypothesis about κ\kappa, not about χ\chi; (ER), (S) and (EDM) are external and named as imported.
  • Model and convention changes. Pass. The passage from [χ]2[\chi]^2 to the pairs of A=⋃iAiA=\bigcup_iA_i is proved (Step 2(c)--(d)); transport of colorings along bijections is stated in the Definitions; Lemma 1.1 is invoked with χ=2\chi=2, F0=F1=f~F_0=F_1=\tilde f and the property PαP_\alpha, 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 i<κi<\kappa are μ(i)≥κ\mu(i)\ge\kappa, ∣i∣<κ≤μ(i)|i|<\kappa\le\mu(i) (Step 1) and λiμ(i)=λi\lambda_i^{\mu(i)}=\lambda_i (Step 5); each is proved for every ii, not from instances, and no constant depends on an unstated parameter.
  • Extremal conclusions. Pass. ∣Ai∣=λi|A_i|=\lambda_i, ∣Bα∣=μ(α)|B_\alpha|=\mu(\alpha) and ∣B∣=λ|B|=\lambda 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, 2χ+κ<λ02^{\chi+\kappa}<\lambda_0, (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. λi=(2μ(i))+\lambda_i=(2^{\mu(i)})^+ is regular and μ(i)<2μ(i)<λi\mu(i)<2^{\mu(i)}<\lambda_i, so every g:μ(i)→λig:\mu(i)\to\lambda_i is bounded by some θ<λi\theta<\lambda_i; for fixed θ\theta there are at most ∣θ∣μ(i)≤(2μ(i))μ(i)=2μ(i)|\theta|^{\mu(i)}\le(2^{\mu(i)})^{\mu(i)}=2^{\mu(i)} such gg, and there are λi\lambda_i choices of θ\theta, so λiμ(i)≤λi⋅2μ(i)=λi\lambda_i^{\mu(i)}\le\lambda_i\cdot2^{\mu(i)}=\lambda_i; the reverse inequality is trivial. For 1≤j<κ1\le j<\kappa and i<ji<j, 2μ(i)<2μ(j)2^{\mu(i)}<2^{\mu(j)} gives λi≤2μ(j)\lambda_i\le2^{\mu(j)}, so

∏i<jλiμ(i)=∏i<jλi≤(2μ(j))∣j∣≤(2μ(j))μ(j)=2μ(j)<λj,\prod_{i<j}\lambda_i^{\mu(i)}=\prod_{i<j}\lambda_i \le(2^{\mu(j)})^{|j|}\le(2^{\mu(j)})^{\mu(j)}=2^{\mu(j)}<\lambda_j ,

using ∣j∣<κ≤μ(j)|j|<\kappa\le\mu(j); the empty product is 1<λ01<\lambda_0. And 22+κ=2κ≤2μ(0)<λ02^{2+\kappa}=2^\kappa\le2^{\mu(0)}<\lambda_0 because κ≤μ(0)\kappa\le\mu(0). Both bounds need μ(i)≥κ\mu(i)\ge\kappa, which Step 1 can arrange only because κ<λ\kappa<\lambda: if κ=λ\kappa=\lambda no cardinal μ(0)<λ\mu(0)<\lambda is ≥κ\ge\kappa. The supplied preliminary closes exactly this gap. Composition: without these bounds Lemma 1.1 is unavailable and Step 6 has no sets BiB_i.

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 ii and A′⊆AiA'\subseteq A_i with ∣A′∣=λi|A'|=\lambda_i. (ER) with μ=μ(i)\mu=\mu(i), infinite because μ(i)≥κ\mu(i)\ge\kappa, applied to ff on [A′]2[A']^2, gives H⊆A′H\subseteq A' with either ∣H∣=λi|H|=\lambda_i and f≡0f\equiv0 on [H]2[H]^2, or ∣H∣=μ(i)+|H|=\mu(i)^+ and f≡1f\equiv1 on [H]2[H]^2. Since H⊆AiH\subseteq A_i and λi>2μ(i)≥λ\lambda_i>2^{\mu(i)}\ge\lambda (hypothesis (iii) through μ(i)≥μ0\mu(i)\ge\mu_0), the first alternative is a homogeneous subset of one block of size at least λ\lambda, which (N) excludes; so the second holds and any B1⊆HB_1\subseteq H of size μ(i)\mu(i) serves. The same with 1−f1-f gives B0B_0. Composition: for C⊆AαC\subseteq A_\alpha with ∣C∣=λα|C|=\lambda_\alpha, Bα=B0∪B1⊆CB_\alpha=B_0\cup B_1\subseteq C has ∣Bα∣=μ(α)|B_\alpha|=\mu(\alpha) because μ(α)\mu(\alpha) is infinite, and PαP_\alpha holds with Bα,0=B0B_{\alpha,0}=B_0, Bα,1=B1B_{\alpha,1}=B_1; PαP_\alpha depends on BαB_\alpha alone, so the earlier admissible sequence and the later points are irrelevant, and (H) holds. The printed proof places the two sets in AiA_i rather than in the arbitrary Ai′A'_i; the page's claim carries the reading the lemma needs (F1).

3. Step 7: ∣B∣=λ|B|=\lambda. The source states it in one clause. Re-derivation. The sets Bα,δB_{\alpha,\delta} (α∈I\alpha\in I) lie in the pairwise disjoint blocks AαA_\alpha, so ∣B∣=∑α∈Iμ(α)=∣I∣⋅sup⁡α∈Iμ(α)|B|=\sum_{\alpha\in I}\mu(\alpha)=|I|\cdot\sup_{\alpha\in I}\mu(\alpha) by the sum formula (II infinite, every term ≥1\ge1). A subset of κ\kappa of cardinality κ\kappa is unbounded in κ\kappa, since a bounded subset lies inside an ordinal γ<κ\gamma<\kappa with ∣γ∣<κ|\gamma|<\kappa; the μ(α)\mu(\alpha) increase; hence sup⁡α∈Iμ(α)=sup⁡α<κμ(α)=λ\sup_{\alpha\in I}\mu(\alpha)=\sup_{\alpha<\kappa}\mu(\alpha)=\lambda, the last equality from νi≤μ(i)<λ\nu_i\le\mu(i)<\lambda and sup⁡iνi=λ\sup_i\nu_i=\lambda in Step 1. So ∣B∣=κ⋅λ=λ|B|=\kappa\cdot\lambda=\lambda. Composition: together with the homogeneity check, which splits into the within-block case (f≡δf\equiv\delta on [Bα,δ]2[B_{\alpha,\delta}]^2) and the cross-block case (f({ξ,η})=g({α,β})=δf(\{\xi,\eta\})=g(\{\alpha,\beta\})=\delta), BB witnesses χ→(λ)22\chi\to(\lambda)^2_2.

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 μ(α)\mu(\alpha) inside an arbitrary C⊆AαC\subseteq A_\alpha of size λα\lambda_\alpha, for every admissible earlier sequence and every choice of later points, while the printed proof exhibits sets inside AiA_i only. The attack fails against the page: the Step 4 claim is stated and proved for every A′⊆AiA'\subseteq A_i of size λi\lambda_i, PαP_\alpha depends on BαB_\alpha alone, and B0∪B1B_0\cup B_1 has size exactly μ(α)\mu(\alpha). 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 2κ≥λ02^\kappa\ge\lambda_0 or ∏i<jλi≥λj\prod_{i<j}\lambda_i\ge\lambda_j. If κ=λ\kappa=\lambda, then μ(0)≥κ\mu(0)\ge\kappa is impossible and 2κ<(2μ(0))+2^\kappa<(2^{\mu(0)})^+ can fail. The page's preliminary shows that κ=λ\kappa=\lambda contradicts (i) and (iii): a cardinal μ<λ\mu<\lambda with 2μ≥λ2^\mu\ge\lambda is infinite (a finite μ\mu has finite 2μ2^\mu), (S) gives a two-coloring of a set of size 2μ≥λ2^\mu\ge\lambda with no homogeneous set of size μ+≤λ\mu^+\le\lambda, and its restriction to a subset of size λ\lambda refutes λ→(λ)22\lambda\to(\lambda)^2_2. With κ<λ\kappa<\lambda the recursion places μ(0)≥κ\mu(0)\ge\kappa and the growth bound follows as in Weakest step 1. A third attack targeted the reading of the printed bound: with "eventually ≥κ\ge\kappa" and 2ℵn=ℵn+12^{\aleph_n}=\aleph_{n+1} for all nn, λ=ℵω\lambda=\aleph_\omega, κ=ω\kappa=\omega, all three hypotheses hold as printed, χ=ℵω\chi=\aleph_\omega, and ℵω→(ℵω)22\aleph_\omega\to(\aleph_\omega)^2_2 fails (partition ℵω\aleph_\omega into ω\omega pieces of size below ℵω\aleph_\omega 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, 2μ(i)≥λ2^{\mu(i)}\ge\lambda, 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: κ\kappa infinite regular; λi\lambda_i (i<κi<\kappa) regular and strictly increasing; ∣Ai∣=λi|A_i|=\lambda_i; Fi:Ani→χF_i:A^{n_i}\to\chi for i<χi<\chi; ∏i<jλiμ(i)<λj\prod_{i<j}\lambda_i^{\mu(i)}<\lambda_j for every j<κj<\kappa; 2χ+κ<λ02^{\chi+\kappa}<\lambda_0; (H) as quoted in Weakest step 2. Conclusion used: ai∗∈Aia^*_i\in A_i and Bi⊆AiB_i\subseteq A_i with ∣Bi∣≤μ(i)|B_i|\le\mu(i) satisfying (1B), for a two-place F0F_0 with empty aˉ\bar a, and (2). The reconstruction's statement agrees with the printed statement on p. 1258, read clause by clause, including ∣Bα∣≤μα|B_\alpha|\le\mu_\alpha in the hypothesis and the order α<β\alpha<\beta in (1).
  • (ER) Erdős, Hajnal and Rado (1965), not held; it is the source's [4], confirmed on printed p. 1275. Interface: (2μ)+→((2μ)+,μ+)2(2^\mu)^+\to((2^\mu)^+,\mu^+)^2 for every infinite μ\mu; 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 (2κ)+→((2κ)+,(κ+)κ)2(2^\kappa)^+\to((2^\kappa)^+,(\kappa^+)_\kappa)^2 for infinite κ\kappa inside a remark attributed to Erdős and Hajnal, and labels λ+→(λ+,(κ+)κ)2\lambda^+\to(\lambda^+,(\kappa^+)_\kappa)^2 as Erdős--Rado in the next paragraph, for λ\lambda with λκ<λκ+\lambda^\kappa<\lambda^{\kappa^+}, a condition λ=2κ\lambda=2^\kappa satisfies. Reviewer's own check of the two-color form, so that the import does not rest on a survey sentence alone: let θ=(2μ)+\theta=(2^\mu)^+, f:[θ]2→2f:[\theta]^2\to2, and suppose no set of size θ\theta is homogeneous in color 00. Take an elementary submodel MM of a large enough structure containing ff, with ∣M∣=2μ|M|=2^\mu, closed under μ\mu-sequences (possible since (2μ)μ=2μ(2^\mu)^\mu=2^\mu) and with M∩θ=δM\cap\theta=\delta an ordinal; then cf⁡δ>μ\operatorname{cf}\delta>\mu. For S∈MS\in M with δ∈S\delta\in S, the set T={z∈S:f({x,z})=0 for all x∈S∩z}T=\{z\in S:f(\{x,z\})=0\text{ for all }x\in S\cap z\} lies in MM and is homogeneous in color 00; if δ∈T\delta\in T then TT is unbounded in θ\theta, since a bound would lie in MM below δ\delta, so ∣T∣=θ|T|=\theta, contradiction; hence some x∈S∩δx\in S\cap\delta has f({x,δ})=1f(\{x,\delta\})=1, and the same holds for SS minus any initial segment named in MM. By recursion on ξ<μ+\xi<\mu^+ choose xξ∈δx_\xi\in\delta above the earlier xηx_\eta in Sξ={y:f({xη,y})=f({xη,δ}) for all η<ξ}S_\xi=\{y:f(\{x_\eta,y\})=f(\{x_\eta,\delta\})\text{ for all }\eta<\xi\}, a set in MM by closure under μ\mu-sequences, with f({xξ,δ})=1f(\{x_\xi,\delta\})=1. Then f({xη,xξ})=f({xη,δ})=1f(\{x_\eta,x_\xi\})=f(\{x_\eta,\delta\})=1 for η<ξ\eta<\xi, so {xξ:ξ<μ+}\{x_\xi:\xi<\mu^+\} is homogeneous in color 11 of size μ+\mu^+. This confirms the interface as stated on the page.
  • (K) the hypothesis κ→(κ)22\kappa\to(\kappa)^2_2, used once in Step 7; a hypothesis, not an import.
  • (S) Sierpiński (1933), not held. Interface: 2μ↛(μ+)222^\mu\not\to(\mu^+)^2_2 for every infinite μ\mu, used only in the supplied preliminary. Explicit assumption: that the cited note covers every infinite μ\mu; to the reviewer's knowledge it treats μ=ℵ0\mu=\aleph_0, 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: θ→(θ,ω)2\theta\to(\theta,\omega)^2 for every infinite θ\theta, applied with θ=χ\theta=\chi, infinite because χ≥λ\chi\ge\lambda; 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, (2μ)μ=2μ(2^\mu)^\mu=2^\mu, boundedness of fewer than cf⁡θ\operatorname{cf}\theta ordinals below θ\theta, 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 ≥κ\ge\kappa" as "≥λ\ge\lambda": adopted from the result page, confirmed by the counterexample in Strongest attack and by the proof's own choice 2μ(i)≥λ2^{\mu(i)}\ge\lambda on p. 1260.

Findings

F1. Severity: required. Location: Step 4, "Claim. For every i<κi<\kappa and every A′⊆AiA'\subseteq A_i ... there are B0,B1⊆A′B_0,B_1\subseteq A'", 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 BB", "As (by [4]) λi→(λi,μ(i))2\lambda_i\to(\lambda_i,\mu(i))^2 and λi→(μ(i),λi)2\lambda_i\to(\mu(i),\lambda_i)^2 hold for every Ai′⊆AiA'_i\subseteq A_i, ∣Ai′∣=λi|A'_i|=\lambda_i, there are sets Bi,0,Bi,1⊆AiB_{i,0},B_{i,1}\subseteq A_i of cardinality μ(i)\mu(i) such that ..."; the sets are placed in AiA_i, not in Ai′A'_i. The lemma's hypothesis (H) needs them inside the given CC, 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 "∣Bα∣=μ(i)|B_\alpha|=\mu(i)". 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 AiA_i ('there are sets Bi,0,Bi,1⊆AiB_{i,0},B_{i,1}\subseteq A_i'); they are read as subsets of the arbitrary Ai′A'_i 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 AiA_i rather than for the given subset".

F2. Severity: suggested. Location: Preliminary, "μ\mu is infinite, since 2μ2^\mu is not." Defect: read as written the reason is that 2μ2^\mu is not infinite, which is false, as 2μ≥λ2^\mu\ge\lambda; the intended reason is that a finite μ\mu has a finite 2μ2^\mu. 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: "μ\mu is infinite, because 2μ≥λ2^\mu\ge\lambda is infinite while 2μ2^\mu is finite for finite μ\mu."

F3. Severity: suggested. Location: Imported results, "(S) Sierpiński, Sur un problème de la théorie des relations ... for every infinite cardinal μ\mu". Defect: the citation attributes the relation for every infinite μ\mu to the 1933 note; to the reviewer's knowledge that note establishes the countable case 2ℵ0↛(ℵ1)222^{\aleph_0}\not\to(\aleph_1)^2_2, and the general case is obtained by the same construction, a well-ordering of the functions from μ\mu to 22 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 μ=ℵ0\mu=\aleph_0 and add "the same construction, a well-ordering of μ2{}^\mu2 against its lexicographic order, gives 2μ↛(μ+)222^\mu\not\to(\mu^+)^2_2 for every infinite μ\mu, 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 (2κ)+→((2κ)+,(κ+)κ)2(2^\kappa)^+\to((2^\kappa)^+,(\kappa^+)_\kappa)^2 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 λ+→(λ+,(κ+)κ)2\lambda^+\to(\lambda^+,(\kappa^+)_\kappa)^2 for λ\lambda with λκ<λκ+\lambda^\kappa<\lambda^{\kappa^+}, of which λ=2κ\lambda=2^\kappa 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 λ+→(λ+,(κ+)κ)2\lambda^+\to(\lambda^+,(\kappa^+)_\kappa)^2, of which it is the instance λ=2κ\lambda=2^\kappa, 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, 2∑iκi=∏i2κi2^{\sum_i\kappa_i}=\prod_i2^{\kappa_i} and the bound on a union of fewer than cf⁡θ\operatorname{cf}\theta 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 ⟨νi:i<κ⟩\langle\nu_i:i<\kappa\rangle of cardinals below λ\lambda with sup⁡i<κνi=λ\sup_{i<\kappa}\nu_i=\lambda, which exists because cf⁡λ=κ\operatorname{cf}\lambda=\kappa". Defect: a cofinal sequence of cardinals also needs λ\lambda to be a limit cardinal, which holds because λ\lambda is singular by the preliminary: from a cofinal sequence of ordinals ⟨γi⟩\langle\gamma_i\rangle take νi=∣γi∣\nu_i=|\gamma_i|, cofinal among the cardinals because θ+<λ\theta^+<\lambda for every cardinal θ<λ\theta<\lambda. Proposed replacement: "which exists because cf⁡λ=κ\operatorname{cf}\lambda=\kappa and λ\lambda, 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.