Subcompact cardinal

From Wikipedia, the free encyclopedia

In mathematics, a subcompact cardinal is a certain kind of large cardinal number.

A cardinal number κ is subcompact if and only if for every A⊂H(κ+) there is a non-trivial elementary embedding j:(H(μ+), B) → (H(κ+), A) with critical point μ and j(μ) = κ.

Analogously, a cardinal number κ is quasicompact if and only if for every A⊂H(κ+) there is a non-trivial elementary embedding j:(H(κ+), A) → (H(μ+), B) with critical point κ and j(κ) = μ.

H(λ) consists of all sets whose transitive closure has cardinality less than λ.

Every quasicompact cardinal is subcompact. Quasicompactness is a stregthening of subcompactness in that it projects large cardinal properties upwards. The relationship is analogous to that of extendible versus supercompact cardinals. Quasicompactness may be viewed as a strengthened or "boldface" version of 1-extendibility. Existence of subcompact cardinals implies existence of many 1-extendible cardinals, and hence many superstrong cardinals. Existence of a 2κ-supercompact cardinal κ implies existence of many quasicompact cardinals.

Subcompact cardinals are noteworthy as the least large cardinals implying a failure of the Square Principle. If κ is subcompact, then the square principle fails at κ. Canonical inner models at the level of subcompact cardinals satisfy the square principle at all but subcompact cardinals. (Existence of such models has not yet been proved, but in any case the square principle can be forced for weaker cardinals.)

Quasicompactness is one of the strongest large cardinal properties that can be witnessed by current inner models that do not use long extenders. For current inner models, the elementary embeddings included are determined by their effect on P(κ) (as computed at the stage the embedding is included), where κ is the critical point. This prevents them from witnessing even a κ+ strongly compact cardinal κ.

Subcompact and quasicompact cardinals were defined by Ronald Jensen.

  • "Square in Core Models" in the September 2001 issue of the Bulletin of Symbolic Logic
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.