Ineffable cardinal

From The Right Wiki
Jump to navigationJump to search

In the mathematics of transfinite numbers, an ineffable cardinal is a certain kind of large cardinal number, introduced by Jensen & Kunen (1969). In the following definitions, κ will always be a regular uncountable cardinal number. A cardinal number κ is called almost ineffable if for every f:κ𝒫(κ) (where 𝒫(κ) is the powerset of κ) with the property that f(δ) is a subset of δ for all ordinals δ<κ, there is a subset S of κ having cardinality κ and homogeneous for f, in the sense that for any δ1<δ2 in S, f(δ1)=f(δ2)δ1. A cardinal number κ is called ineffable if for every binary-valued function f:[κ]2{0,1}, there is a stationary subset of κ on which f is homogeneous: that is, either f maps all unordered pairs of elements drawn from that subset to zero, or it maps all such unordered pairs to one. An equivalent formulation is that a cardinal κ is ineffable if for every sequence Aα:ακ such that each Aαα, there is Aκ such that {ακ:Aα=Aα} is stationary in κ. Another equivalent formulation is that a regular uncountable cardinal κ is ineffable if for every set S of cardinality κ of subsets of κ, there is a normal (i.e. closed under diagonal intersection) non-trivial κ-complete filter on κ deciding S: that is, for any XS, either X or κX.[1] This is similar to a characterization of weakly compact cardinals. More generally, κ is called n-ineffable (for a positive integer n) if for every f:[κ]n{0,1} there is a stationary subset of κ on which f is n-homogeneous (takes the same value for all unordered n-tuples drawn from the subset). Thus, it is ineffable if and only if it is 2-ineffable. Ineffability is strictly weaker than 3-ineffability.[2]p. 399 A totally ineffable cardinal is a cardinal that is n-ineffable for every 2n<0. If κ is (n+1)-ineffable, then the set of n-ineffable cardinals below κ is a stationary subset of κ. Every n-ineffable cardinal is n-almost ineffable (with set of n-almost ineffable below it stationary), and every n-almost ineffable is n-subtle (with set of n-subtle below it stationary). The least n-subtle cardinal is not even weakly compact (and unlike ineffable cardinals, the least n-almost ineffable is Π21-describable), but (n1)-ineffable cardinals are stationary below every n-subtle cardinal. A cardinal κ is completely ineffable if there is a non-empty R𝒫(κ) such that
- every AR is stationary
- for every AR and f:[κ]2{0,1}, there is BA homogeneous for f with BR. Using any finite n > 1 in place of 2 would lead to the same definition, so completely ineffable cardinals are totally ineffable (and have greater consistency strength). Completely ineffable cardinals are Πn1-indescribable for every n, but the property of being completely ineffable is Δ12. The consistency strength of completely ineffable is below that of 1-iterable cardinals, which in turn is below remarkable cardinals, which in turn is below ω-Erdős cardinals. A list of large cardinal axioms by consistency strength is available in the section below.

See also

References

  • Friedman, Harvey (2001), "Subtle cardinals and linear orderings", Annals of Pure and Applied Logic, 107 (1–3): 1–34, doi:10.1016/S0168-0072(00)00019-1.
  • Jensen, Ronald; Kunen, Kenneth (1969), Some Combinatorial Properties of L and V, Unpublished manuscript

Citations

  1. Holy, Peter; Schlicht, Philipp (2017). "A hierarchy of Ramsey-like cardinals". arXiv:1710.10043 [math.LO].
  2. K. Kunen,. "Combinatorics". In Handbook of Mathematical Logic, Studies in Logic and the Foundations of mathematical vol. 90, ed. J. Barwise (1977)