Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

../


Standings of two targets. Two passages below differ from the standings that the problem pages record. The section on Problem 1220 treats the problem as open and leaves the reported counterexample of Shelah and Stanley [170] to a status search; the problem page reads their Theorem 3, a consistent failure of the relation at ℵc+\aleph_{\mathfrak c^+}, which meets both hypotheses in ZFC, accepts it as the not-provable side and, with the positive answer of Erdős, Hajnal and Rado under GCH as the not-disprovable side, records the problem as independent; the strong-limit transfer and the type-count obstruction of that section are unaffected. The paragraph on the two wordings in the section on Problem 1218 takes the page's statement to be the earlier wording, with first target ℵβ+1\aleph_{\beta+1}; the problem page states the corrected relation, with first target ℵβ\aleph_\beta, which erdosproblems.com adopted on 7 September 2026 to fix a transcription error, and rejects Li's claim because it answers only the earlier wording, whose relation is a theorem of Erdős, Hajnal and Rado. The implication from Problem 1167 recorded in that section concerns the corrected relation and stands.

Scope. This page carries the mechanism reconstructed in Lemma 1.1 (canonization by types on fast-growing blocks) and Theorem 1.2 (the reduction of a coloring of pairs on ∑μ<λ2μ\sum_{\mu<\lambda}2^\mu to a coloring of pairs on cf⁡λ\operatorname{cf}\lambda), specialized in Corollary 1.3 to Problem 1219, to the other problems that use the same objects, and records for each what the transfer gives, what it does not give, and why. Every statement here is author-recorded, no problem status changes, and no tier is assigned. The statements were independently reviewed as they stood on 2026-09-28T13:50:48Z by seven focused reviews graded in the connections grade, which passes all seven and accepts fourteen corrections, since applied. Since the review, the Target paragraph of the Problem 1219 section and the Conjecture 1A section's reference to the problem page's search were restated against the current problem page without dates; this touches no examined statement, proof, code or input. Sources are cited at the standing their library pages record; the survey of Komjáth 2025 is read from its held conversion, and reading outside the held corpus is limited to the erdosproblems.com pages named in each section. Notation is that of the theorem page: θ→(μ0,…,μk−1)r\theta\to(\mu_0,\ldots,\mu_{k-1})^r for cardinals, (ρ)γ(\rho)_\gamma for γ\gamma repetitions of the target ρ\rho, and χ=∑μ<λ2μ\chi=\sum_{\mu<\lambda}2^\mu. A block decomposition of a set XX is a partition X=⨆i<κXiX=\bigsqcup_{i<\kappa}X_i into κ\kappa pieces.

Tools

Three facts are used below. The first restates what Theorem 1.2's proof consumes from the lemma, so that later sections can apply it without repeating the verification; the other two are recorded here with their proofs.

(T1) The lemma's interface. Let κ\kappa be an infinite regular cardinal, let μ(i)\mu(i) (i<κi<\kappa) be infinite cardinals, strictly increasing, with μ(0)≥κ\mu(0)\ge\kappa and 2μ(i)2^{\mu(i)} strictly increasing, let λi=(2μ(i))+\lambda_i=(2^{\mu(i)})^+, let AiA_i be pairwise disjoint sets with ∣Ai∣=λi|A_i|=\lambda_i, and let F:An→2F:A^n\to2 be a function of finitely many places on A=⋃iAiA=\bigcup_iA_i. Then Lemma 1.1 applies with its χ=2\chi=2, F0=F1=FF_0=F_1=F, these λi\lambda_i, μ(i)\mu(i) and AiA_i, and any properties PαP_\alpha satisfying its realizability hypothesis (H): Step 2(a) and Step 5 of the theorem page verify the regularity and monotonicity of the λi\lambda_i, the growth condition and 22+κ<λ02^{2+\kappa}<\lambda_0 from exactly these assumptions (Step 5 uses μ(0)≥κ\mu(0)\ge\kappa, ∣j∣≤μ(j)|j|\le\mu(j), the strict increase of the powers and the infinitude of each μ(i)\mu(i), and nothing about λ\lambda). Its conclusion gives ai∗∈Aia^*_i\in A_i and Bi⊆AiB_i\subseteq A_i with ∣Bi∣≤μ(i)|B_i|\le\mu(i), clauses (1A), (1B) and (2), and for two-place FF the canonical form F(b,c)=F(b′,c′)F(b,c)=F(b',c') for b,b′∈Bαb,b'\in B_\alpha, c,c′∈Bβc,c'\in B_\beta, α<β\alpha<\beta, as in Step 6.

(T2) Composition with a witness at the cofinality. Let λ\lambda be a singular cardinal, κ=cf⁡λ\kappa=\operatorname{cf}\lambda, γ≥1\gamma\ge1, and let ρν≥2\rho_\nu\ge2 (ν<γ\nu<\gamma) be cardinals with κ↛(κ,(ρν)ν<γ)2\kappa\not\to(\kappa,(\rho_\nu)_{\nu<\gamma})^2. Then λ↛(λ,(ρν)ν<γ)2\lambda\not\to(\lambda,(\rho_\nu)_{\nu<\gamma})^2.

Proof. Fix a witness c:[κ]2→1+γc:[\kappa]^2\to1+\gamma and a block decomposition λ=⨆i<κXi\lambda=\bigsqcup_{i<\kappa}X_i with ∣Xi∣<λ|X_i|<\lambda. Color a pair inside one XiX_i with 00 and a pair {x,y}\{x,y\} with x∈Xix\in X_i, y∈Xjy\in X_j, i≠ji\ne j, with c({i,j})c(\{i,j\}). Let HH be homogeneous in color 00 with ∣H∣=λ|H|=\lambda and J={i:H∩Xi≠∅}J=\{i:H\cap X_i\ne\emptyset\}. If ∣J∣<κ|J|<\kappa then JJ is bounded in the regular κ\kappa, so HH lies in fewer than cf⁡λ\operatorname{cf}\lambda sets of size less than λ\lambda and ∣H∣<λ|H|<\lambda; hence ∣J∣=κ|J|=\kappa, and JJ is cc-homogeneous in color 00, a contradiction. Let HH be homogeneous in a color 1+ν1+\nu with ∣H∣=ρν|H|=\rho_\nu. Pairs inside a block have color 00, so HH meets each block in at most one point, ∣J∣=ρν|J|=\rho_\nu, and JJ is cc-homogeneous in color 1+ν1+\nu, a contradiction. □\square

The case γ=1\gamma=1, ρ0=ℵ1\rho_0=\aleph_1 is the necessity remark Komjáth prints under Problem 4 (p. 419); the case γ=ℵ0\gamma=\aleph_0, ρν=3\rho_\nu=3 is used for Problem 1218 below.

(T3) The converse of Theorem 1.2 at the cofinality. Let λ\lambda be singular with κ=cf⁡λ\kappa=\operatorname{cf}\lambda, suppose ⟨2μ:μ<λ⟩\langle2^\mu:\mu<\lambda\rangle is not eventually constant, and suppose κ↛(κ)22\kappa\not\to(\kappa)^2_2. Then χ↛(λ)22\chi\not\to(\lambda)^2_2.

Proof. Choose cardinals μ(i)<λ\mu(i)<\lambda (i<κi<\kappa), strictly increasing and cofinal in λ\lambda, with 2μ(i)2^{\mu(i)} strictly increasing; Step 1 of the theorem page does this from the non-constancy alone, the bound μ0\mu_0 being unnecessary here. Since 2μ≥μ+2^\mu\ge\mu^+, the powers are cofinal in λ\lambda, so sup⁡μ<λ2μ≥λ\sup_{\mu<\lambda}2^\mu\ge\lambda and, by the sum formula of the theorem page, χ=sup⁡μ<λ2μ=sup⁡i2μ(i)=∑i<κ2μ(i)\chi=\sup_{\mu<\lambda}2^\mu=\sup_i2^{\mu(i)}=\sum_{i<\kappa}2^{\mu(i)}, the last step because the sum has κ\kappa terms with supremum at least κ\kappa. Take a block decomposition χ=⨆i<κXi\chi=\bigsqcup_{i<\kappa}X_i with ∣Xi∣=2μ(i)|X_i|=2^{\mu(i)}, on each XiX_i a Sierpiński coloring eie_i of [Xi]2[X_i]^2 with no homogeneous set of size μ(i)+\mu(i)^+ ((S) on the theorem page), and a witness cc for κ↛(κ)22\kappa\not\to(\kappa)^2_2; color a pair inside XiX_i by eie_i and a pair across blocks i≠ji\ne j by c({i,j})c(\{i,j\}). Let HH be homogeneous in a color ν\nu with ∣H∣=λ|H|=\lambda, and JJ as before. Each H∩XiH\cap X_i is eie_i-homogeneous, so ∣H∩Xi∣≤μ(i)|H\cap X_i|\le\mu(i). If ∣J∣<κ|J|<\kappa, then JJ is bounded by some i0<κi_0<\kappa and ∣H∣≤∑i<i0μ(i)≤∣i0∣⋅μ(i0)<λ|H|\le\sum_{i<i_0}\mu(i)\le|i_0|\cdot\mu(i_0)<\lambda, since λ\lambda is a limit cardinal; so ∣J∣=κ|J|=\kappa, and choosing one point of HH in each block of JJ shows that JJ is cc-homogeneous in color ν\nu, a contradiction. □\square

Problem 1219 beyond the catalog question

Target. Problem 1219 (status solved, claim proved; its Current assessment rests on Corollary 1.3, with Komjáth's survey as the acceptance record). Its Known Results record, from erdosproblems.com and not from a held source, that with ℵκ\aleph_\kappa in place of ℵω\aleph_\omega the answer is yes for κ<ω\kappa<\omega and no for κ>ω\kappa>\omega; and they record Hajnal's Conjecture 1A as a separate open question, treated in its own section below.

What transfers. Theorem 1.2 is already the general form, and (T3) is its converse at the cofinality. Together with two classical facts they give the exact dividing line (author-recorded): for a singular cardinal λ\lambda,

∑μ<λ2μ→(λ)22  ⟺  {2μ≥λ for some μ<λ,⟨2μ:μ<λ⟩ is not eventually constant, andcf⁡λ→(cf⁡λ)22.\sum_{\mu<\lambda}2^\mu\to(\lambda)^2_2 \iff \begin{cases} 2^\mu\ge\lambda\text{ for some }\mu<\lambda,\\ \langle2^\mu:\mu<\lambda\rangle\text{ is not eventually constant, and}\\ \operatorname{cf}\lambda\to(\operatorname{cf}\lambda)^2_2 . \end{cases}

The direction from right to left is Theorem 1.2: the first condition is "eventually ≥λ\ge\lambda", since μ↦2μ\mu\mapsto2^\mu is nondecreasing. For the other direction: if 2μ<λ2^\mu<\lambda for every μ<λ\mu<\lambda, then χ=λ\chi=\lambda by the sum formula, and λ↛(λ)22\lambda\not\to(\lambda)^2_2 for every singular λ\lambda (color a pair by whether its points lie in the same piece of a block decomposition into cf⁡λ\operatorname{cf}\lambda pieces of size below λ\lambda, the coloring on the theorem's result page); if the powers are eventually constant with value 2μ0≥λ2^{\mu_0}\ge\lambda, then χ=2μ0\chi=2^{\mu_0} and Sierpiński's 2μ0↛(μ0+)222^{\mu_0}\not\to(\mu_0^+)^2_2 with μ0+≤λ\mu_0^+\le\lambda gives χ↛(λ)22\chi\not\to(\lambda)^2_2; and if the first two conditions hold but the third fails, (T3) applies. Since an uncountable regular κ\kappa satisfies κ→(κ)22\kappa\to(\kappa)^2_2 exactly when it is weakly compact, the third condition says that cf⁡λ\operatorname{cf}\lambda is ω\omega or weakly compact. In particular ∑μ<ℵω12μ↛(ℵω1)22\sum_{\mu<\aleph_{\omega_1}}2^\mu\not\to(\aleph_{\omega_1})^2_2 in ZFC, whatever the powers do, while for λ=ℵω+ω\lambda=\aleph_{\omega+\omega}, of countable cofinality, the relation holds exactly when the sequence ⟨2ℵω+n:n<ω⟩\langle2^{\aleph_{\omega+n}}:n<\omega\rangle is not eventually constant and some 2ℵω+n2^{\aleph_{\omega+n}} is at least λ\lambda (then above it, since cf⁡2μ>μ≥ℵ0=cf⁡λ\operatorname{cf}2^\mu>\mu\ge\aleph_0=\operatorname{cf}\lambda); in the form Bloom's catalog prints the problem, with ℵκ\aleph_\kappa in place of ℵω\aleph_\omega, the sum ∑k2ℵnk\sum_k2^{\aleph_{n_k}} keeps its integer indices and the erdosproblems.com bullet is a theorem of ZFC on both sides: for κ>ω\kappa>\omega, blocks of size 2ℵnk2^{\aleph_{n_k}} carrying Sierpiński colorings, with one color across blocks, admit no homogeneous set of size ℵω+1\aleph_{\omega+1} (a homogeneous set in the across-block color meets each block in at most ℵnk\aleph_{n_k} points, so has size at most ℵω\aleph_\omega; one in the other color lies inside one block), so ∑k2ℵnk↛(ℵω+1)22\sum_k2^{\aleph_{n_k}}\not\to(\aleph_{\omega+1})^2_2 whatever the powers are; for κ<ω\kappa<\omega, the relation (ER) of the theorem page at a block with nk≥κn_k\ge\kappa gives (2ℵnk)+→(ℵnk+1)22(2^{\aleph_{n_k}})^+\to(\aleph_{n_k+1})^2_2 with ℵnk+1>ℵκ\aleph_{n_k+1}>\aleph_\kappa and (2ℵnk)+≤∑k2ℵnk(2^{\aleph_{n_k}})^+\le\sum_k2^{\aleph_{n_k}}. The characterization above concerns the different sum ∑μ<ℵκ2μ\sum_{\mu<\aleph_\kappa}2^\mu, for which the answer at κ=ω+ω\kappa=\omega+\omega is yes under consistent cardinal arithmetic (for instance 2ℵω+n=ℵω+ω+n+12^{\aleph_{\omega+n}}=\aleph_{\omega+\omega+n+1} for 1≤n<ω1\le n<\omega, an Easton pattern) and no in ZFC at κ=ω1\kappa=\omega_1; the source erdosproblems.com attributes the bullet to ([ErHa71], p. 20, not held) should be read before the bullet is recorded in either form.

Falsification checks. (T3) carries the non-constancy hypothesis only to match Theorem 1.2's: its proof takes the μ(i)\mu(i) from Step 1 but uses nothing about the powers beyond ∑i<κ2μ(i)=χ\sum_{i<\kappa}2^{\mu(i)}=\chi, which the sum formula gives for any strictly increasing cofinal ⟨μ(i)⟩\langle\mu(i)\rangle of infinite cardinals, since sup⁡i2μ(i)=sup⁡μ<λ2μ=χ>κ\sup_i2^{\mu(i)}=\sup_{\mu<\lambda}2^\mu=\chi>\kappa; so its conclusion holds for every singular λ\lambda with cf⁡λ↛(cf⁡λ)22\operatorname{cf}\lambda\not\to(\operatorname{cf}\lambda)^2_2, and when the powers are eventually constant it also comes from Sierpiński alone, so the case split loses nothing. The Sierpiński colorings are used at μ(i)+≤λ\mu(i)^+\le\lambda, where they exclude homogeneous sets of size λ\lambda inside a block, which is the only place the argument differs from (T2). The regular case is outside this page: for uncountable regular λ\lambda the relation reduces to λ\lambda weakly compact (at λ=ω\lambda=\omega it is Ramsey's theorem) and is not touched by the mechanism.

Outcome. Transfers, as a by-product: the converse (T3) and the characterization above; no lead, since Problem 1219 is proved and the characterization has no open case.

Problem 1220: the singular unbalanced relation

Target. Problem 1220 (status open, no compiled assessment) asks whether λ→(λ,ℵ1)2\lambda\to(\lambda,\aleph_1)^2 for every singular λ\lambda such that λ\lambda and cf⁡λ\operatorname{cf}\lambda are both ℵ0\aleph_0-inaccessible, that is, μℵ0<λ\mu^{\aleph_0}<\lambda for μ<λ\mu<\lambda and likewise for cf⁡λ\operatorname{cf}\lambda. It is Problem 4 of the Erdős--Hajnal list. Komjáth's commentary (pp. 419--420, read in the held conversion) records: the hypotheses are necessary, by τℵ0↛(τ+,ℵ1)2\tau^{\aleph_0}\not\to(\tau^+,\aleph_1)^2 and by (T2); the simplest case is λ=ℵc+\lambda=\aleph_{\mathfrak c^+}, where the hypothesis on cf⁡λ=c+\operatorname{cf}\lambda=\mathfrak c^+ implies the one on λ\lambda by a theorem of Shelah, so that this λ\lambda satisfies the hypotheses in ZFC; an Erdős--Rado theorem ([45, Theorem 35.4] in the survey's numbering) gives the positive relation when ℵc+\aleph_{\mathfrak c^+} is strong limit; Shelah and Stanley ([170]) constructed a forcing that adds a counterexample to ℵc+→(ℵc+,ℵ1)2\aleph_{\mathfrak c^+}\to(\aleph_{\mathfrak c^+},\aleph_1)^2 while preserving the powers below a prescribed μ<ℵc+\mu<\aleph_{\mathfrak c^+}; and ([171]) from c+\mathfrak c^+ measurable cardinals they obtained a model where ℵc+\aleph_{\mathfrak c^+} is not strong limit and the relation holds. None of [45], [170], [171] is held. If the summary of [170] is accurate, the universal question, read as a question of ZFC, has a consistent negative answer at λ=ℵc+\lambda=\aleph_{\mathfrak c^+}, and the erdosproblems.com label open should be re-examined by a status search before anything is recorded on the problem page. The erdosproblems.com page (accessed 2026-09-28; last edited 1 September 2026) states the problem, the necessity of the conditions and the simplest case, and lists one proof claim in its forum, not read here.

What transfers: the strong-limit case. The mechanism reduces the relation to its cofinality exactly when λ\lambda is strong limit. The transfer lemma (author-recorded):

Let λ\lambda be a singular strong limit cardinal, κ=cf⁡λ\kappa=\operatorname{cf}\lambda, and θ≤κ\theta\le\kappa a cardinal with κ→(κ,θ)2\kappa\to(\kappa,\theta)^2. Then λ→(λ,θ)2\lambda\to(\lambda,\theta)^2.

Proof. Let f:[λ]2→2f:[\lambda]^2\to2 and suppose ff has no homogeneous set of size θ\theta in color 11; a homogeneous set of size λ\lambda in color 00 is to be found. Since 2μ≥μ+2^\mu\ge\mu^+ for μ<λ\mu<\lambda, the powers below λ\lambda are not eventually constant, so Step 1 of the theorem page, run without its bound μ0\mu_0, gives infinite cardinals μ(i)<λ\mu(i)<\lambda (i<κi<\kappa), strictly increasing and cofinal in λ\lambda, with μ(0)≥κ\mu(0)\ge\kappa and 2μ(i)2^{\mu(i)} strictly increasing. Put λi=(2μ(i))+\lambda_i=(2^{\mu(i)})^+; as λ\lambda is strong limit, λi<λ\lambda_i<\lambda, and ∑i<κλi=λ\sum_{i<\kappa}\lambda_i=\lambda by the sum formula, so λ\lambda has a block decomposition ⨆i<κAi\bigsqcup_{i<\kappa}A_i with ∣Ai∣=λi|A_i|=\lambda_i. For α<κ\alpha<\kappa let PαP_\alpha say that BαB_\alpha is homogeneous in color 00 with ∣Bα∣=μ(α)|B_\alpha|=\mu(\alpha). (H) holds: for C⊆AαC\subseteq A_\alpha with ∣C∣=λα|C|=\lambda_\alpha, the relation (ER) of the theorem page with μ=μ(α)\mu=\mu(\alpha), transported to CC, gives a homogeneous set of size λα\lambda_\alpha in color 00 or one of size μ(α)+≥κ≥θ\mu(\alpha)^+\ge\kappa\ge\theta in color 11; the second is excluded, and a subset of the first of size μ(α)\mu(\alpha) serves. By (T1) with the two-place f~\tilde f of Step 5, the lemma gives Bα⊆AαB_\alpha\subseteq A_\alpha with ∣Bα∣=μ(α)|B_\alpha|=\mu(\alpha), homogeneous in color 00, and a well-defined g:[κ]2→2g:[\kappa]^2\to2 with g({α,β})=f({b,c})g(\{\alpha,\beta\})=f(\{b,c\}) for b∈Bαb\in B_\alpha, c∈Bβc\in B_\beta, α<β\alpha<\beta. Apply κ→(κ,θ)2\kappa\to(\kappa,\theta)^2 to gg. If I⊆κI\subseteq\kappa with ∣I∣=κ|I|=\kappa is gg-homogeneous in color 00, then B=⋃α∈IBαB=\bigcup_{\alpha\in I}B_\alpha is ff-homogeneous in color 00, by the argument of Step 7, and ∣B∣=∑α∈Iμ(α)=λ|B|=\sum_{\alpha\in I}\mu(\alpha)=\lambda, as there. If J⊆κJ\subseteq\kappa with ∣J∣=θ|J|=\theta is gg-homogeneous in color 11, choose bα∈Bαb_\alpha\in B_\alpha for α∈J\alpha\in J; distinct bα,bβb_\alpha,b_\beta lie in distinct blocks and f({bα,bβ})=g({α,β})=1f(\{b_\alpha,b_\beta\})=g(\{\alpha,\beta\})=1, so {bα:α∈J}\{b_\alpha:\alpha\in J\} is homogeneous in color 11 of size θ\theta, which was excluded. □\square

With θ=ℵ1\theta=\aleph_1: if λ\lambda is singular strong limit and cf⁡λ→(cf⁡λ,ℵ1)2\operatorname{cf}\lambda\to(\operatorname{cf}\lambda,\aleph_1)^2, then λ→(λ,ℵ1)2\lambda\to(\lambda,\aleph_1)^2, and with (T2) the two relations are equivalent for strong limit λ\lambda. For a regular ℵ0\aleph_0-inaccessible κ\kappa the hypothesis κ→(κ,ℵ1)2\kappa\to(\kappa,\aleph_1)^2 is the Erdős--Rado theorem for pairs (for successor κ=a+\kappa=a^+ it is Theorem 7(i) of the held Erdős and Rado (1956), printed p. 432, PDF p. 6: a+→(b,a+)2a^+\to(b,a^+)^2 for the least bb with ab>aa^b>a, and aℵ0=aa^{\aleph_0}=a forces b≥ℵ1b\ge\aleph_1; the regular limit case is not held; the regular case is not what the problem asks), so the transfer lemma proves the strong-limit case of the problem, whose instance λ=ℵc+\lambda=\aleph_{\mathfrak c^+} Komjáth attributes to [45, Theorem 35.4]; [45] is not held, so how much of the case its theorem covers is not checked here, and nothing new is claimed.

What does not transfer, and why. For λ\lambda that is ℵ0\aleph_0-inaccessible but not strong limit, the mechanism is blocked at its type count. The sets BiB_i must have sizes μ(i)\mu(i) cofinal in λ\lambda, so the parameter sets Eα=⋃i<αBiE_\alpha=\bigcup_{i<\alpha}B_i have sizes cofinal in λ\lambda; the number of types over EαE_\alpha is 2∣Eα∣2^{|E_\alpha|} in general (bound (A) on the lemma page), and the second thinning needs it below the block size λα<λ\lambda_\alpha<\lambda. If 2μ≥λ2^\mu\ge\lambda for some μ<λ\mu<\lambda, then 2∣Eα∣≥λ2^{|E_\alpha|}\ge\lambda for every α\alpha with ∣Eα∣≥μ|E_\alpha|\ge\mu, and the count that the second thinning of the lemma page uses no longer yields a fiber of size λα\lambda_\alpha. Choosing the μ(i)\mu(i) below the least such μ\mu keeps the count but bounds sup⁡iμ(i)<λ\sup_i\mu(i)<\lambda, so the final set is too small. This is an obstruction to the counting of Lemma 1.1 over full parameter sets, not to canonization as such and not a proof of the negative relation; the consistent counterexample of [170] and the consistent positive answer of [171] at a non-strong-limit ℵc+\aleph_{\mathfrak c^+}, both as reported by Komjáth, show that the open part is not decided by cardinal arithmetic of this kind, and any proof must use the ℵ0\aleph_0-inaccessibility of λ\lambda in a way that does not pass through 2∣Eα∣2^{|E_\alpha|}. The finite-color variant λ→(λ,(ℵ1)k)2\lambda\to(\lambda,(\aleph_1)_k)^2 would follow from a positive answer by the color-merging induction of the Problem 1171 connections page, as that page notes; it is not a route.

Next investigation. (i) Acquire Shelah and Stanley [170] and [171] and record on the problem page what is proved: whether the model of [170] keeps both ℵ0\aleph_0-inaccessibility hypotheses, which decides whether the universal question is independent of ZFC, and what [171] assumes. (ii) If the question survives as a ZFC question for some class of λ\lambda, the obstruction above says the proof cannot canonize over parameter sets of size μ\mu with 2μ≥λ2^\mu\ge\lambda; a positive outcome would need a canonization that uses only countable parameter sets, which ℵ0\aleph_0-inaccessibility can count, and a negative outcome is a counterexample of the [170] kind.

Outcome. Transfers to the strong-limit case, proved through the lemma from the Erdős--Rado theorem for pairs at the cofinality; fails beyond it, with the type-count obstruction; no lead, since the open part is exactly where the mechanism is blocked and its status needs a source-level search first.

Hajnal's Conjecture 1A: triples

Target. The stronger question recorded on Problem 1219's page and on the paper's Conjecture 1A page: under ℵω<2ℵn(0)<2ℵn(1)<⋯\aleph_\omega<2^{\aleph_{n(0)}}<2^{\aleph_{n(1)}}<\cdots,

χ=∑n<ω2ℵn→(ℵω,4)3,\chi=\sum_{n<\omega}2^{\aleph_n}\to(\aleph_\omega,4)^3 ,

that is, every f:[χ]3→2f:[\chi]^3\to2 has a homogeneous set of size ℵω\aleph_\omega in color 00 or a homogeneous 44-element set in color 11. Shelah's Remark (p. 1261) asserts χ↛(ℵω,5)3\chi\not\to(\aleph_\omega,5)^3 without proof; Komjáth (p. 419) records the conjecture as unproven; the search recorded on the problem page found nothing later. It is not an erdosproblems.com problem, and its status is not tracked by a problem page.

What transfers: the endgame. Keep the blocks AiA_i (i<ωi<\omega) of Step 2 of the theorem page for λ=ℵω\lambda=\aleph_\omega, with ∣Ai∣=λi=(2μ(i))+|A_i|=\lambda_i=(2^{\mu(i)})^+ and the μ(i)\mu(i) of Step 1, so that χ=⨆iAi\chi=\bigsqcup_iA_i. For a triple {x,y,z}\{x,y,z\} meeting the blocks i≤j≤ki\le j\le k call (i,j,k)(i,j,k) its pattern. The mechanism's final step, the Ramsey argument on canonical values, survives the passage to triples in the following form. Say that ff satisfies the canonization statement (C) when there are sets Si,Ti⊆AiS_i,T_i\subseteq A_i (i<ωi<\omega) with ∣Si∣=μ(i)|S_i|=\mu(i), ff constantly 00 on [Si]3[S_i]^3, TiT_i a triple with f(Ti)=1f(T_i)=1, such that with Bi=Si∪TiB_i=S_i\cup T_i:

  • (P1) for i<j<ki<j<k, f({a,b,c})f(\{a,b,c\}) takes one value g(i,j,k)g(i,j,k) for all a∈Sia\in S_i, b∈Sjb\in S_j, c∈Skc\in S_k;
  • (P2) for i<ji<j, f({a,a′,b})f(\{a,a',b\}) takes one value h2(i,j)h_2(i,j) for all {a,a′}∈[Bi]2\{a,a'\}\in[B_i]^2 and b∈Bjb\in B_j;
  • (P3) for i<ji<j, f({a,b,b′})f(\{a,b,b'\}) takes one value h1(i,j)h_1(i,j) for all a∈Sia\in S_i and {b,b′}∈[Bj]2\{b,b'\}\in[B_j]^2.

Endgame lemma (author-recorded). Suppose every f:[χ]3→2f:[\chi]^3\to2 that has no homogeneous 44-set in color 11 and no homogeneous set of size ℵω\aleph_\omega in color 00 inside a single block satisfies (C). Then Conjecture 1A holds.

Proof. Let f:[χ]3→2f:[\chi]^3\to2. If ff has a homogeneous 44-set in color 11, or a block contains a homogeneous set of size ℵω\aleph_\omega in color 00, there is nothing to prove; otherwise take Si,Ti,g,h1,h2S_i,T_i,g,h_1,h_2 from (C). Ramsey's theorem for triples, ω→(ω)23\omega\to(\omega)^3_2, gives an infinite I⊆ωI\subseteq\omega on which gg is constant, say ε\varepsilon, and Ramsey's theorem for pairs, applied twice, an infinite I′⊆II'\subseteq I on which h1h_1 and h2h_2 are constant, say η1\eta_1 and η2\eta_2. Five cases, the second of which is covered by the first and third. If ε=1\varepsilon=1: one point of SiS_i for each of four indices i∈I′i\in I' gives a 44-set all of whose triples have pattern (i,j,k)(i,j,k) with i<j<ki<j<k and color 11. If η1=η2=1\eta_1=\eta_2=1: for i<ji<j in I′I', two points of SiS_i and two of SjS_j give a 44-set whose triples have patterns (i,i,j)(i,i,j) and (i,j,j)(i,j,j), all of color 11. If η2=1\eta_2=1 and ε=0\varepsilon=0: for i<ji<j in I′I', TiT_i together with one point of BjB_j is a 44-set, its triple TiT_i of color 11 and its other three triples of pattern (i,i,j)(i,i,j) and color h2(i,j)=1h_2(i,j)=1. If η1=1\eta_1=1 and ε=0\varepsilon=0: one point of SiS_i together with TjT_j, by (P3) at the pairs of TjT_j. In the remaining case ε=η1=η2=0\varepsilon=\eta_1=\eta_2=0, and B=⋃i∈I′SiB=\bigcup_{i\in I'}S_i is homogeneous in color 00: a triple inside one SiS_i has color 00 by the choice of SiS_i, and the other triples have patterns (i,i,j)(i,i,j), (i,j,j)(i,j,j) or (i,j,k)(i,j,k) with values η2\eta_2, η1\eta_1, ε\varepsilon. As I′I' is infinite, ∣B∣=∑i∈I′μ(i)=ℵω|B|=\sum_{i\in I'}\mu(i)=\aleph_\omega as in Step 7. □\square

The triples TiT_i enter only through the two mixed cases; they are what the hypothesis "no color-00 set of size ℵω\aleph_\omega inside a block" buys, since under it every subset of AiA_i of size λi>ℵω\lambda_i>\aleph_\omega contains a triple of color 11. The coloring that gives color 11 exactly to the triples of pattern (i,i,j)(i,i,j), i<ji<j, has no homogeneous 44-set in color 11, and its homogeneous sets of size ℵω\aleph_\omega in color 00 lie, up to finitely many points, inside a single block; it shows that the case η2=1\eta_2=1, ε=0\varepsilon=0 cannot be handled without the TiT_i.

What the lemma gives toward (C). Apply (T1) with the three-place f~\tilde f extending ff symmetrically (and by 00 on tuples with a repeated entry), with properties PiP_i that realize SiS_i and TiT_i inside every full-size subset of AiA_i, as (H) realizes the two homogeneous sets for pairs, with (2μ)+→(μ+,4)3(2^\mu)^+\to(\mu^+,4)^3 in place of (ER), together with whatever (P2) turns out to need. Then:

  • (P1) up to its lowest point. By (1B) with aˉ=(a)\bar a=(a), for i<j<ki<j<k, a∈Bia\in B_i, b,b′∈Bjb,b'\in B_j, c,c′∈Bkc,c'\in B_k: f({a,b,c})=f({a,b′,c′})f(\{a,b,c\})=f(\{a,b',c'\}). The dependence on aa is what clause (3) removes, by passing to a fiber of a↦⟨f({a,b,c}):i<j<k⟩a\mapsto\langle f(\{a,b,c\}):i<j<k\rangle inside SiS_i, a map with at most 2ℵ02^{\aleph_0} values; the fiber has size μ(i)\mu(i) when 2ℵ0<μ(i)2^{\aleph_0}<\mu(i), the reading of the hypothesis 2χ+κ<cf⁡μ(i)2^{\chi+\kappa}<\operatorname{cf}\mu(i) here. That can be arranged, by starting Step 1 above 2ℵ02^{\aleph_0}, exactly when 2ℵ0<ℵω2^{\aleph_0}<\aleph_\omega; the conjecture's hypothesis allows 2ℵ0>ℵω2^{\aleph_0}>\aleph_\omega, and then the fiber argument fails. Clause (3)'s heredity hypothesis fails for the property with TiT_i, since a same-size subset of BiB_i may omit the triple; its fiber argument applies to SiS_i alone, with TiT_i kept, since (P1) is asked on the SiS_i.
  • (P2) up to the pair. By (1A) at jj with aˉ=(a,a′)\bar a=(a,a') and the first thinning of the lemma page, which gives bb and aj∗a^*_j the same type over EjE_j, f({a,a′,b})=f({a,a′,aj∗})f(\{a,a',b\})=f(\{a,a',a^*_j\}) for b∈Bjb\in B_j; so (P2) says that ci({a,a′})=⟨f({a,a′,aj∗}):j>i⟩c_i(\{a,a'\})=\langle f(\{a,a',a^*_j\}):j>i\rangle, a coloring of [Bi]2[B_i]^2 with at most 2ℵ02^{\aleph_0} colors, is constant on [Bi]2[B_i]^2. The lemma's thinnings fix the types of single elements over DiD_i and never look at two elements of one block, so this must be built into PiP_i and realized inside every C⊆AiC\subseteq A_i of size λi\lambda_i. The Erdős--Rado relation (2μ)+→(μ+)μ2(2^\mu)^+\to(\mu^+)^2_\mu (Theorem 39(i) of the held Erdős and Rado (1956) with r=1r=1) gives, when 2ℵ0≤μ(i)2^{\aleph_0}\le\mu(i), a cic_i-homogeneous C′⊆CC'\subseteq C of size μ(i)+\mu(i)^+, inside which the relation (2μ)+→(μ+,4)3(2^\mu)^+\to(\mu^+,4)^3 helps no further (it applies only when μ(i)=2ν\mu(i)=2^\nu for some ν\nu, and then 2ν<ℵω≤2μ02^\nu<\aleph_\omega\le2^{\mu_0} gives ν+≤μ0<μ(i)\nu^+\le\mu_0<\mu(i), so it yields a color-00 set of size ν+<μ(i)\nu^+<\mu(i) only), and inside which a color-11 triple is not guaranteed, because ∣C′∣<λi|C'|<\lambda_i; a cic_i-homogeneous set of size λi\lambda_i cannot be asked, as λi\lambda_i is a successor cardinal. So (P2) needs a block statement of its own: in every C⊆AiC\subseteq A_i of size λi\lambda_i, for the coloring cic_i induced by ff against any choice of higher points, jointly with the coloring did_i of the (P3) bullet, a set S∪TS\cup T as in (C) on which that coloring is constant, or a homogeneous 44-set of ff in color 11. Open here.
  • (P3) not at all. With {b,b′}⊆Bj\{b,b'\}\subseteq B_j and a∈Eja\in E_j, neither bb nor b′b' is a parameter of the other's type, and no clause of the lemma relates f({a,b,b′})f(\{a,b,b'\}) to anything. (P3) implies that the restriction of dj({b,b′})=⟨f({a,b,b′}):a∈Ej⟩d_j(\{b,b'\})=\langle f(\{a,b,b'\}):a\in E_j\rangle, a coloring of [Bj]2[B_j]^2 with at most 2∣Ej∣=2μ(j−1)2^{|E_j|}=2^{\mu(j-1)} colors, to the coordinates a∈⋃i<jSia\in\bigcup_{i<j}S_i is constant, and asks in addition that its common value vjv_j be constant on each SiS_i, i<ji<j; the route needs the converse direction, constancy of all of djd_j, which is what the lemma's property must realize. Constancy of djd_j alone does not give this: if f({a,b,b′})=φ(a)f(\{a,b,b'\})=\varphi(a) on every triple of pattern (i,j,j)(i,j,j) with φ\varphi not constant on SiS_i, then djd_j is constant for every choice of BjB_j while (P3) fails. Once every djd_j is constant, the second demand follows by thinning each SiS_i to a fiber of a↦⟨vj(a):j>i⟩a\mapsto\langle v_j(a):j>i\rangle, a map with at most 2ℵ02^{\aleph_0} values, taken jointly with the fiber of (P1) under the same hypothesis 2ℵ0<μ(i)2^{\aleph_0}<\mu(i); the values vj(a)v_j(a) do not change when the SjS_j are thinned later. Here 2μ(j−1)≥2ℵn(0)>ℵω>μ(j)2^{\mu(j-1)}\ge2^{\aleph_{n(0)}}>\aleph_\omega>\mu(j) for every j≥1j\ge1, so the number of colors exceeds the target, and Erdős--Rado at the block size λj=(2μ(j))+\lambda_j=(2^{\mu(j)})^+ would need 2μ(j)≥22μ(j−1)2^{\mu(j)}\ge2^{2^{\mu(j-1)}}, a double-exponential growth the hypothesis does not supply; when 2μ(j)<22μ(j−1)2^{\mu(j)}<2^{2^{\mu(j-1)}} there are colorings of [λj]2[\lambda_j]^2 with 2μ(j−1)2^{\mu(j-1)} colors and no homogeneous triple (2θ↛(3)θ22^\theta\not\to(3)^2_\theta, as Komjáth notes under Problem 5). Making the earlier blocks smaller does not help, because the μ(i)\mu(i) must be cofinal in ℵω\aleph_\omega while every 2μ(i)2^{\mu(i)} with μ(i)≥ℵn(0)\mu(i)\ge\aleph_{n(0)} exceeds ℵω\aleph_\omega. Whether the particular djd_j induced by an ff without color-11 44-sets admits a homogeneous Sj∪TjS_j\cup T_j is the consequential gap.

Falsification checks. The endgame uses only the values on the BiB_i and the two Ramsey theorems; its four cases are exhaustive, since (ε,η1,η2)∈{0,1}3(\varepsilon,\eta_1,\eta_2)\in\{0,1\}^3 and every triple with a 11 is covered. The block sizes are those of Theorem 1.2, so (T1) applies verbatim; the printed Remark after Lemma 1.1, that the lemma could be refined along the lines of the paper's [7], § 5, may bear on (P3) and was not read. The three-color form of Theorem 1.2 says nothing here: it adds a color with target ω\omega to pairs, while the conjecture raises the exponent.

Next investigation. Attack (P3) first, since (P1) and (P2) reduce to cardinal arithmetic under 2ℵ0<ℵω2^{\aleph_0}<\aleph_\omega and a block statement of Erdős--Rado type, while (P3) has no such reduction: decide whether an ff without homogeneous 44-sets in color 11 forces the induced pair colorings djd_j to have homogeneous sets of size μ(j)\mu(j) containing a color-11 triple, in blocks of size (2μ(j))+(2^{\mu(j)})^+. A positive outcome for the joint block statement, realizing inside every full-size subset of AjA_j a set Sj∪TjS_j\cup T_j on which both djd_j and the (P2) coloring cjc_j are constant, with the fiber step of the (P3) bullet that makes the common value of each djd_j constant on the lower SiS_i, proves the conjecture under 2ℵ0<ℵω2^{\aleph_0}<\aleph_\omega by the endgame lemma; a negative outcome, a coloring ff defeating (P3) in every choice of the sets Si,TiS_i,T_i in all of the blocks, shows that (C) fails for this ff on these blocks, so the route as formulated is closed, while a weaker canonical form or another decomposition is not excluded; its ff is a candidate for a counterexample to be tested against the conjecture directly. In either case the imported inputs (2μ)+→(μ+,4)3(2^\mu)^+\to(\mu^+,4)^3 and ω→(ω)23\omega\to(\omega)^3_2 (Ramsey; Erdős, Hajnal and Rado 1965, neither held) should be located on their pages before the route is built on.

Outcome. Transfers conditionally: the endgame lemma reduces the conjecture to the canonization statement (C), of which the lemma supplies (P1) under 2ℵ0<ℵω2^{\aleph_0}<\aleph_\omega and half of (P2), and nothing of (P3). Filed as the lead triple canonization for Hajnal's conjecture.

Problem 1218: the negative triple relation under GCH

Target. Problem 1218 (status open, no compiled assessment) asks, under GCH and with β=ωω+1\beta=\omega_{\omega+1}, whether ℵβ+1↛(ℵβ+1,(4)ℵ0)3\aleph_{\beta+1}\not\to(\aleph_{\beta+1},(4)_{\aleph_0})^3; this is the erdosproblems.com wording of 2026-09-04, which the page carries, and it agrees with Komjáth's Problem 1 (p. 419), λ=κ0=ℵωω+1+1\lambda=\kappa_0=\aleph_{\omega_{\omega+1}+1}. The erdosproblems.com page (accessed 2026-09-28; last edited 7 September 2026) now prints ℵβ+1↛(ℵβ,(4)ℵ0)3\aleph_{\beta+1}\not\to(\aleph_\beta,(4)_{\aleph_0})^3, with the first target ℵβ\aleph_\beta rather than ℵβ+1\aleph_{\beta+1}, states the general Erdős--Hajnal--Rado conjecture

ℵβ+1↛(ℵβ,(4)ℵcr⁡(β))3\aleph_{\beta+1}\not\to(\aleph_\beta,(4)_{\aleph_{\operatorname{cr}(\beta)}})^3

for ordinals β\beta with β>cf⁡β>cf⁡β−1>cr⁡β\beta>\operatorname{cf}\beta>\operatorname{cf}\beta-1>\operatorname{cr}\beta, with β=ωω+1\beta=\omega_{\omega+1} the least such ordinal (the page does not define cr⁡\operatorname{cr}), cites [EHR65, p. 131], and lists one comment and one proof claim in its forum, not read here. The two wordings are different relations: erdosproblems.com's current one is the stronger negative statement, and it implies the page's by weakening the first target. Which one the sources state is for the problem page's status search to settle; both are addressed below.

Why the mechanism fails. The mechanism builds positive relations from positive relations on blocks; the problem asks for a negative one. Even for the positive relation that would refute it, the resource ℵβ+1\aleph_{\beta+1} is a regular cardinal, so any block decomposition into fewer than ℵβ+1\aleph_{\beta+1} pieces has a piece of full size, and the block-to-cofinality reduction has nothing to reduce to; and Theorem 1.2's χ\chi at λ=ℵβ\lambda=\aleph_\beta is, under GCH, ∑γ<βℵγ+1=ℵβ\sum_{\gamma<\beta}\aleph_{\gamma+1}=\aleph_\beta, not ℵβ+1\aleph_{\beta+1}, and its hypothesis "eventually ≥λ\ge\lambda" fails. The composition (T2) produces negative relations for pairs on singular resources, which is the wrong exponent and the wrong resource. Nothing here bears on the problem.

Context recorded: the stepping-up instance. Under GCH, ℵβ+1=2ℵβ\aleph_{\beta+1}=2^{\aleph_\beta}, and the erdosproblems.com form of the problem is the case r=2r=2, λ=κ0=ℵβ\lambda=\kappa_0=\aleph_\beta, κn=3\kappa_n=3 (1≤n<ω1\le n<\omega) of the negative stepping-up implication that Problem 1167 asks about, applied to the relation ℵβ↛(ℵβ,(3)ℵ0)2\aleph_\beta\not\to(\aleph_\beta,(3)_{\aleph_0})^2. That relation holds under GCH (author-recorded): cf⁡ℵβ=ℵω+1\operatorname{cf}\aleph_\beta=\aleph_{\omega+1}, and Komjáth's commentary on Problem 5 (p. 420) records the theorem of [45, Section 20] that 2λ=λ+2^\lambda=\lambda^+ implies λ+↛(λ+,(3)cf⁡λ)2\lambda^+\not\to(\lambda^+,(3)_{\operatorname{cf}\lambda})^2 for singular λ\lambda, which at λ=ℵω\lambda=\aleph_\omega gives ℵω+1↛(ℵω+1,(3)ℵ0)2\aleph_{\omega+1}\not\to(\aleph_{\omega+1},(3)_{\aleph_0})^2 under GCH (the GCH case of Problem 1168); (T2) with γ=ℵ0\gamma=\aleph_0 and ρν=3\rho_\nu=3 lifts it to ℵβ\aleph_\beta. So a positive answer to Problem 1167 in its case r=2r=2 with one singular target and the others finite, the case its authors could not settle even under GCH per the erdosproblems.com page of Problem 1167, would prove Problem 1218 in the erdosproblems.com form and hence in the page's form; and a model of GCH in which Problem 1218 fails in the erdosproblems.com form would refute Problem 1167. This is a connection between two problems recorded from the survey, not a product of the mechanism.

Outcome. Fails, with the regular-resource obstruction; the implication from Problem 1167 is recorded for both problem pages; no lead.

Problem 1167: the negative stepping-up lemma

Target. Problem 1167 (status open, claim none; its current assessment judges the statement with the conditions γ≥2\gamma\ge2 and κα>r\kappa_\alpha>r of the Erdős--Hajnal list) asks whether 2λ→(κα+1)α<γr+12^\lambda\to(\kappa_\alpha+1)^{r+1}_{\alpha<\gamma} implies λ→(κα)α<γr\lambda\to(\kappa_\alpha)^r_{\alpha<\gamma}; the erdosproblems.com page (accessed 2026-09-28; last edited 1 September 2026) lists the proved cases from [EHMR84] and names r=2r=2 with one singular κα\kappa_\alpha and the others finite as the difficult case. Komjáth prints it as Problem 2 with the same case list (p. 419).

What transfers. Nothing. The mechanism proves positive relations on a sum of powers from positive relations at the cofinality and on blocks of size (2μ)+(2^\mu)^+; the stepping-up lemma relates a relation on λ\lambda to one on 2λ2^\lambda with the exponent raised, and neither Theorem 1.2 nor (T2) or (T3) changes the exponent. Two remarks locate the mechanism's results relative to the problem. First, Theorem 1.2 and Hajnal's conjecture sit next to the difficult case: for λ=ℵn\lambda=\aleph_n the relation ℵn↛(ℵω,3)2\aleph_n\not\to(\aleph_\omega,3)^2 is trivial, so the implication asked would give 2ℵn↛(ℵω,4)32^{\aleph_n}\not\to(\aleph_\omega,4)^3 for every nn; that relation holds outright, from 2ℵn↛(ℵn+1,4)32^{\aleph_n}\not\to(\aleph_{n+1},4)^3 (author-recorded; a theorem of Erdős, Hajnal and Rado 1965, not held: order ℵn2{}^{\aleph_n}2 lexicographically, fix a well-order of it, and color a triple 11 exactly when its lexicographic middle element is the well-order-least of the three; in a color-11 four-element set the two middle elements would each precede the other, and in a color-00 set of size ℵn+1\aleph_{n+1} the elements with at most ℵn\aleph_n elements of the set below them, and likewise above, number at most ℵn\aleph_n each, since the lexicographic order carries no monotone sequence of length ℵn+1\aleph_{n+1}, so the well-order-least of the remaining elements has elements of the set on both sides; the derivation is written out as Lemma B of the section's review), so this instance of the implication is settled, while Conjecture 1A asserts the positive relation for the sum χ\chi of these powers; the two are compatible, as Sierpiński's 2ℵn↛(ℵn+1)222^{\aleph_n}\not\to(\aleph_{n+1})^2_2 is compatible with Shelah's χ→(ℵω)22\chi\to(\aleph_\omega)^2_2, and a proof of the conjecture would show that the sum of the powers behaves differently from each summand at exponent 33 as well. Second, the instance of the difficult case that is itself an erdosproblems.com problem is Problem 1218, as the previous section records.

Outcome. Not applicable; the Problem 1218 instance is recorded; no lead.

Other relations in the set-theory folder

The mechanism needs a resource that is a union of cf⁡λ\operatorname{cf}\lambda blocks of regular sizes (2μ(i))+(2^{\mu(i)})^+ growing to the resource, a coloring of pairs (or, with the gaps above, triples), and a positive relation at the cofinality. It does not apply to Problem 1168, a negative relation on the regular cardinal ℵω+1\aleph_{\omega+1}, beyond the GCH remark in the Problem 1218 section, which uses (T2) at the singular ℵβ\aleph_\beta and not at ℵω+1\aleph_{\omega+1}; nor to Problem 70, a relation for triples with an ordinal target on the reals: (T1) passes to the lemma the hypothesis 2χ+κ<λ0≤∣A∣2^{\chi+\kappa}<\lambda_0\le|A|, which puts every domain of the lemma above 2ℵ0=∣R∣2^{\aleph_0}=|\mathbb R|, and Theorem 1.2's resource exceeds 2μ(0)≥2ℵ02^{\mu(0)}\ge2^{\aleph_0}, so no coloring of a set of size continuum is in the mechanism's scope, while (T2) and (T3) produce negative relations for pairs and bear on no positive relation for triples; nor to Problem 1170 and Problem 1172, balanced or ordinal-target relations on the regular cardinals ω2\omega_2 and ω3\omega_3; nor to Problem 598, which colors countable subsets rather than finite tuples. The set mappings of Problem 623 and Problem 1173 live at ℵω\aleph_\omega and ℵω+1\aleph_{\omega+1}, but a free set is not a homogeneous set, and the type canonization has no clause for them; their obstructions are on the Problem 501 connections page. In the other direction, the Problem 1171 connections page records that its color-merging induction does not apply to Problem 1219, a balanced cardinal relation; the mechanism here is the one that proves that relation, and the two are disjoint in what they consume.

Outcomes

  • Problem 1219: transfers, as by-products. The converse (T3) and the characterization: for singular λ\lambda, ∑μ<λ2μ→(λ)22\sum_{\mu<\lambda}2^\mu\to(\lambda)^2_2 holds exactly when some 2μ≥λ2^\mu\ge\lambda, the powers are not eventually constant, and cf⁡λ\operatorname{cf}\lambda is ω\omega or weakly compact.
  • Problem 1220: transfers to the strong-limit case, proved from the Erdős--Rado theorem for pairs at the cofinality (the transfer lemma: strong limit singular λ\lambda and cf⁡λ→(cf⁡λ,θ)2\operatorname{cf}\lambda\to(\operatorname{cf}\lambda,\theta)^2 with θ≤cf⁡λ\theta\le\operatorname{cf}\lambda give λ→(λ,θ)2\lambda\to(\lambda,\theta)^2); fails for non-strong-limit λ\lambda, with the type-count obstruction; the survey's report of a consistent counterexample at ℵc+\aleph_{\mathfrak c^+} is flagged for the problem page's status search.
  • Hajnal's Conjecture 1A (on Problem 1219's page): transfers conditionally. The endgame lemma reduces it to the canonization statement (C); the lemma gives (P1) under 2ℵ0<ℵω2^{\aleph_0}<\aleph_\omega and half of (P2); (P3) is the gap. Lead filed.
  • Problem 1218: fails, regular resource and wrong direction; the implication from the difficult case of Problem 1167 is recorded, with the GCH premise proved by (T2); the two erdosproblems.com wordings are flagged.
  • Problem 1167: not applicable; the Problem 1218 instance is recorded.
  • Problems 1168, 70, 1170, 1172, 598, 623 and 1173: not applicable.