Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Lezhe Gao, A finite-color partition relation for under , Theorem 3.1, stated on physical p. 3 and proved on physical pp. 3--4 (§3, "The main theorem"; the physical and printed page numbers agree), in the four-page PDF held by its library source card, Gao (2026); the corpus files the result as Theorem 3.1. The relation the proof imports is displayed as relation (1) on p. 2, and the lemma it uses is reconstructed on the Lemma 2.1 page.
Standing. This is an author-recorded reconstruction; it is not an independent review, changes no status and assigns no tier. The deposit is unrefereed. The argument is conditional on through one imported theorem whose proof is not held in the corpus (Theorem A below); the deductions the deposit itself makes are written out in full.
Definitions
The partition relation , colorings, homogeneous sets, triangles and order types are as defined on the Lemma 2.1 page.
Ordinal arithmetic. is the first uncountable ordinal. is the ordinal product , the order type of copies of laid end to end, equal to ; and . Ordinal multiplication by a fixed nonzero left factor is strictly increasing in the right factor, and , so . With von Neumann ordinals this makes a subset of , namely the set of ordinals below , and an initial segment of it: every element of below an element of belongs to . The order that inherits as a subset of is membership, the same as its own order, so its order type as a subset of is .
Martin's axiom for dense sets. states that for every partial order with the countable chain condition and every family of at most dense subsets of it there is a filter meeting every member of the family. It enters the argument only as the hypothesis of Theorem A; no forcing argument is made here. It implies , so it contradicts the continuum hypothesis.
Imported theorems
Theorem A (Baumgartner 1989, §3, the case ). Assume . Then
Exact version and provenance. The chapter Baumgartner (1989) is not held (paywalled). Its zbMATH review, Zbl 0703.03027, reports that §3 proves that makes and partition ordinals, that is, for every finite , and the held paper of Chen, Garti and Weinert restates the half in that form; the corpus files it as the main theorem. Gao's deposit cites the chapter for the case only, as its relation (1) on p. 2, and that case is all the proof below uses. Theorem A is consumed as an external input; its proof is not reconstructed, since its text is not held, and the whole argument is conditional on it.
Theorem B (Baumgartner and Hajnal 1987; not used in the proof). In ZFC,
the case of for regular with . The deposit's introduction (p. 2) names it as the case of the problem, already known in ZFC. It is not a premise of Theorem 3.1 and is recorded here only to fix the exact version behind that remark. The paper is not held; the statement is taken from its zbMATH review, Zbl 0635.03042, and from Komjáth 2025, and is filed as the positive relation.
Theorem C (Solovay and Tennenbaum 1971; the step from the theorem to the catalog status). If ZFC is consistent, then so is ZFC together with Martin's axiom and , and hence ZFC together with . The deposit does not state this step; the problem page uses it to pass from Theorem 3.1 to "not disprovable in ZFC". The paper is not held and is cited on the problem page as [SoTe71].
Statement
Assume . Then for every finite ,
every coloring of with the colors has a subset of of order type homogeneous in color , or a triangle of some color in .
Proof
Assume and fix a finite .
Step 1: the relation on . By Theorem A the ordinal satisfies . Lemma 2.1 with this gives
Step 2: restriction to the initial segment. Let be any coloring. Since , every two-element subset of is a two-element subset of , so is a coloring of with colors. Step 1 applied to gives either a set with and constantly on , or a three-element set on whose pairs is constant with a value in .
Step 3: reading the result in . The sets and are subsets of . The order they inherit from is membership, the same order they inherit from , so as a subset of , and agrees with on and on . Hence under either is a subset of of order type homogeneous in color , or is a triangle of some color in . The coloring was arbitrary, so the relation holds. This proves the theorem.
Step 2 uses only that is a subset of carrying the inherited order; that it is an initial segment is more than is needed. In general, if and has a subset of order type , then , by the same restriction and the transport fact of the lemma page.
Fidelity and scope
- The catalog question. The catalog asks the relation for all finite with triangle targets and colors. The theorem covers every . The instance is the one-color relation , which holds outright: under the only coloring with one color the subset of is homogeneous of order type . So, under , every instance of the catalog question has a positive answer.
- What is proved and what is not. The relation is proved from ; with Theorem C it is not disprovable in ZFC. It is not proved in ZFC, and Komjáth 2025 records the ZFC instance as unknown. The route cannot be run in ZFC: the continuum hypothesis gives (Erdős and Hajnal, as the review of Baumgartner 1989 reports), so Step 1 needs a hypothesis beyond ZFC even though the conclusion holds in ZFC for by Theorem B.
- A source qualification. The introduction (p. 2) says that the case "is exactly" relation (1). Read against Theorem 3.1, the case is , a theorem of ZFC that Komjáth 2025 attributes to Erdős and Hajnal (1970), whereas relation (1) is , the case of the intermediate relation of Step 1. The slip is confined to the introduction and does not affect the proof.
Depends on. Theorem A, imported with its proof not held, and Lemma 2.1; Theorem C is used only for the passage from the theorem to the catalog status.
Bears on. Problem 1171, as a conditional proof under whose status the page already records.