Internal set theory

Short description: System of mathematical set theory

Internal set theory (IST) is a mathematical theory of sets developed by Edward Nelson that provides an axiomatic basis for a portion of the nonstandard analysis introduced by Abraham Robinson. Instead of adding new elements to the real numbers, Nelson's approach modifies the axiomatic foundations through syntactic enrichment. Thus, the axioms introduce a new term, "standard", which can be used to make discriminations not possible under the conventional ZFC axioms for sets. Thus, IST is an enrichment of ZFC: all axioms of ZFC are satisfied for all classical predicates, while the new unary predicate "standard" satisfies three additional axioms I, S, and T. In particular, suitable nonstandard elements within the set of real numbers can be shown to have properties that correspond to the properties of infinitesimal and unlimited elements.

Nelson's formulation is made more accessible for the lay-mathematician by leaving out many of the complexities of meta-mathematical logic that were initially required to justify rigorously the consistency of number systems containing infinitesimal elements.

## Contents

* 1 Intuitive justification
* 1.1 Principles of the standard predicate
* 2 Formal axioms
* 2.1 Idealisation
* 2.1.1 Applied to the relation ≠
* 2.1.2 Applied to the relation <
* 2.1.3 Applied to the relation ∈
* 2.2 Standardisation
* 2.3 Transfer
* 3 Formal justification for the axioms
* 4 Related theories
* 5 Notes
* 6 References

## Intuitive justification

Whilst IST has a perfectly formal axiomatic scheme, described below, an intuitive justification of the meaning of the term standard is desirable. This is not part of the formal theory, but is a pedagogical device that might help the student interpret the formalism. The essential distinction, similar to the concept of definable numbers, contrasts the finiteness of the domain of concepts that we can specify and discuss, with the unbounded infinity of the set of numbers; compare finitism.

* The number of symbols one writes with is finite.
* The number of mathematical symbols on any given page is finite.
* The number of pages of mathematics a single mathematician can produce in a lifetime is finite.
* Any workable mathematical definition is necessarily finite.
* There are only a finite number of distinct objects a mathematician can define in a lifetime.
* There will only be a finite number of mathematicians in the course of our (presumably finite) civilization.
* Hence there is only a finite set of whole numbers our civilization can discuss in its allotted lifespan.
* What that limit actually is, is unknowable to us, being contingent on many accidental cultural factors.
* This limitation is not in itself susceptible to mathematical scrutiny, but that there is such a limit, whilst the set of whole numbers continues forever without bound, is a mathematical truth.

The term standard is therefore intuitively taken to correspond to some necessarily finite portion of "accessible" whole numbers. The argument can be applied to any infinite set of objects whatsoever – there are only so many elements that one can specify in finite time using a finite set of symbols and there are always those that lie beyond the limits of our patience and endurance, no matter how we persevere. We must admit to a profusion of nonstandard elements—too large or too anonymous to grasp—within any infinite set.

### Principles of the standard predicate

The following principles follow from the above intuitive motivation and so should be deducible from the formal axioms. For the moment we take the domain of discussion as being the familiar set of whole numbers.

* Any mathematical expression that does not use the new predicate standard explicitly or implicitly is an internal formula.
* Any definition that does so is an external formula.
* Any number uniquely specified by an internal formula is standard (by definition).
* Nonstandard numbers are precisely those that cannot be uniquely specified (due to limitations of time and space) by an internal formula.
* Nonstandard numbers are elusive: each one is too enormous to be manageable in decimal notation or any other representation, explicit or implicit, no matter how ingenious your notation. Whatever you succeed in producing is by definition merely another standard number.
* Nevertheless, there are (many) nonstandard whole numbers in any infinite subset of N.
* Nonstandard numbers are completely ordinary numbers, having decimal representations, prime factorizations, etc. Every classical theorem that applies to the natural numbers applies to the nonstandard natural numbers. We have created, not new numbers, but a new method of discriminating between existing numbers.
* Moreover, any classical theorem that is true for all standard numbers is necessarily true for all natural numbers. Otherwise the formulation "the smallest number that fails to satisfy the theorem" would be an internal formula that uniquely defined a nonstandard number.
* The predicate "nonstandard" is a logically consistent method for distinguishing large numbers—the usual term will be illimited. Reciprocals of these illimited numbers will necessarily be extremely small real numbers—infinitesimals. To avoid confusion with other interpretations of these words, in newer articles on IST those words are replaced with the constructs "i-large" and "i-small".
* There are necessarily only finitely many standard numbers—but caution is required: we cannot gather them together and hold that the result is a well-defined mathematical set. This will not be supported by the formalism (the intuitive justification being that the precise bounds of this set vary with time and history). In particular we will not be able to talk about the largest standard number, or the smallest nonstandard number. It will be valid to talk about some finite set that contains all standard numbers—but this non-classical formulation could only apply to a nonstandard set.

## Formal axioms

IST is an axiomatic theory in the first-order logic with equality in a language containing a binary predicate symbol ∈ and a unary predicate symbol st(x). Formulas not involving st (i.e., formulas of the usual language of set theory) are called internal, other formulas are called external. We use the abbreviations

∃stxϕ(x)=∃x(st⁡(x)∧ϕ(x)),∀stxϕ(x)=∀x(st⁡(x)->ϕ(x)).

IST includes all axioms of the Zermelo–Fraenkel set theory with the axiom of choice (ZFC). Note that the ZFC schemata of separation and replacement are not extended to the new language, they can only be used with internal formulas. Moreover, IST includes three new axiom schemata – conveniently one for each initial in its name: Idealisation, Standardisation, and Transfer.

### Idealisation

* For any internal formula ϕ without a free occurrence of z, the universal closure of the following formula is an axiom:

∀stz(z is finite->∃y∀x∈zϕ(x,y,u1,…,un))↔∃y∀stxϕ(x,y,u1,…,un).
* In words: For every internal relation R, and for arbitrary values for all other free variables, we have that if for each standard, finite set F, there exists a g such that R(g,f) holds for all f in F, then there is a particular G such that for any standard f we have R(g,f), and conversely, if there exists G such that for any standard f, we have R(g,f), then for each finite set F, there exists a g such that R(g,f) holds for all f in F.

The statement of this axiom comprises two implications. The right-to-left implication can be reformulated by the simple statement that elements of standard finite sets are standard. The more important left-to-right implication expresses that the collection of all standard sets is contained in a finite (nonstandard) set, and moreover, this finite set can be taken to satisfy any given internal property shared by all standard finite sets.

This very general axiom scheme upholds the existence of "ideal" elements in appropriate circumstances. Three particular applications demonstrate important consequences.

#### Applied to the relation ≠

If S is standard and finite, we take for the relation R(g,f): g and f are not equal and g is in S. Since "For every standard finite set F there is an element g in S such that g≠f for all f in F" is false (no such g exists when F = S), we may use Idealisation to tell us that "There is a G in S such that g≠f for all standard f" is also false, i.e. all the elements of S are standard.

If S is infinite, then we take for the relation R(g,f): g and f are not equal and g is in S. Since "For every standard finite set F there is an element g in S such that g≠f for all f in F" (the infinite set S is not a subset of the finite set F), we may use Idealisation to derive "There is a G in S such that g≠f for all standard f." In other words, every infinite set contains a nonstandard element (many, in fact).

The power set of a standard finite set is standard (by Transfer) and finite, so all the subsets of a standard finite set are standard.

If S is nonstandard, we take for the relation R(g,f): g and f are not equal and g is in S. Since "For every standard finite set F there is an element g in S such that g≠f for all f in F" (the nonstandard set S is not a subset of the standard and finite set F), we may use Idealisation to derive "There is a G in S such that g≠f for all standard f." In other words, every nonstandard set contains a nonstandard element.

As a consequence of all these results, all the elements of a set S are standard if and only if S is standard and finite.

#### Applied to the relation <

Since "For every standard, finite set of natural numbers F there is a natural number g such that g>f for all f in F" (say, g = max(F) + 1), we may use Idealisation to derive "There is a natural number G such that g>f for all standard natural numbers f." In other words, there exists a natural number greater than each standard natural number.

#### Applied to the relation ∈

We take R(g,f): g is a finite set containing element f. Since "For every standard, finite set F, there is a finite set g such that f∈G for all f in F" (e.g. g = F), we may use Idealisation to derive "There is a finite set G such that f∈G for all standard f." For any set S, the intersection of S with the set G is a finite subset of S that contains every standard element of S. G is necessarily nonstandard, by the ZFC regularity axiom.

### Standardisation

* If ϕ is any formula (it may be external) without a free occurrence of y, the universal closure of

∀stx∃sty∀stt(t∈y↔(t∈x∧ϕ(t,u1,…,un)))

is an axiom.

* In words: If A is a standard set and P any property, internal or otherwise, then there is a unique, standard subset B of A whose standard elements are precisely the standard elements of A satisfying P (but the behaviour of B's nonstandard elements is not prescribed).

### Transfer

* If ϕ(x,u1,…,un) is an internal formula with no other free variables than those indicated, then

∀stu1…∀stun(∀stxϕ(x,u1,…,un)->∀xϕ(x,u1,…,un))

is an axiom.

* In words: If all the parameters A, B, C, ..., W of an internal formula F have standard values then F(x, A, B,..., W) holds for all x's as soon as it holds for all standard x's--from which it follows that all uniquely defined concepts or objects within classical mathematics are standard.

## Formal justification for the axioms

Aside from the intuitive motivations suggested above, it is necessary to justify that additional IST axioms do not lead to errors or inconsistencies in reasoning. Mistakes and philosophical weaknesses in reasoning about infinitesimal numbers in the work of Gottfried Leibniz, Johann Bernoulli, Leonhard Euler, Augustin-Louis Cauchy, and others were the reason that they were originally abandoned for the more cumbersome[1] real number-based arguments developed by Georg Cantor, Richard Dedekind, and Karl Weierstrass, which were perceived as being more rigorous by Weierstrass's followers.

The approach for internal set theory is the same as that for any new axiomatic system—we construct a model for the new axioms using the elements of a simpler, more trusted, axiom scheme. This is quite similar to justifying the consistency of the axioms of elliptic non-Euclidean geometry by noting they can be modeled by an appropriate interpretation of great circles on a sphere in ordinary 3-space.

In fact via a suitable model a proof can be given of the relative consistency of IST as compared with ZFC: if ZFC is consistent, then IST is consistent. In fact, a stronger statement can be made: IST is a conservative extension of ZFC: any internal formula that can be proven within internal set theory can be proven in the Zermelo–Fraenkel axioms with the axiom of choice alone.[2]

## Related theories

Related theories were developed by Karel Hrbacek and others.

## Notes

1. ↑ Vopěnka, Petr (1979). Mathematics in the Alternative Set Theory (Teubner 1979).pdf. Leipzig: BSB B. G. Teubner Verlagsgesellschaft. https://drive.google.com/file/d/17JRj2orUVDw7lrBEmBS1K6OK06RP32Xa/view. Retrieved 3 April 2025.
2. ↑ Nelson, Edward (1977). Internal set theory: A new approach to nonstandard analysis. Bulletin of the American Mathematical Society 83(6):1165–1198.

## References

* Robert, Alain (1985). Nonstandard analysis. John Wiley & Sons. ISBN 0-471-91703-6.
* Internal Set Theory, a chapter of an unfinished book by Nelson.

* v
* t
* e

Infinitesimals

History|

* Adequality
* Leibniz's notation
* Integral symbol
* Criticism of non-standard analysis
* The Analyst
* The Method of Mechanical Theorems
* Cavalieri's principle
* Method of indivisibles

Related branches|

* Non-standard analysis
* Non-standard calculus
* Internal set theory
* Synthetic differential geometry
* Smooth infinitesimal analysis
* Constructive non-standard analysis
* Infinitesimal strain theory (physics)

Formalizations|

* Differentials
* Hyperreal numbers
* Dual numbers
* Surreal numbers

Individual concepts|

* Standard part function
* Transfer principle
* Hyperinteger
* Increment theorem
* Monad
* Internal set
* Levi-Civita field
* Hyperfinite set
* Law of Continuity
* Overspill
* Microcontinuity
* Transcendental law of homogeneity

Mathematicians|

* Gottfried Wilhelm Leibniz
* Abraham Robinson
* Pierre de Fermat
* Augustin-Louis Cauchy
* Leonhard Euler

Textbooks|

* Analyse des Infiniment Petits
* Elementary Calculus
* Cours d'Analyse

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Internal set theory. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Internal_set_theory&oldid=4150057"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template