FACTOID # 146: About one-quarter of all nations drive on the left-hand-side of the road. Most of them are former British colonies.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Covering lemma

In mathematics, under various anti-large cardinal assumptions, one can prove the existence of the canonical inner model, called the Core Model, that is, in a sense, maximal and approximates the structure of V. A covering lemma asserts that under the particular anti-large cardinal assumption, the Core Model exists and is maximal in a way.


For example, if there is no inner model for a measurable cardinal, then the Dodd-Jensen core model, KDJ satisfies the Covering Property, that is for every uncountable set x of ordinals, there is y such that yx, y has the same cardinality as x, and yKDJ. (If 0# does not exist, then KDJ=L.) This implies that if there is no inner model for a measurable cardinal, then KDJ correctly computes successors of singular cardinals.


If there is no inner model with a Woodin cardinal and either every set has a sharp or a subtle cardinal exists or every inner model with a proper class of strong cardinals does not have a sharp (the assumptions other than absence of an inner model with a Woodin cardinal are believed to be unnecessary), then the Mitchell-Steel Core Model K exists and satisfies the Weak Covering Proerty: If κ is a singular cardinal, then κ+=(κ+)K. Moreover, for every κ ≥ ω2, cofinality of (κ+)K is ≥ |κ|. If K exists and no ordinal is measurable in K, then K satisfies the Covering Property.


  Results from FactBites:
 
Covering - Wikipedia, the free encyclopedia (128 words)
A vertex covering or edge covering in graph theory.
The covering lemma in set theory (specifically large cardinal theory).
The Lebesgue covering dimension, a definition of dimension using topological properties.
Vitali's Theorem (504 words)
Remark 5.4 It is straightforward to generalize the previous lemma to the case of a Vitali covering of the n-cube [0,1]
The proof of this theorem is similar to that of Lemma 5.3.
The rest of the proof is as for Lemma 5.3.
  More results at FactBites »


 
 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m