Science  People  Locations  Timeline
Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Axiom schema of replacement


Set theory

In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom schema of replacement is a schema of axioms in Zermelo-Fraenkel set theory.

Suppose P is any predicate in two variables that doesn't use the symbol B. Then in the formal language of the Zermelo-Fraenkel axioms, the axiom schema reads:

or in words:

If, given any set X, there is a unique set Y such that P holds for X and Y, then, given any set A, there is a set B such that, given any set C, C is a member of B if and only if there is a set D such that D is a member of A and P holds for D and C.

Note that there is one axiom for every such predicate P; thus, this is an axiom schemaIn symbolic logic, it is sometimes inconvenient or impossible to express an axiomatic system in a finite number of axioms. For this reason, an axiom schema is used. Formally, an axiom schema is a set (usually infinite) of well formed formulae, each of whi.

To understand this axiom, first note that the clause in the first set of parentheses above is exactly what one needs to construct a functional predicateModel theory In formal logic and related branches of mathematics, a functional predicate or function symbol is a logical symbol that may be applied to an object term to produce another object term. Functional predicates are also sometimes called mappings F in one variable such that F(X) = Y if and only if P(X,Y). Indeed, if one formalises the language of predicate logic to allow the use of derived functional predicates in axiom schemas, then the axiom schema may be rewritten as:

for each derived functional predicate F in one variable; or in words:

Given any set A, there is a set B such that, given any set C, C is a member of B if and only if there is a set D such that D is a member of A and C is equal to the value of F at D.

Next, note that the clause in parentheses in the reformulation above (equivalent to the second clause in parentheses in the original statement) simply states that C is the value of F at some member D of A. Thus, what the axiom schema is really saying is that, given a set A, we can find a set B whose members are precisely the values of F at the members of A.

We can use the axiom of extensionalitySet theory In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of extensionality or axiom of extension is one of the axioms of Zermelo-Fraenkel set theory. In the formal language of the Zermelo-Fraen to show that this set B is unique. We call the set B the image of A under F, and denote it F(A) or (using a form of set-builder notation) {F(D) : D in A}. Thus the essence of the axiom schema is:

The image of a set under a mapping is a set.


Read more »

Non User