Domain of a function

"Domain (mathematics)" redirects here. For other uses of "domain", see Domain (disambiguation).

Illustration showing f, a function from the pink domain X to the blue codomain Y. The yellow oval inside Y is the image of f. Both the image and the codomain are sometimes called the range of f.

In mathematics, and more specifically in naive set theory, the domain of definition (or simply the domain) of a function is the set of "input" or argument values for which the function is defined. That is, the function provides an "output" or value for each member of the domain.^[1] Conversely, the set of values the function takes on as output is termed the image of the function, which is sometimes also referred to as the range of the function.

For instance, the domain of cosine is the set of all real numbers, while the domain of the square root consists only of numbers greater than or equal to 0 (ignoring complex numbers in both cases).

If the domain of a function is a subset of the real numbers and the function is represented in a Cartesian coordinate system, then the domain is represented on the X-axis.

Formal definition

Given a function f:X→Y, the set X is the domain of f; the set Y is the codomain of f. In the expression f(x), x is the argument and f(x) is the value. One can think of an argument as an input to the function, and the value as the output.

The image (sometimes called the range) of f is the set of all values assumed by f for all possible x; this is the set {f(x) | x ∈ X}. The image of f can be the same set as the codomain or it can be a proper subset of it. It is, in general, smaller than the codomain; it is the whole codomain if and only if f is a surjective function.

A well-defined function must map every element of its domain to an element of its codomain. For example, the function f defined by

f(x)=1/x

has no value for f(0). Thus, the set of all real numbers, R, cannot be its domain. In cases like this, the function is either defined on R\{0} or the "gap is plugged" by explicitly defining f(0). If we extend the definition of f to

f(x) = \begin{cases} 1/x&x\not=0\\ 0&x=0 \end{cases}

then f is defined for all real numbers, and its domain is $\mathbb {R}$ .

Any function can be restricted to a subset of its domain. The restriction of g : A → B to S, where S ⊆ A, is written g |_S : S → B.

Natural domain

The natural domain of a function is the maximal set of values for which the function is defined, typically within the reals but sometimes among the integers or complex numbers. For instance the natural domain of square root is the non-negative reals when considered as a real number function. When considering a natural domain, the set of possible values of the function is typically called its range.^[2]

Domain of a partial function

Further information: Partial function § Domain of a partial function

There are two distinct meanings in current mathematical usage for the notion of the domain of a partial function from X to Y, i.e. a function from a subset X' of X to Y. Most mathematicians, including recursion theorists, use the term "domain of f" for the set X' of all values x such that f(x) is defined. But some, particularly category theorists, consider the domain to be X, irrespective of whether f(x) exists for every x in X.

Category theory

In category theory one deals with morphisms instead of functions. Morphisms are arrows from one object to another. The domain of any morphism is the object from which an arrow starts. In this context, many set theoretic ideas about domains must be abandoned or at least formulated more abstractly. For example, the notion of restricting a morphism to a subset of its domain must be modified. See subobject for more.

Real and complex analysis

In real and complex analysis, a domain is an open connected subset of a real or complex vector space.

In partial differential equations, a domain is an open connected subset of the euclidean space Rⁿ, where the problem is posed, i.e., where the unknown function(s) are defined.

More examples

As a partial function from the real numbers the function $x\mapsto \sqrt{x}$ is defined for all $x\geq 0$ .
If one defines the square root of a negative number x as the complex number z, with positive imaginary part, such that z² = x, the function $x\mapsto \sqrt{x}$ is defined for all real numbers x.
Function $\tan x = \frac{\sin x}{\cos x}$ is defined for all $x \neq \frac{\pi}{2} + k \pi, k = 0, \pm 1, \pm 2, \ldots$

References

↑ Paley, Hiram; Weichsel, Paul M. (1966). A First Course in Abstract Algebra. New York: Holt, Rinehart and Winston. p. 16.
↑ Rosenbaum, Robert A.; Johnson, G. Philip (1984). Calculus: basic concepts and applications. Cambridge University Press. p. 60. ISBN 0-521-25012-9.

Mathematical logic

General	Formal language Formation rule Formal system Deductive system Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Natural deduction Rule of inference Relation Theorem Logical consequence Axiomatic system Type theory Symbol Syntax Theory

Traditional logic	Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram

Propositional calculus Boolean logic	Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables Many-valued logic

Predicate logic	First-order Quantifiers Predicate Second-order Monadic predicate calculus

Naive set theory	Set Empty set Element Enumeration Extensionality Finite set Infinite set Subset Power set Countable set Uncountable set Recursive set Domain Codomain Image Map Function Relation Ordered pair

Set theory	Foundations of mathematics Zermelo–Fraenkel set theory Axiom of choice General set theory Kripke–Platek set theory Von Neumann–Bernays–Gödel set theory Morse–Kelley set theory Tarski–Grothendieck set theory

Model theory	Model Interpretation Non-standard model Finite model theory Truth value Validity

Proof theory	Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax

Computability theory	Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function

This article is issued from Wikipedia - version of the 12/1/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.