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 working in a fresh context from the assignment alone; took no part in writing the reviewed section, the lead, the Tools section or the reconstruction pages. Charge: refutation.
Subject. The page wiki/research/erdos_1219/connections.md as it stood at
2026-09-28T13:50:48Z, section ## Hajnal's Conjecture 1A: triples, lines
286--445 (the H2 at line 286 to the line before the H2 ## Problem 1218 at line
446), and the lead page
wiki/research/leads/triple_canonization_for_hajnal_conjecture/_index.md
(151 lines, whole page), both as of that time.
Reading. The section and the lead in full, every sentence. The page's
Scope paragraph (lines 19--37) and its Tools section (lines 39--108) as
inputs: the interface (T1) was confirmed at each use (hypotheses on
, , , , the arity of , the conclusions
(1A), (1B), (2)); (T2) and (T3) are not used by the section and were not
checked. The three reconstruction pages
wiki/research/erdos_1219/lemma_1_1_reconstruction.md,
wiki/research/erdos_1219/theorem_1_2_reconstruction.md and
wiki/research/erdos_1219/corollary_1_3_reconstruction.md in full, as
premises at their standing; the section's uses of clauses (1A), (1B), (2),
of the argument for clause (3), of the proof-internal first thinning, and
of Steps 1, 2, 5 and 7 of the theorem page were checked against their
stated hypotheses. The statement paragraph of
wiki/problems/set_theory/E1219/_index.md (lines 17--23; the page has no
Statement heading; its Current assessment, Progress and Known Results
sections were not read). The result page
library/set_theory/shelah_1975_notes_partition_calculus/conjecture_1a.md
and the provenance and read-status paragraphs of the Shelah library card.
The held Shelah scan, PDF pp. 2--5 (printed pp. 1258--1261), on page images
rendered at 130 dpi: the statement of Lemma 1.1 with its Remark, the proof
on pp. 1259--1260, Theorem 1.2 with its proof, Corollary 1.3 with its
Remark, and Conjecture 1A with its Remark. The held Komjáth survey, PDF
pp. 2--3 (printed pp. 419--420), text layer: Problems 3, 4 and 5 with their
commentary. The wiki pages named in the assignment.
Exposures. None to excluded content. A directory listing made to
locate the target path showed the file names of other records under
wiki/research/erdos_1219/evidence/verify/; none was opened. A working
tree status listing showed the names of untracked review files in a
sibling research folder; none was opened.
Restatement
Throughout, H is the hypothesis for a sequence of natural numbers, , and a coloring is a map . The blocks are those of the theorem page at , : cardinals (), strictly increasing and cofinal in , each above , with strictly increasing and ; ; and a partition with . The pattern of a triple meeting the blocks is . For a family of sets , .
- S1 (target; not a claim). Conjecture 1A: under H, every coloring has with and on , or with and on . The section attributes to the Remark on printed p. 1261 the unproved assertion and to the survey, p. 419, the record that the conjecture is unproven.
- S2 (the canonization statement; a definition). A coloring satisfies (C) when there are () with , on , a three-element set with , such that with : (P1) for all the value is the same for all , , ; (P2) for all the value is the same for all and ; (P3) for all the value is the same for all and .
- S3 (endgame lemma). Under H, with the blocks fixed: if every coloring satisfying (i) no four-element has on , and (ii) no and no with has on , satisfies (C), then Conjecture 1A holds. Imported: and .
- S4 (remark on the triples ). Let give color exactly to the triples of pattern with . Then (a) has no four-element set homogeneous in color ; (b) every set of size homogeneous in color lies, up to finitely many points, inside one block; (c) "shows that the case , cannot be handled without the ".
- S5 (application of the lemma). Let be the symmetric extension of , on tuples with a repeated entry, and let hold when with , on and a triple of color (the section adds "together with whatever (P2) turns out to need"). For a coloring with (i) and (ii), and given the imported relation for infinite , the realizability hypothesis (H) holds for these , so (T1) applies and Lemma 1.1 yields and with (1A), (1B) and (2).
- S6 (P1). For , , , : . The map sending to the sequence has at most values; when for every , replacing each by a fiber of size and keeping gives (P1) while (1A), (1B) and (2) survive; for every can be arranged through the choice of in Step 1 exactly when , and when the fiber argument fails.
- S7 (P2, first half). For , and : . Hence (P2) holds if and only if, for every , the coloring of , with at most colors, is constant; the lemma's thinnings do not provide this, so it must be a conjunct of , realized inside every with .
- S8 (P2, the Erdős--Rado discussion). When , the imported relation gives with on which is constant; (S8a) inside the relation "cannot be applied again ( is not of that form)"; (S8b) a triple of color inside is not guaranteed; a -homogeneous set of size cannot be asked because is a successor cardinal; so the route needs the block statement (BS2): in every of size , for every coloring of with at most colors, there is as in (C) on which that coloring is constant, or has a four-element set of color ; (BS2) is left open.
- S9 (P3, what the lemma gives). (S9a) No clause of Lemma 1.1 relates , with and , to any other value. (S9b) "(P3) says that , a coloring of with at most colors, is constant."
- S10 (P3, the counting obstruction). For , ; the Erdős--Rado relation at the block size would need ; when there is a coloring of with colors and no homogeneous triple; choosing smaller earlier blocks does not remove the obstruction, because the are cofinal in ; whether the particular induced by an with (i) admits a homogeneous is the open gap.
- S11 (falsification checks). The endgame uses only the values on the and the two Ramsey theorems; its cases are exhaustive; the block sizes are those of Theorem 1.2, so (T1) applies; the Remark after Lemma 1.1 was not read; the three-color form of Theorem 1.2 gives nothing for the triple relation.
- S12 (conditional deductions of the next investigation). (S12a) If every with (i) and (ii) forces, in every full-size subset of , a set on which is constant, then, with (BS2), the conjecture holds under by the endgame lemma. (S12b) A coloring defeating (P3) in every choice of "shows that a proof of the conjecture cannot pass through canonization over the lower blocks"; the lead: "shows that no proof passes through canonization over the lower blocks".
- S13 (outcome sentence). The endgame lemma reduces the conjecture to (C); the lemma supplies (P1) under and half of (P2), and nothing of (P3).
The lead page restates S1 (Target and status evidence), S2 and S3 (Route and established inputs), S6, S7 and S9a (What the lemma supplies), the imported inputs (Provisional premises), S9b and S10 (The consequential gap), and S12 with the removal of as a later step (Next step). Its frontmatter marks the lead a candidate, unreviewed, and its closing sentence disclaims any status change.
Checklist
- Quantifiers and scope. Defect found. S9b drops the quantifier over : (P3) demands constancy in the pair and constancy in within each lower block, while the constancy of gives only the first (F1). (C) asks (P3) for , although only is used by the endgame and only that much is deliverable by thinning (F1). S12b's "no proof passes" is a universal statement about proofs that the negative outcome does not support (F2). The (P3) question also depends on the admissible lower sequence through , which the wording "induced by an " hides (F7). The endgame lemma's quantifiers are correct.
- Circularity. None. (C) is a structural sufficient condition; the endgame lemma proves the implication from (C) to the target without using the target, and nothing in the section derives (C) from the conjecture.
- Model and convention changes. Pass. The passage from on to the symmetric on and the identification of with the union of the blocks are proved transfers (Step 2(c), (d) of the theorem page); the pattern convention is used consistently; the reading of as is correct because every is an with , hence regular.
- Finite and statistical overreach. Pass; nothing finite or statistical is used.
- Uniformity. Pass. The bound on the fiber maps in S6 and S7 does not depend on ; the requirement is stated for every and met by one choice of ; the color count in S10 depends on as stated, and the obstruction is argued for every .
- Extremal conclusions. Inapplicable; no infimum, supremum or sharpness claim is made.
- Consequences and composition. Defects found. S12a claims a conclusion whose bridge from the constancy of to (P3) is missing (F1). S8a gives a false reason for a true consequence (F3). S13's "the lemma supplies (P1)" also consumes the imported triple relation through (H), which the Outcome sentence does not carry (F8). Every other "hence" was checked separately and follows.
- Computation. Inapplicable; no computation is used or claimed.
- Reproduction. Inapplicable; no rerun instruction or coverage claim is made.
- Source and verdict fidelity. Pass with two unverifiable items. The Remark on printed p. 1261, the survey's record on p. 419, the note under Problem 5 on p. 420, and the Remark after Lemma 1.1 on p. 1258 read on the held pages as the section reports them. The attribution of to Erdős, Hajnal and Rado (1965) cannot be checked in the read set, and the pages say so ("not held"). The sentences citing a search "recorded on the problem page (2026-09-27)" and an "assessment dated 2026-09-27" refer to excluded text and were not checked. The standing sentences (author-recorded, unreviewed, no status change, no tier) claim nothing beyond author-recorded.
Weakest steps
W1: the reduction of (P3) to the constancy of (S9b), and the bridge in S12a. Fix . (P3) at says: there is with for all and all . Write for , so . Then (P3) for all is the conjunction of (P3a) is constant on , with common value , and (P3b) is constant on each , . Constancy of is (P3a) alone. (P3a) does not imply (P3b): if takes both values on some and is on every triple of pattern , , whatever does elsewhere, then for every pair, so is constant for every choice of , while (P3) fails at . Now compose with the lemma. Neither (P3a) nor (P3b) is provided by any clause of Lemma 1.1 (S9a is correct, and (P3b) is equally uncovered: the lemma canonizes an element of against one point of each higher block, never against a pair). If (P3a) is obtained, as S12a supposes, (P3b) for follows by an extra fiber step: the map on has at most values, so under a fiber of size exists, and it may be taken jointly with the (P1) fiber of S6. (P3b) for cannot be obtained by thinning: is three fixed points chosen at stage , before any with exists, from information that contains one point of each higher block and therefore cannot see any pair in . The endgame lemma uses (P3) only for : in the case the single lower point may be taken in , and the final case uses the alone. So (C) with (P3) restricted to still supports the endgame, and S12a holds for that restricted (C) after the extra fiber step, under the hypothesis it already carries. As written, with (P3) over and with the bridge absent, S12a does not follow.
W2: the (P1) transfer through the argument of clause (3) (S6). By (1B) at the blocks with the one-element sequence from , : for , , which is the joint independence of from and . The residual map on is indexed by the countably many pairs with and takes values in , so it has at most values. Since for some , is regular, and if then , a union of at most fibers, has a fiber of size ; call it and put . (1A) and (1B) are universal over the and survive; holds for because it depends on alone and has the required shape; the value was independent of the choice of , , so it is unchanged on , ; hence (P1) holds on the . The condition for all is arranged by taking above in Step 1 when ; when no exceeds ; is excluded by the cofinality of being uncountable, so "exactly when" is right. The step does not invoke clause (3) as stated, whose heredity hypothesis the property fails (dropping a point of from a same-size subset destroys the color- triple); it reuses the reconstruction's fiber argument with the thinning confined to , which is sound (F4).
W3: the endgame lemma (S3). Let satisfy (i) and (ii) and (C). Ramsey for triples on gives an infinite with constant value ; Ramsey for pairs, twice, gives an infinite with and on . If : four indices of and one point of each give a four-element set all of whose triples have three distinct block indices in , hence color . If : for in , with has the triple of color and three triples with two points in and one in , of color by (P2) as quantified over . If : one point and give of color and three triples with one point in and a pair from , of color by (P3). Otherwise and is homogeneous in color : a triple inside one has color by the choice of , and a triple across blocks has pattern , or with in and color , or . The are disjoint and is unbounded in , so . The case split is exhaustive, and colorings without (i) or (ii) satisfy the conjecture directly. The lemma is correct. Its proof needs (P2) only for and (P3) only for , which is what W1 uses.
Strongest attack
- S3. Attempted: making the four-element sets degenerate by letting meet (irrelevant, as the blocks are disjoint and the sets used have four points in two or four blocks); using (P2) or (P3) at pairs from (available, since (C) quantifies over and ); making (impossible, is infinite and the are cofinal); finding the conjecture inside the hypothesis (it is not: (C) is a statement about sets in blocks, and a counterexample to the conjecture with (i) and (ii) would simply fail (C)). All failed.
- S4. (a) and (b) were re-derived: a four-element set homogeneous in color would need every triple to have exactly two points in its lowest block, which no distribution of four points over blocks achieves; a set homogeneous in color with two points in a block has no point above block and at most one point in each block below it. For (c), the attack is that violates hypothesis (ii) (each block is homogeneous in color ), so it lies outside the endgame lemma and defeats no implication the section states; what it shows is that the canonical values on the alone are compatible with both outcomes in the case , . As a statement about the proof mechanism, (c) survives (F5).
- S5. Attempted: breaking (H). Inside every with , the imported relation with and (i) give a set of size homogeneous in color , which contains one of size ; (ii) gives a triple of color because ; the union has size . The lemma's remaining hypotheses are those (T1) verifies. The types over a set include patterns with repeated entries, on which is ; harmless. Failed, conditionally on the imported relation.
- S6. See W2. Attempted: an uncountable index set for (no, the pairs are countable); a singular (no, below every infinite cardinal is regular); loss of (2) under thinning (no, depends on alone). Failed.
- S7. Attempted: the link between and is not among the lemma's conclusions (1A), (1B), (2); (1B) relates one point of to , not a pair. The section names the proof-internal first thinning of the lemma page, which gives and the same type over and hence ; the reconstruction states this as its labeled fact (T1). The "if and only if" then holds, and the count of colors is . Failed (F6).
- S8a. Refuted-as-stated. Under , and , Step 1 gives , the hypothesis of the sentence holds, and is of the form with , so the relation applies again. The consequence survives for a different reason: whenever , then (otherwise ), so the relation yields a set of color of size , and S8b already defeats the approach.
- S8b. Attempted: a triple of color inside is guaranteed by (ii) only for sets of size at least , and ; a homogeneous set of size for a two-valued coloring of is refuted by the Sierpiński coloring restricted from , as is a successor. Failed.
- S9a. Attempted: each of (1A), (1B), (3) was checked for a tuple with two entries from one block and one from a lower block; none covers it. The proof-internal second thinning relates to for , a single pair type, not . Failed.
- S9b. Refuted-as-stated; witness in W1.
- S10. Re-derived: for since each ; the Erdős--Rado relation with needs , that is ; otherwise , and the coloring of by the least coordinate where two functions differ has no homogeneous triple (three functions cannot be pairwise distinct at one coordinate with two values), which is restricted to points; a block with has , and all but finitely many blocks are such. Attempted: the bound is an upper bound on the colors of , which the section already concedes by leaving the induced open. Failed.
- S11. Re-derived with W3 and (T1). Failed.
- S12a. Proof defective; statement unresolved; see W1 and F1.
- S12b. Proof defective; statement unresolved; a negative outcome refutes (H) for the property that carries (P3), hence (C) as the route's sufficient condition for that and those blocks. It does not exclude a proof through a different canonical form (constancy on the after thinning, constancy up to a small exceptional set, a different block decomposition or a different parameter set), so the universal "no proof passes through canonization over the lower blocks" is unsupported (F2).
- S13. Attempted: "supplies (P1)" without its imported input; the Outcome sentence carries only , while the realizability (H) behind (P1) also consumes , which the section's next-investigation paragraph and the lead's provisional premises do carry. Survives as author-recorded with that qualification (F8).
Premises
- (T1), Tools section of the connections page, lines 46--61. Interface: infinite regular; infinite, strictly increasing, , strictly increasing; ; pairwise disjoint of size ; of finitely many places; then Lemma 1.1 applies with , and any satisfying (H), yielding (1A), (1B), (2) with . Its proof (Steps 2(a) and 5 of the theorem page) is another reviewer's subject; here confirmed: , , , the blocks of Step 2.
- Lemma 1.1 reconstruction (premise at its standing). Used: clauses (1A), (1B), (2) as stated on its Statement section; the labeled proof-internal fact (T1) (first thinning: every has the type of over ); the fiber argument of its Clause (3) section with its reading of the hypotheses. Read in full.
- Theorem 1.2 reconstruction (premise at its standing). Used: Step 1 (the , with and ), Step 2 (the blocks and ), Step 5 (the hypotheses of the lemma), Step 7 (the size of a union of the over an unbounded index set). Read in full.
- Corollary 1.3 reconstruction (premise at its standing). Used: the hypotheses of Theorem 1.2 at under H, with , and . Read in full.
- Conjecture 1A result page (conjecture_1a). Statement and Remark as recorded; matches the held page image, printed p. 1261.
- Shelah (1975), held scan (library card), PDF pp. 2--5 on page images. Lemma 1.1 with its Remark (p. 1258), the proof (pp. 1259--1260) including the one-sentence treatment of (3), Theorem 1.2, Corollary 1.3 and its Remark (p. 1260), Conjecture 1A and its Remark (p. 1261). Read at statement depth for the statements the section cites; the proofs were read to confirm the reconstruction's labels, not re-verified.
- Komjáth (2025), held PDF (library card), printed pp. 419--420 in the text layer: Problem 3 with the record of Hajnal's conjecture as unproven; Problem 5 with " holds in general".
- Imported, not held. Ramsey's theorem and (standard; used in S3). Erdős--Rado for infinite (standard; used in S8 and S10 as a known relation). The unbalanced triple relation for infinite (used in S5; its attribution to Erdős, Hajnal and Rado 1965 is not checkable here and is flagged on both pages as to be located; the Remark on p. 1261, which asserts that every previously known case of also gives , is consistent with it but proves nothing). (held in the survey and re-derived above).
- Explicit assumptions of the route. H; the blocks of Step 2; for S6 and the Erdős--Rado step of S8; the block statement (BS2); the (P3) question. No batch acceptance order applies.
Findings
- F1 (required). Location: connections page, (P3) bullet, "(P3) says that , a coloring of with at most colors, is constant."; Next investigation, "A positive outcome, with the block statement for (P2), proves the conjecture under by the endgame lemma."; lead page, The consequential gap and Next step 1, "admits in every full-size subset of a set on which the induced pair coloring is constant. A positive outcome, with the block statement behind (P2), proves the conjecture under by the endgame lemma." Defect: (P3) is the conjunction of the constancy of on and the constancy of its value on each lower ; the sentence keeps only the first, and the conditional conclusion has no bridge for the second. Witness: the coloring of W1 with on every triple of pattern , not constant on : is constant for every and (P3) fails. Replacement: state (P3) in (C) for (the endgame lemma uses it only there), and record that a positive outcome gives (P3) so restricted only after thinning each to a fiber of , at most values, which has size under and is taken jointly with the (P1) fiber; or else pose the (P3) question with the value of required to be constant on each lower , which is (P3) itself as a block statement. Either way, say which.
- F2 (suggested). Location: connections page, Next investigation, "a negative outcome, a coloring defeating (P3) in every choice of , shows that a proof of the conjecture cannot pass through canonization over the lower blocks"; lead page, Next step 1, "A negative outcome shows that no proof passes through canonization over the lower blocks". Defect: the negative outcome refutes the realizability of the property carrying (P3), hence (C) for that and those blocks; it says nothing about other canonical forms, decompositions or parameter sets. Witness: none needed; the claim is a universal statement about proofs with no argument. Replacement: "shows that (C) fails for this on these blocks, so the route as formulated is closed; whether a weaker canonical form or another decomposition serves is not decided".
- F3 (suggested). Location: connections page, (P2) bullet, "inside which the relation cannot be applied again ( is not of that form)". Defect: false when for an infinite , a case the sentence's own hypothesis allows. Witness: , , , , . Replacement: "inside which the relation applies only when , and then yields a set of color of size , since ".
- F4 (note). Location: connections page, (P1) bullet, "Clause (3)'s heredity hypothesis is met by thinning alone and keeping "; lead page, "clause (3) removes the remaining dependence when its hypothesis holds". Defect: the property is not hereditary under same-size subsets in the reconstruction's reading, so clause (3) as stated does not apply; what is used, soundly, is the reconstruction's fiber argument with the thinning confined to (W2). Replacement: "the fiber argument of clause (3) applies with the thinning confined to , which keeps ; the heredity hypothesis of (3) as stated is not needed".
- F5 (note). Location: connections page, after the endgame proof, "it shows that the case , cannot be handled without the ". Defect: violates hypothesis (ii) of the endgame lemma, so it defeats no implication the section states. Replacement: "it shows that the canonical values on the alone do not decide that case: realizes , with no color- four-element set and no color- set of the form ".
- F6 (note). Location: connections page, (P2) bullet, "By (1A) at with and the first thinning of the lemma page". Defect: the first thinning is a proof-internal fact of the reconstruction, outside the interface (T1) lists; it is essential here, because must be phrased with the points available at stage . Replacement: add to (T1) the fact that every has the type of over , or cite the reconstruction's labeled fact by name.
- F7 (note). Location: connections page, (P2) bullet, "So (P2) needs a block statement of its own: in every of size , for every coloring of with at most colors"; Next investigation and lead Next step 1, the (P3) question "induced by an ". Defect: (BS2) quantifies over all colorings, stronger than the route needs, which is the one coloring determined by and the points ; and the (P3) question depends on the admissible lower sequence through , not on and alone. Replacement: "is supplied by" for "needs", and "for every admissible lower sequence and every full-size " in the (P3) question.
- F8 (note). Location: connections page, Outcome, "the lemma supplies (P1) under ". Defect: the realizability (H) behind (P1) also consumes the unheld relation , carried elsewhere on both pages but not in this sentence. Replacement: "supplies (P1) under and the imported triple relation".
Verdict
- S1: not a claim (the target). S2: not a claim (a definition).
- S3, the endgame lemma: refutation-failed.
- S4, the remark on the triples : refutation-failed, with the scope of (c) narrowed as in F5.
- S5, the application of (T1) with the properties : refutation-failed, conditionally on the imported relation , which is not held.
- S6, (P1) under : refutation-failed, with the wording of F4.
- S7, the reduction of (P2) to the constancy of : refutation-failed.
- S8a, the parenthetical "cannot be applied again": refuted-as-stated; its consequence S8b stands.
- S8b, the rest of the Erdős--Rado discussion and the need for (BS2): refutation-failed.
- S9a, no clause of the lemma reaches (P3): refutation-failed.
- S9b, "(P3) says that is constant": refuted-as-stated, witness in W1.
- S10, the counting obstruction for (P3): refutation-failed.
- S11, the falsification checks: refutation-failed.
- S12a, positive outcome plus (BS2) proves the conjecture under : proof defective; statement unresolved. The bridge is missing (F1); it is supplied for (P3) restricted to by the extra fiber step of W1, after which the corrected statement follows.
- S12b, a negative outcome excludes every proof through canonization over the lower blocks: proof defective; statement unresolved (F2).
- S13, the outcome sentence: refutation-failed as author-recorded, with the qualification of F8.
The lead page inherits these verdicts at the sentences that restate S3, S6, S7, S9b, S10 and S12; its provisional-premises list is accurate, and its standing sentences claim nothing beyond author-recorded.
Limitations. The relation and the Erdős--Rado and Ramsey relations are imported, not held, and were not verified beyond their statements; the attribution of the triple relation was not checked. The sentences that cite the problem page's dated search and assessment were not checked, as that text is excluded. The proofs of (T1), (T2), (T3) and of the reconstruction pages are other reviewers' subjects and were used only through their stated interfaces.
This focused review assigns no tier and changes no status.