Club set

Last updated

In mathematics, particularly in mathematical logic and set theory, a club set is a subset of a limit ordinal that is closed under the order topology, and is unbounded (see below) relative to the limit ordinal. The name club is a contraction of "closed and unbounded".

Contents

Formal definition

Formally, if is a limit ordinal, then a set is closed in if and only if for every if then Thus, if the limit of some sequence from is less than then the limit is also in

If is a limit ordinal and then is unbounded in if for any there is some such that

If a set is both closed and unbounded, then it is a club set. Closed proper classes are also of interest (every proper class of ordinals is unbounded in the class of all ordinals).

For example, the set of all countable limit ordinals is a club set with respect to the first uncountable ordinal; but it is not a club set with respect to any higher limit ordinal, since it is neither closed nor unbounded. If is an uncountable initial ordinal, then the set of all limit ordinals is closed unbounded in In fact a club set is nothing else but the range of a normal function (i.e. increasing and continuous).

More generally, if is a nonempty set and is a cardinal, then (the set of subsets of of cardinality ) is club if every union of a subset of is in and every subset of of cardinality less than is contained in some element of (see stationary set).

The closed unbounded filter

Let be a limit ordinal of uncountable cofinality For some , let be a sequence of closed unbounded subsets of Then is also closed unbounded. To see this, one can note that an intersection of closed sets is always closed, so we just need to show that this intersection is unbounded. So fix any and for each n < ω choose from each an element which is possible because each is unbounded. Since this is a collection of fewer than ordinals, all less than their least upper bound must also be less than so we can call it This process generates a countable sequence The limit of this sequence must in fact also be the limit of the sequence and since each is closed and is uncountable, this limit must be in each and therefore this limit is an element of the intersection that is above which shows that the intersection is unbounded. QED.

From this, it can be seen that if is a regular cardinal, then is a non-principal -complete proper filter on the set (that is, on the poset ).

If is a regular cardinal then club sets are also closed under diagonal intersection.

In fact, if is regular and is any filter on closed under diagonal intersection, containing all sets of the form for then must include all club sets.

See also

Related Research Articles

In mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of A.

In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal κ is strongly inaccessible if it satisfies the following three conditions: it is uncountable, it is not a sum of fewer than κ cardinals smaller than κ, and implies .

In mathematics, a Mahlo cardinal is a certain kind of large cardinal number. Mahlo cardinals were first described by Paul Mahlo. As with all large cardinals, none of these varieties of Mahlo cardinals can be proven to exist by ZFC.

In set theory, a branch of mathematics, a Q-indescribable cardinal is a certain kind of large cardinal number that is hard to axiomatize in some language Q. There are many different types of indescribable cardinals corresponding to different choices of languages Q. They were introduced by Hanf & Scott (1961).

In set theory, a Woodin cardinal is a cardinal number such that for all functions , there exists a cardinal with and an elementary embedding from the Von Neumann universe into a transitive inner model with critical point and .

In mathematics, in set theory, the constructible universe, denoted by , is a particular class of sets that can be described entirely in terms of simpler sets. is the union of the constructible hierarchy. It was introduced by Kurt Gödel in his 1938 paper "The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis". In this paper, he proved that the constructible universe is an inner model of ZF set theory, and also that the axiom of choice and the generalized continuum hypothesis are true in the constructible universe. This shows that both propositions are consistent with the basic axioms of set theory, if ZF itself is consistent. Since many other theorems only hold in systems in which one or both of the propositions is true, their consistency is an important result.

In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that is a regular cardinal if and only if every unbounded subset has cardinality . Infinite well-ordered cardinals that are not regular are called singular cardinals. Finite cardinal numbers are typically not called regular or singular.

In mathematics, particularly in set theory, the beth numbers are a certain sequence of infinite cardinal numbers, conventionally written , where is the Hebrew letter beth. The beth numbers are related to the aleph numbers, but unless the generalized continuum hypothesis is true, there are numbers indexed by that are not indexed by .

In mathematics, specifically set theory and model theory, a stationary set is a set that is not too small in the sense that it intersects all club sets and is analogous to a set of non-zero measure in measure theory. There are at least three closely related notions of stationary set, depending on whether one is looking at subsets of an ordinal, or subsets of something of given cardinality, or a powerset.

Diagonal intersection is a term used in mathematics, especially in set theory.

In mathematics, particularly in set theory, if is a regular uncountable cardinal then the filter of all sets containing a club subset of is a -complete filter closed under diagonal intersection called the club filter.

In set theory, a subset of a Polish space is ∞-Borel if it can be obtained by starting with the open subsets of , and transfinitely iterating the operations of complementation and well-ordered union. This concept is usually considered without the assumption of the axiom of choice, which means that the ∞-Borel sets may fail to be closed under well-ordered union; see below.

In model theory, a branch of mathematical logic, the spectrum of a theory is given by the number of isomorphism classes of models in various cardinalities. More precisely, for any complete theory T in a language we write I(T, κ) for the number of models of T (up to isomorphism) of cardinality κ. The spectrum problem is to describe the possible behaviors of I(T, κ) as a function of κ. It has been almost completely solved for the case of a countable theory T.

In the mathematical field of set theory, the proper forcing axiom (PFA) is a significant strengthening of Martin's axiom, where forcings with the countable chain condition (ccc) are replaced by proper forcings.

In mathematical logic and set theory, an ordinal collapsing function is a technique for defining certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger than the one being defined, perhaps even large cardinals, and then "collapse" them down to a system of notations for the sought-after ordinal. For this reason, ordinal collapsing functions are described as an impredicative manner of naming ordinals.

In set theory, an extender is a system of ultrafilters which represents an elementary embedding witnessing large cardinal properties. A nonprincipal ultrafilter is the most basic case of an extender.

<span class="mw-page-title-main">Ordinal number</span> Generalization of "n-th" to infinite cases

In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals aimed to extend enumeration to infinite sets.

This is a glossary of set theory.

In mathematics, Rathjen's  psi function is an ordinal collapsing function developed by Michael Rathjen. It collapses weakly Mahlo cardinals to generate large countable ordinals. A weakly Mahlo cardinal is a cardinal such that the set of regular cardinals below is closed under . Rathjen uses this to diagonalise over the weakly inaccessible hierarchy.

References