A lemma for incompleteness of nonprincipal ultrafilters
For every cardinal k it is shown that the \(<2^ k\)-incompleteness of a nonprincipal ultrafilter on \(2^ k\) (and therefore the inaccessibility of a nonmeasurable cardinal) is a direct consequence of an elementary Lemma proved. In what follows, let k be a (finite or infinite) cardinal and let the partial order on a set of dyadic sequences (i.e., sequences whose terms are 0's or 1's) of type k be defined coordinatewise with \(0\leq 1.\) As expected, a dyadic sequence of type k with one and only one 1 is called an atom of type k. Moreover, as usual, the complement of a dyadic sequence is obtained by replacing in it 0's by 1's and 1's by 0's. Lemma. Let M be a k by \(2^ k\) matrix whose columns are all possible pairwise distinct dyadic sequences of type k. Then in the poset of all sequences of type \(2^ k\) in infimum of the rows of M is an atom. Moreover, if any number (finite or infinite) of rows of M are replaced by their complements then again the infimum of the rows of the resulting matrix is an atom.
This page was built for publication: A lemma for incompleteness of nonprincipal ultrafilters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264148)
