Search results
Results From The WOW.Com Content Network
The term domain is also commonly used in a different sense in mathematical analysis: a domain is a non-empty connected open set in a topological space. In particular, in real and complex analysis , a domain is a non-empty connected open subset of the real coordinate space R n {\displaystyle \mathbb {R} ^{n}} or the complex coordinate space C n ...
is a function from domain X to codomain Y. The yellow oval inside Y is the image of . Sometimes "range" refers to the image and sometimes to the codomain. In mathematics, the range of a function may refer to either of two closely related concepts: the codomain of the function, or; the image of the function.
Given its domain and its codomain, a function is uniquely represented by the set of all pairs (x, f (x)), called the graph of the function, a popular means of illustrating the function. [note 1] [4] When the domain and the codomain are sets of real numbers, each such pair may be thought of as the Cartesian coordinates of a point in the plane.
More generally, evaluating at each element of a given subset of its domain produces a set, called the "image of under (or through) ". Similarly, the inverse image (or preimage ) of a given subset B {\displaystyle B} of the codomain Y {\displaystyle Y} is the set of all elements of X {\displaystyle X} that map to a member of B . {\displaystyle B.}
In complex analysis, a complex domain (or simply domain) is any connected open subset of the complex plane C. For example, the entire complex plane is a domain, as is the open unit disk, the open upper half-plane, and so forth. Often, a complex domain serves as the domain of definition for a holomorphic function.
The term range is sometimes ambiguously used to refer to either the codomain or the image of a function. A codomain is part of a function f if f is defined as a triple ( X , Y , G ) where X is called the domain of f , Y its codomain , and G its graph . [ 1 ]
Let F be a field and let X be any set. The functions X → F can be given the structure of a vector space over F where the operations are defined pointwise, that is, for any f, g : X → F, any x in X, and any c in F, define (+) = + () = When the domain X has additional structure, one might consider instead the subset (or subspace) of all such functions which respect that structure.
More generally, the restriction (or domain restriction or left-restriction) of a binary relation between and may be defined as a relation having domain , codomain and graph ( ) = {(,) ():}. Similarly, one can define a right-restriction or range restriction R B . {\displaystyle R\triangleright B.}