Английская Википедия:Extension by definitions
In mathematical logic, more specifically in the proof theory of first-order theories, extensions by definitions formalize the introduction of new symbols by means of a definition. For example, it is common in naive set theory to introduce a symbol <math>\emptyset</math> for the set that has no member. In the formal setting of first-order theories, this can be done by adding to the theory a new constant <math>\emptyset</math> and the new axiom <math>\forall x(x\notin\emptyset)</math>, meaning "for all x, x is not a member of <math>\emptyset</math>". It can then be proved that doing so adds essentially nothing to the old theory, as should be expected from a definition. More precisely, the new theory is a conservative extension of the old one.
Definition of relation symbols
Let <math>T</math> be a first-order theory and <math>\phi(x_1,\dots,x_n)</math> a formula of <math>T</math> such that <math>x_1</math>, ..., <math>x_n</math> are distinct and include the variables free in <math>\phi(x_1,\dots,x_n)</math>. Form a new first-order theory <math>T'</math> from <math>T</math> by adding a new <math>n</math>-ary relation symbol <math>R</math>, the logical axioms featuring the symbol <math>R</math> and the new axiom
- <math>\forall x_1\dots\forall x_n(R(x_1,\dots,x_n)\leftrightarrow\phi(x_1,\dots,x_n))</math>,
called the defining axiom of <math>R</math>.
If <math>\psi</math> is a formula of <math>T'</math>, let <math>\psi^\ast</math> be the formula of <math>T</math> obtained from <math>\psi</math> by replacing any occurrence of <math>R(t_1,\dots,t_n)</math> by <math>\phi(t_1,\dots,t_n)</math> (changing the bound variables in <math>\phi</math> if necessary so that the variables occurring in the <math>t_i</math> are not bound in <math>\phi(t_1,\dots,t_n)</math>). Then the following hold:
- <math>\psi\leftrightarrow\psi^\ast</math> is provable in <math>T'</math>, and
- <math>T'</math> is a conservative extension of <math>T</math>.
The fact that <math>T'</math> is a conservative extension of <math>T</math> shows that the defining axiom of <math>R</math> cannot be used to prove new theorems. The formula <math>\psi^\ast</math> is called a translation of <math>\psi</math> into <math>T</math>. Semantically, the formula <math>\psi^\ast</math> has the same meaning as <math>\psi</math>, but the defined symbol <math>R</math> has been eliminated.
Definition of function symbols
Let <math>T</math> be a first-order theory (with equality) and <math>\phi(y,x_1,\dots,x_n)</math> a formula of <math>T</math> such that <math>y</math>, <math>x_1</math>, ..., <math>x_n</math> are distinct and include the variables free in <math>\phi(y,x_1,\dots,x_n)</math>. Assume that we can prove
- <math>\forall x_1\dots\forall x_n\exists !y\phi(y,x_1,\dots,x_n)</math>
in <math>T</math>, i.e. for all <math>x_1</math>, ..., <math>x_n</math>, there exists a unique y such that <math>\phi(y,x_1,\dots,x_n)</math>. Form a new first-order theory <math>T'</math> from <math>T</math> by adding a new <math>n</math>-ary function symbol <math>f</math>, the logical axioms featuring the symbol <math>f</math> and the new axiom
- <math>\forall x_1\dots\forall x_n\phi(f(x_1,\dots,x_n),x_1,\dots,x_n)</math>,
called the defining axiom of <math>f</math>.
Let <math>\psi</math> be any atomic formula of <math>T'</math>. We define formula <math>\psi^\ast</math> of <math>T</math> recursively as follows. If the new symbol <math>f</math> does not occur in <math>\psi</math>, let <math>\psi^\ast</math> be <math>\psi</math>. Otherwise, choose an occurrence of <math>f(t_1,\dots,t_n)</math> in <math>\psi</math> such that <math>f</math> does not occur in the terms <math>t_i</math>, and let <math>\chi</math> be obtained from <math>\psi</math> by replacing that occurrence by a new variable <math>z</math>. Then since <math>f</math> occurs in <math>\chi</math> one less time than in <math>\psi</math>, the formula <math>\chi^\ast</math> has already been defined, and we let <math>\psi^\ast</math> be
- <math>\forall z(\phi(z,t_1,\dots,t_n)\rightarrow\chi^\ast)</math>
(changing the bound variables in <math>\phi</math> if necessary so that the variables occurring in the <math>t_i</math> are not bound in <math>\phi(z,t_1,\dots,t_n)</math>). For a general formula <math>\psi</math>, the formula <math>\psi^\ast</math> is formed by replacing every occurrence of an atomic subformula <math>\chi</math> by <math>\chi^\ast</math>. Then the following hold:
- <math>\psi\leftrightarrow\psi^\ast</math> is provable in <math>T'</math>, and
- <math>T'</math> is a conservative extension of <math>T</math>.
The formula <math>\psi^\ast</math> is called a translation of <math>\psi</math> into <math>T</math>. As in the case of relation symbols, the formula <math>\psi^\ast</math> has the same meaning as <math>\psi</math>, but the new symbol <math>f</math> has been eliminated.
The construction of this paragraph also works for constants, which can be viewed as 0-ary function symbols.
Extensions by definitions
A first-order theory <math>T'</math> obtained from <math>T</math> by successive introductions of relation symbols and function symbols as above is called an extension by definitions of <math>T</math>. Then <math>T'</math> is a conservative extension of <math>T</math>, and for any formula <math>\psi</math> of <math>T'</math> we can form a formula <math>\psi^\ast</math> of <math>T</math>, called a translation of <math>\psi</math> into <math>T</math>, such that <math>\psi\leftrightarrow\psi^\ast</math> is provable in <math>T'</math>. Such a formula is not unique, but any two of them can be proved to be equivalent in T.
In practice, an extension by definitions <math>T'</math> of T is not distinguished from the original theory T. In fact, the formulas of <math>T'</math> can be thought of as abbreviating their translations into T. The manipulation of these abbreviations as actual formulas is then justified by the fact that extensions by definitions are conservative.
Examples
- Traditionally, the first-order set theory ZF has <math>=</math> (equality) and <math>\in</math> (membership) as its only primitive relation symbols, and no function symbols. In everyday mathematics, however, many other symbols are used such as the binary relation symbol <math>\subseteq</math>, the constant <math>\emptyset</math>, the unary function symbol P (the power set operation), etc. All of these symbols belong in fact to extensions by definitions of ZF.
- Let <math>T</math> be a first-order theory for groups in which the only primitive symbol is the binary product ×. In T, we can prove that there exists a unique element y such that x×y = y×x = x for every x. Therefore we can add to T a new constant e and the axiom
- <math>\forall x(x \times e = x\text{ and }e \times x = x)</math>,
- and what we obtain is an extension by definitions <math>T'</math> of <math>T</math>. Then in <math>T'</math> we can prove that for every x, there exists a unique y such that x×y=y×x=e. Consequently, the first-order theory <math>T</math> obtained from <math>T'</math> by adding a unary function symbol <math>f</math> and the axiom
- <math>\forall x(x \times f(x)=e\text{ and }f(x) \times x=e)</math>
- is an extension by definitions of <math>T</math>. Usually, <math>f(x)</math> is denoted <math>x^{-1}</math>.
See also
Bibliography
- S. C. Kleene (1952), Introduction to Metamathematics, D. Van Nostrand
- E. Mendelson (1997). Introduction to Mathematical Logic (4th ed.), Chapman & Hall.
- J. R. Shoenfield (1967). Mathematical Logic, Addison-Wesley Publishing Company (reprinted in 2001 by AK Peters)
