31.08.2013 Views

Chain conditions in free products of lattices with infinitary ... - MSP

Chain conditions in free products of lattices with infinitary ... - MSP

Chain conditions in free products of lattices with infinitary ... - MSP

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

112 G. GRATZER, A. HAJNAL AND DAVID KELLY<br />

LEMMA 2. Let n be a strongly m-<strong>in</strong>accessible card<strong>in</strong>al whose<br />

c<strong>of</strong><strong>in</strong>ality is greater than 2~. If (P t\ίel) is a family <strong>of</strong> posets<br />

<strong>with</strong> 0 and 1 satisfy<strong>in</strong>g the n-cha<strong>in</strong> condition, then Z? m(P i|ΐe I)<br />

satisfies the n-cha<strong>in</strong> condition.<br />

Pro<strong>of</strong>. Suppose C is a cha<strong>in</strong> <strong>in</strong> i7m(Pΐ | i e I) <strong>of</strong> card<strong>in</strong>ality π,<br />

where each Pt satisfies the tt-cha<strong>in</strong> condition. There is no loss <strong>in</strong><br />

generality <strong>in</strong> assum<strong>in</strong>g that C C Π° m(Pt\ieI). For xeC, the sets<br />

spQ(x) each have card<strong>in</strong>ality less than m and form a cha<strong>in</strong> under<br />

<strong>in</strong>clusion; therefore, by the Erdόs-Rado theorem (a pro<strong>of</strong> <strong>with</strong>out<br />

appeal to this theorem is not difficult), \{spo(x)\xe C}\

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!