ⓘ Core model. In set theory, the core model is a definable inner model of the universe of all sets. Even though set theorists refer to the core model, it is not a ..

                                     

ⓘ Core model

In set theory, the core model is a definable inner model of the universe of all sets. Even though set theorists refer to "the core model", it is not a uniquely identified mathematical object. Rather, it is a class of inner models that under the right set-theoretic assumptions have very special properties, most notably covering properties. Intuitively, the core model is "the largest canonical inner model there is" and is typically associated with a large cardinal notion. If Φ is a large cardinal notion, then the phrase "core model below Φ" refers to the definable inner model that exhibits the special properties under the assumption that there does not exist a cardinal satisfying Φ. The core model program seeks to analyze large cardinal axioms by determining the core models below them.

                                     

1. History

The first core model was Kurt Godels constructible universe L. Ronald Jensen proved the covering lemma for L in the 1970s under the assumption of the non-existence of zero sharp, establishing that L is the "core model below zero sharp". The work of Solovay isolated another core model L.

Mitchell used coherent sequences of measures to develop core models containing multiple or higher-order measurables. Still later, the Steel core model used extenders and iteration trees to construct a core model below a Woodin cardinal.

                                     

2. Construction of core models

Core models are constructed by transfinite recursion from small fragments of the core model called mice. An important ingredient of the construction is the comparison lemma that allows giving a wellordering of the relevant mice.

At the level of strong cardinals and above, one constructs an intermediate countably certified core model K c, and then, if possible, extracts K from K c.

                                     

3. Properties of core models

K c and hence K is a fine-structural countably iterable extender model below long extenders. It is not currently known how to deal with long extenders, which establish that a cardinal is superstrong. Here countable iterability means ω +1 iterability for all countable elementary substructures of initial segments, and it suffices to develop basic theory, including certain condensation properties. The theory of such models is canonical and well understood. They satisfy GCH, the diamond principle for all stationary subsets of regular cardinals, the square principle except at subcompact cardinals, and other principles holding in L.

K c is maximal in several senses. K c computes the successors of measurable and many singular cardinals correctly. Also, it is expected that under an appropriate weakening of countable certifiability, K c would correctly compute the successors of all weakly compact and singular strong limit cardinals correctly. If V is closed under a mouse operator an inner model operator, then so is K c. K c has no sharp: There is no natural non-trivial elementary embedding of K c into itself.

If in addition there are also no Woodin cardinals in this model except in certain specific cases, it is not known how the core model should be defined if K c has Woodin cardinals, we can extract the actual core model K. K is also its own core model. K is locally definable and generically absolute: For every generic extension of V, for every cardinal κ> ω 1 in V equals K∩Hκ. This would not be possible had K contained Woodin cardinals. K is maximal, universal, and fully iterable. This implies that for every iterable extender model M called a mouse, there is an elementary embedding M→N and of an initial segment of K into N, and if M is universal, the embedding is of K into M.

It is conjectured that if K exists and V is closed under a sharp operator M, then K is Σ 1 correct allowing real numbers in K as parameters and M as a predicate. That amounts to Σ 1 3 correctness in the usual sense if M is x→x #.

The core model can also be defined above a particular set of ordinals X: X belongs to KX, but KX satisfies the usual properties of K above X. If there is no iterable inner model with ω Woodin cardinals, then for some X, KX exists. The above discussion of K and K c generalizes to KX and K c X.



                                     

4. Construction of core models

Conjecture:

  • If K c exists and as constructed in every generic extension of V (equivalently, under some generic collapse Coll(ω,
  • If there is no ω +1 iterable model with long extenders and hence models with superstrong cardinals, then K c exists.
                                     
  • open - core model is a business model for the monetization of commercially produced open - source software. Coined by Andrew Lampitt in 2008, the open - core model
  • Core architecture data model CADM in enterprise architecture is a logical data model of information used to describe and build architectures. The CADM
  • The Core frame model is a model showing the urban structure of the Central Business District of a town or city. The model was first suggested by Ronald
  • microarchitecture. The single - and dual - core models are single - die, whereas the quad - core models comprise two dies, each containing two cores packaged in a multi - chip
  • data model for metadata, the Resource Description Framework RDF was maturing. As part of an extended set of DCMI metadata terms, Dublin Core became
  • processors includes the Intel Core i9, Intel Core i7, Intel Core i5, and Intel Core i3, along with the X - series Intel Core CPUs. In early 2018, news reports
  • E6500K model using this core The model features an unlocked multiplier, but was only sold in China. The Penryn core is the successor to the Merom core and
  • these previous primordial planets into gas - giant cores This is the planetary core accretion model of planet formation. Planetary differentiation is
  • for two modes of core periphery structures. This model assumes that there are two classes of nodes. The first consists of a cohesive core sub - graph in which
  • nuclear reactors with this type of core catchers. The Russian physicist who helped design the Russian core - catcher model during the Chernobyl crisis, Leonid
  • The Intel Core microarchitecture previously known as the Next - Generation Micro - Architecture is a multi - core processor microarchitecture unveiled by