Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Richard Laver, An -saturated ideal on (1982), § 3: the statement on p. 177, its announcement on p. 173, and the sketch of proof on pp. 177--178. The edition is identified on the source card.
Statement. Assume and that there is a normal -saturated -ideal, in the sense defined on the main theorem's page. Then for every : for every partition there is a set of order type all of whose pairs lie in , or a set of order type all of whose pairs lie in .
The introduction's announcement (p. 173) omits the word normal; the statement of § 3 (p. 177) has it, and the ideal built in § 1 is normal. The paper writes ; Komjáth's survey and Problem 1172's page write , the same ordinal.
Consequences. With the theorem gives , since a set of order type contains one of order type ; with it gives for every . The model of § 1 satisfies (p. 173) and has a normal such ideal, so both relations hold there, relative to the consistency of a huge cardinal. The introduction places § 3 after recalling the question of Erdős and Hajnal (the paper's [3], their 1971 problem list) whether is consistent (p. 173), but the paper does not state these consequences in words; they are one-line deductions made here.
Proof pointer. Pages 177--178; the paper says "We just give a sketch modulo familiar arguments". Fix , and for a set of order type copy the ideal to through the order isomorphism with . The cases are whether there are sets of order type , placed one above another, with all pairs inside each in , and such that for a set in the dual filter on has all its pairs with in . If there are, a ramification argument builds, for each , a set of order type with all pairs in . If not, the failed step of the construction gives a set of order type with all pairs in and points each joined in to a positive part of ; -saturation makes the countable intersections of these parts positive, and a ramification argument extends to a set of order type with all pairs in . Building the uses a ramification argument in the manner of Kurepa and of Erdős and Rado, and a generalization of an argument of Galvin (credited to the paper's [1], Baumgartner, Hajnal and Máté) that under , among any sets in a normal filter on there are whose intersection is in the filter. The paper adds that a forthcoming paper of Kanamori will give a similar proof that for weakly compact . Not reconstructed here.
Read depth. Claims checked: the statement on p. 177 and its announcement on p. 173 were read clause by clause on the page images. The sketch on pp. 177--178 was read on the page images and no step was checked; the sketch itself leaves its ramification arguments to the reader. Nothing here is independently reviewed.
Dependencies. For the consequences in a model: the main theorem. External: the Galvin argument as given by Baumgartner, Hajnal and Máté, Weak saturation properties of ideals (Colloq. Math. Soc. János Bolyai 10, 1975, 137--158, the paper's [1]), and the ramification method of Kurepa (1952, [9]) and of Erdős and Rado (A partition calculus in set theory, 1956, [2]). The first two have no card in the library.
Bears on.
- #1172: in the model of § 1 the theorem gives relative to a huge cardinal; that model satisfies and , and the paper does not state that it satisfies GCH, which the problem's consistency question requires (see the main theorem's page).
- #1170: in the same model it gives for every ; the problem asks for every , which the paper does not address.