Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Baumgartner 1974 improvement partition theorem erdos rado
main_theorem: The note's one result, unnumbered: ω_α · l_0(m,n) → (m, ω_α · n)^2 for every initial ordinal ω_α and all positive integers m and n, so the least index l_α(m,n) of Erdős and Rado equals the finite l_0(m,n) for every α.
James E. Baumgartner, Improvement of a Partition Theorem of Erdös and Rado, Note, J. Combinatorial Theory Ser. A 17 (1974), 134--137, DOI 10.1016/0097-3165(74)90037-5 (the publisher's identifier PII 0097-3165(74)90037-5 is the title metadata of the publisher's PDF); communicated by the Managing Editors, received November 6, 1972; the author at the California Institute of Technology, with a footnote giving Dartmouth College as his present address (p. 134). Cited as [Ba74] on the problem page. The library's baumgartner_1974_short_proof_hindman_theorem is a different note by the same author in the same volume (no. 3, 384--386), the [Ba74] of Problem 532; the two are not the same work. Its two references (p. 137) are Erdős and Rado, A partition calculus in set theory (1956), cataloged as erdos_1956_partition_calculus_set_theory, and Erdős and Rado, Partition relations and transitivity domains of binary relations (1967), cataloged as erdos_1967_partition_relations_transitivity_domains_binary_relations.
The copy read for this card is the publisher's open-archive scan of the printed note: 4 pages, printed pp. 134--137 = PDF pp. 1--4 (printed p. is PDF p. ), a 2003 capture (its metadata names an Acrobat 4.0 Capture plug-in and a November 2003 creation date) with an OCR text layer that locates passages and garbles the formulas (, , the arrows and the primed and subscripted sets all come out as stray letters). Provenance: the copy was downloaded on 2026-09-22 from the publisher's open archive, the DOI https://doi.org/10.1016/0097-3165(74)90037-5 resolving to the article's PDF under the publisher's user license; 180,093 bytes. The scan prints "Copyright © 1974 by Academic Press, Inc. All rights of reproduction in any form reserved." in the footer of its first page (printed p. 134; the text layer prints the sign as "0"), every other right reserved.
Read status: claims checked for the opening paragraph with the conjecture, the notation, the definition of and the negative relation quoted from the 1967 paper (p. 134), the finite characterization of and the displayed statement $\omega_\alpha\cdot l_0(m,n)\to (m,\omega_\alpha\cdot n)^2$ with its sentence "for all , , and " (p. 135), each read clause by clause on the page images of PDF pp. 1--2 on 2026-09-22; the reference list (p. 137) was read on the page image of PDF p. 4. The proof (pp. 135--137, PDF pp. 2--4) was read on the page images for its structure, the thinning construction, the definition of and the two cases as recorded below, and no step of it was checked. Nothing here is independently reviewed.
Contents
- Opening and notation (p. 134, page image). The note opens by recalling that Erdős and Rado [2] proved, for every initial ordinal and all positive integers and , that some positive integer satisfies , and that they conjectured that the least such depends on and alone; proving that conjecture is the note's stated purpose. The notation: is the cardinality of and the set of its two-element subsets; for ordinals or order types , means that whenever is an ordered set of type and , some of order type has or some of order type has ; is its negation. Erdős and Rado write for the least with , and the note quotes from [2] the negative relation " for all and all ", the last clause of Theorem 2 of the 1967 paper (theorem_2).
- The finite characterization and the statement (p. 135, page image). Quoted: " is the least positive integer such that if for all pairs with , then either (1) there are distinct numbers such that whenever , or (2) there are distinct numbers such that whenever and " (Theorem 1 of the 1967 paper, theorem_1). The note then reduces the conjecture to the displayed relation " for all , , and ", and says that its proof follows the one in [2] in many respects, the difference being that the inductive argument there is replaced by an appeal to this combinatorial property of . The displayed relation is the note's one result; it carries no theorem number. See main_theorem.
- The proof, setup (p. 135, page image, structure only). Fix , , , let , let be an ordered set of type with , and for let . Write with each of type and preceding for ; by ("see [1, Theorem 44]"), as remarked in [2], one may assume for all . Enumerate the ordered pairs , , of distinct indices below and thin the blocks by induction: ; at step , if there are and with and for all , set , and leave the other blocks unchanged; otherwise leave all blocks unchanged. Let . Then for all , and for either for all or no such pair , exists.
- The proof, the two cases (pp. 136--137, page images, structure only). For let if for all , and otherwise; by the combinatorial property of , (1) or (2) holds. Case 1, (1) holds: a set with is built one point at a time, $x_0\in S'_{\lambda_0}$ with for all (otherwise the construction would have forced ), then with for , and so on. Case 2, (2) holds: a set of order type with is built inside . For regular , enumerate the pairs with and as , , and choose , new, outside , which regularity and permit; the note asserts that works without further detail. For singular , each is arranged in a sequence so that every initial segment's -neighbors in the other chosen blocks number fewer than , a subset is bounded when it lies in an initial segment, is the cofinality of with an increasing sequence of cardinals () with limit , and bounded sets of size are chosen disjoint from the -neighbors of the earlier in other blocks; . The check that works is left to the reader (p. 137).
- References (p. 137, page image): the two Erdős–Rado papers named above.
Compiled scope
The note is compiled at statement depth for the one result Problem 112 consumes, the displayed relation of p. 135 with the surrounding sentences of pp. 134--135, read on the page images and paged on main_theorem. The proof is mapped above from the page images for structure only; no step was checked, and nothing here is independently reviewed.
Bears on. #112: the note's result (printed p. 135, PDF p. 2), "$\omega_\alpha\cdot l_0(m,n)\to (m,\omega_\alpha\cdot n)^2$ for all , , and ", together with the negative relation it quotes from the 1967 paper (p. 134, " for all and all "), gives for every initial ordinal : the conjecture of Remark (i) after Theorem 2 of the 1967 paper, which the problem page records as settled by this note and which Ihringer, Rajendraprasad and Weinert restate as their Theorem 1.5, for all infinite initial ordinals . In the letters of the site, , by the finite characterization the note quotes on p. 135 (case (1) a transitive tournament of size , case (2) an independent set of size ); the note says nothing further about the finite numbers themselves and leaves the problem where the 1967 paper left it.
Results.
- Main theorem (p. 135, unnumbered): $\omega_\alpha\cdot l_0(m,n)\to(m,\omega_\alpha\cdot n)^2$ for all , and ; with the 1967 paper's negative relation, .
No file of this source is held: no license on record permits its redistribution, and the card cites the edition it names above.