Zermelo-Fraenkel axioms: Difference between revisions
Jump to navigation
Jump to search
imported>John R. Brews (link) |
imported>John R. Brews m (→The axioms: font) |
||
Line 11: | Line 11: | ||
#<u>Axiom of extensionality</u>: If ''X'' and ''Y'' have the same elements, then ''X=Y'' | #<u>Axiom of extensionality</u>: If ''X'' and ''Y'' have the same elements, then ''X=Y'' | ||
#<u>Axiom of pairing</u>: For any ''a'' and ''b'' there exists a set {''a, b''} that contains exactly ''a'' and ''b'' | #<u>Axiom of pairing</u>: For any ''a'' and ''b'' there exists a set {''a, b''} that contains exactly ''a'' and ''b'' | ||
#<u>Axiom schema of separation</u>: If φ is a property with parameter ''p'', then for any ''X'' and ''p'' there exists a set ''Y'' that contains all those elements ''u''∈''X'' that have the property φ; that is, the set ''Y''={''u''∈''X''|φ''(u, p)''} | #<u>Axiom schema of separation</u>: If φ is a property with parameter ''p'', then for any ''X'' and ''p'' there exists a set ''Y'' that contains all those elements ''u''∈''X'' that have the property φ; that is, the set ''Y''={''u''∈''X'' | φ''(u, p)''} | ||
#<u>Axiom of union</u>: For any set ''X'' there exists a set ''Y''=∪''X'', the union of all elements of ''X'' | #<u>Axiom of union</u>: For any set ''X'' there exists a set {{nowrap|''Y'' <nowiki>=</nowiki> <big><big>∪</big></big>''X'',}} the union of all elements of ''X'' | ||
#<u>Axiom of power set</u>: For any ''X'' there exists a set ''Y''=''P(X)'', the set of all subsets of ''X'' | #<u>Axiom of power set</u>: For any ''X'' there exists a set ''Y''=''P(X)'', the set of all subsets of ''X'' | ||
#<u>Axiom of infinity</u>: There exists an infinite set | #<u>Axiom of infinity</u>: There exists an infinite set |
Revision as of 10:06, 2 July 2011
The Zermelo-Fraenkel axioms form one of several possible formulations of axiomatic set theory.
The axioms
There are eight Zermelo-Fraenkel (ZF) axioms:[1]
- Axiom of extensionality: If X and Y have the same elements, then X=Y
- Axiom of pairing: For any a and b there exists a set {a, b} that contains exactly a and b
- Axiom schema of separation: If φ is a property with parameter p, then for any X and p there exists a set Y that contains all those elements u∈X that have the property φ; that is, the set Y={u∈X | φ(u, p)}
- Axiom of union: For any set X there exists a set Y = ∪X, the union of all elements of X
- Axiom of power set: For any X there exists a set Y=P(X), the set of all subsets of X
- Axiom of infinity: There exists an infinite set
- Axiom schema of replacement: If f is a function, then for any X there exists a set Y, denoted F(X) such that F(X)={f(x)|x∈X}
- Axiom of regularity: Every nonempty set has an ∈-minimal element
If to these is added the axiom of choice, the theory is designated as the ZFC theory:
9. Axiom of choice: Every family of nonempty sets has a choice function
For further discussion of these axioms, see the bibliography.
References
- ↑ Thomas J Jech (1978). Set theory. Academic Press. ISBN 0123819504.