HOME

TheInfoList



OR:

In mathematics, a weakly compact cardinal is a certain kind of
cardinal number In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets. The cardinality of a finite set is a natural number: the number of elements in the set. T ...
introduced by ; weakly compact cardinals are large cardinals, meaning that their existence cannot be proven from the standard axioms of set theory. (Tarski originally called them "not strongly incompact" cardinals.) Formally, a cardinal κ is defined to be weakly compact if it is uncountable and for every function ''f'': � 2 → there is a set of cardinality κ that is homogeneous for ''f''. In this context, � 2 means the set of 2-element subsets of κ, and a subset ''S'' of κ is homogeneous for ''f''
if and only if In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is b ...
either all of 'S''sup>2 maps to 0 or all of it maps to 1. The name "weakly compact" refers to the fact that if a cardinal is weakly compact then a certain related
infinitary language An infinitary logic is a logic that allows infinitely long statements and/or infinitely long proofs. Some infinitary logics may have different properties from those of standard first-order logic. In particular, infinitary logics may fail to be compa ...
satisfies a version of the
compactness theorem In mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful (but generally ...
; see below. Every weakly compact cardinal is a reflecting cardinal, and is also a limit of reflecting cardinals. This means also that weakly compact cardinals are Mahlo cardinals, and the set of Mahlo cardinals less than a given weakly compact cardinal is stationary.


Equivalent formulations

The following are equivalent for any
uncountable In mathematics, an uncountable set (or uncountably infinite set) is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal num ...
cardinal κ: # κ is weakly compact. # for every λ<κ, natural number n ≥ 2, and function f: �sup>n → λ, there is a set of cardinality κ that is homogeneous for f. # κ is inaccessible and has the tree property, that is, every
tree In botany, a tree is a perennial plant with an elongated stem, or trunk, usually supporting branches and leaves. In some usages, the definition of a tree may be narrower, including only woody plants with secondary growth, plants that are ...
of height κ has either a level of size κ or a branch of size κ. # Every linear order of cardinality κ has an ascending or a descending sequence of order type κ. # κ is \Pi^1_1- indescribable. # κ has the extension property. In other words, for all ''U'' ⊂ ''V''κ there exists a transitive set ''X'' with κ ∈ ''X'', and a subset ''S'' ⊂ ''X'', such that (''V''κ, ∈, ''U'') is an elementary substructure of (''X'', ∈, ''S''). Here, ''U'' and ''S'' are regarded as unary
predicates Predicate or predication may refer to: * Predicate (grammar), in linguistics * Predication (philosophy) * several closely related uses in mathematics and formal logic: **Predicate (mathematical logic) **Propositional function **Finitary relation, ...
. # For every set S of cardinality κ of subsets of κ, there is a non-trivial κ-complete filter that decides S. # κ is κ- unfoldable. # κ is inaccessible and the
infinitary language An infinitary logic is a logic that allows infinitely long statements and/or infinitely long proofs. Some infinitary logics may have different properties from those of standard first-order logic. In particular, infinitary logics may fail to be compa ...
''L''κ,κ satisfies the weak compactness theorem. # κ is inaccessible and the
infinitary language An infinitary logic is a logic that allows infinitely long statements and/or infinitely long proofs. Some infinitary logics may have different properties from those of standard first-order logic. In particular, infinitary logics may fail to be compa ...
''L''κ,ω satisfies the weak compactness theorem. # κ is inaccessible and for every
transitive set In set theory, a branch of mathematics, a set A is called transitive if either of the following equivalent conditions hold: * whenever x \in A, and y \in x, then y \in A. * whenever x \in A, and x is not an urelement, then x is a subset of A. Simil ...
M of cardinality κ with κ \in M, ^M\subset M, and satisfying a sufficiently large fragment of ZFC, there is an
elementary embedding In model theory, a branch of mathematical logic, two structures ''M'' and ''N'' of the same signature ''σ'' are called elementarily equivalent if they satisfy the same first-order ''σ''-sentences. If ''N'' is a substructure of ''M'', one often ...
j from M to a transitive set N of cardinality κ such that ^N\subset N, with critical point crit(j)=κ. A language ''L''κ,κ is said to satisfy the weak compactness theorem if whenever Σ is a set of sentences of cardinality at most κ and every subset with less than κ elements has a model, then Σ has a model. Strongly compact cardinals are defined in a similar way without the restriction on the cardinality of the set of sentences.


See also

* List of large cardinal properties


References

* * * * {{citation, last=Kanamori, first=Akihiro, authorlink=Akihiro Kanamori, year=2003, publisher=Springer, title=The Higher Infinite : Large Cardinals in Set Theory from Their Beginnings, title-link= The Higher Infinite , edition=2nd , isbn= 3-540-00384-3 Large cardinals