In set theory, an extender is a system of ultrafilters which represents an elementary embedding witnessing large cardinal properties. A nonprincipal ultrafilter is the most basic case of an extender.
A (κ, λ)-extender can be defined as an elementary embedding of some model of ZFC− (ZFC minus the power set axiom) having critical point κ ε M, and which maps κ to an ordinal at least equal to λ. It can also be defined as a collection of ultrafilters, one for each -tuple drawn from λ.
Let κ and λ be cardinals with κ≤λ. Then, a set is called a (κ,λ)-extender if the following properties are satisfied:
- each is a κ-complete nonprincipal ultrafilter on [κ]<ω and furthermore
- at least one is not κ+-complete,
- for each at least one contains the set
- (Coherence) The are coherent (so that the ultrapowers Ult(V,Ea) form a directed system).
- (Normality) If is such that then for some
- (Wellfoundedness) The limit ultrapower Ult(V,E) is wellfounded (where Ult(V,E) is the direct limit of the ultrapowers Ult(V,Ea)).
By coherence, one means that if and are finite subsets of λ such that is a superset of then if is an element of the ultrafilter and one chooses the right way to project down to a set of sequences of length then is an element of More formally, for where and where and for the are pairwise distinct and at most we define the projection
Then and cohere if
Defining an extender from an elementary embedding
Given an elementary embedding which maps the set-theoretic universe into a transitive inner model with critical point κ, and a cardinal λ, κ≤λ≤j(κ), one defines as follows:
One can then show that has all the properties stated above in the definition and therefore is a (κ,λ)-extender.
References
- Kanamori, Akihiro (2003). The Higher Infinite : Large Cardinals in Set Theory from Their Beginnings (2nd ed.). Springer. ISBN 3-540-00384-3.
- Jech, Thomas (2002). Set Theory (3rd ed.). Springer. ISBN 3-540-44085-2.
Mathematical logic |
|---|
| General |
- Formal language
- Formation rule
- Formal proof
- Formal semantics
- Well-formed formula
- Set
- Element
- Class
- Classical logic
- Axiom
- Rule of inference
- Relation
- Theorem
- Logical consequence
- Type theory
- Symbol
- Syntax
- Theory
|
|---|
| Systems |
- Formal system
- Deductive system
- Axiomatic system
- Hilbert style systems
- Natural deduction
- Sequent calculus
|
|---|
| Traditional logic |
- Proposition
- Inference
- Argument
- Validity
- Cogency
- Syllogism
- Square of opposition
- Venn diagram
|
|---|
Propositional calculus and Boolean logic |
- Boolean functions
- Propositional calculus
- Propositional formula
- Logical connectives
- Truth tables
- Many-valued logic
|
|---|
| Predicate logic |
- First-order
- Quantifiers
- Predicate
- Second-order
- Monadic predicate calculus
|
|---|
| Naive set theory |
- Set
- Empty set
- Element
- Enumeration
- Extensionality
- Finite set
- Infinite set
- Subset
- Power set
- Countable set
- Uncountable set
- Recursive set
- Domain
- Codomain
- Image
- Map
- Function
- Relation
- Ordered pair
|
|---|
| Set theory |
- Foundations of mathematics
- Zermelo–Fraenkel set theory
- Axiom of choice
- General set theory
- Kripke–Platek set theory
- Von Neumann–Bernays–Gödel set theory
- Morse–Kelley set theory
- Tarski–Grothendieck set theory
|
|---|
| Model theory |
- Model
- Interpretation
- Non-standard model
- Finite model theory
- Truth value
- Validity
|
|---|
| Proof theory |
- Formal proof
- Deductive system
- Formal system
- Theorem
- Logical consequence
- Rule of inference
- Syntax
|
|---|
Computability theory |
- Recursion
- Recursive set
- Recursively enumerable set
- Decision problem
- Church–Turing thesis
- Computable function
- Primitive recursive function
|
|---|
 | Original source: https://en.wikipedia.org/wiki/Extender (set theory). Read more |