Undefined (mathematics)

From Wikipedia, the free encyclopedia
  (Redirected from Defined and undefined)
Jump to navigation Jump to search

In mathematics, undefined has several different meanings, depending on the context. Such contexts include the following, among others:

  • In various branches of mathematics, certain concepts are introduced as primitive notions; for example, in geometry these might be given the names "point", "line", and "angle". As these terms are not defined in terms of other concepts, such terms may be called "undefined terms".
  • A function is said to be "undefined" at points not in its domain – for example, in the real number system, is undefined for negative , i.e., function assigns no value to negative arguments.
  • As a special case of the latter, some arithmetic operations may not assign a meaning to certain values of its operands, such as happens with division by zero. In such a case an expression involving such an operation is called "undefined".

Undefined terms[edit]

In ancient times, geometers attempted to define every term. For example, Euclid defined a point as "that which has no part". In modern times, mathematicians recognize that attempting to define every word inevitably leads to circular definitions, and therefore leave some terms, "point" for example, undefined (see primitive notion).

This more abstract approach allows for fruitful generalizations. In topology, a topological space may be defined as a set of points endowed with certain properties, but in the general setting the nature of these "points" is left entirely undefined. Likewise, in category theory a category consists of "objects" and "arrows"; again, these are primitive, undefined terms. This allows such abstract mathematical theories to be applied to very diverse concrete situations.

In arithmetic[edit]

The expression 0/0 is undefined in arithmetic, as explained in division by zero (the expression is used in calculus to represent an indeterminate form).

Mathematicians have different opinions as to whether 00 should be defined to equal 1, or be left undefined; see Zero to the power of zero for details.

Values for which functions are undefined[edit]

The set of numbers for which a function is defined is called the domain of the function. If a number is not in the domain of a function, the function is said to be "undefined" for that number. Two common examples are , which is undefined for , and , which is undefined (in the real number system) for negative .

In trigonometry[edit]

In trigonometry, and are undefined for all , and and are undefined for all .

In computer science[edit]

Notation using ↓ and ↑[edit]

In computability theory, if f is a partial function on S and a is an element of S, then this is written as f(a)↓ and is read as "f(a) is defined." [1]

If a is not in the domain of f, then this is written as f(a)↑ and is read as "f(a) is undefined".

The symbols of infinity[edit]

In analysis, measure theory, and other mathematical disciplines, the symbol is frequently used to denote an infinite pseudo-number in real analysis, along with its negative, . The symbol has no well-defined meaning by itself, but an expression like is shorthand for a divergent sequence, which at some point is eventually larger than any given real number.

Performing standard arithmetic operations with the symbols is undefined. Some extensions, though, define the following conventions of addition and multiplication:

  •    .
  •    .
  •    .

No sensible extension of addition and multiplication with exists in the following cases:

  • (although in measure theory, this is often defined as )

See extended real number line for more information.

Singularities in complex analysis[edit]

In complex analysis, a point where a holomorphic function is undefined is called a singularity. One distinguishes between removable singularities (the function can be extended holomorphically to , poles (the function can be extended meromorphically to ), and essential singularities, where no meromorphic extension to exists.

References[edit]

  1. ^ Enderton, Herbert B. Computability: An Introduction to Recursion Theory. Elseveier, 2011, pp. 3-6, ISBN 978-0-12-384958-8

Further reading[edit]

  • James R. Smart, Modern Geometries Third Edition, Brooks/Cole, 1988, ISBN 0-534-08310-2