Codomain: Difference between revisions
Reverted to revision 286014639 by 219.118.185.73; The discussion page had a topic raised on this issue and it didn't resolve that this change was correct. (TW) |
123unoduetre (talk | contribs) Source: http://math.sfsu.edu/smith/Documents/BasicSetTheory.pdf & ANY book about set theory. Please read cerefully and understand definitions. Also learning first order logic might help you. |
||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
[[Image:Codomain2.SVG|right|thumb|250px|Image of a function('''f''') from '''X'''(left) to '''Y'''(right). The smaller oval inside '''Y''' is the image of ''f''. '''Y''' is the Codomain of ''f''.]] |
[[Image:Codomain2.SVG|right|thumb|250px|Image of a function('''f''') from '''X'''(left) to '''Y'''(right). The smaller oval inside '''Y''' is the image of ''f''. '''Y''' is the Codomain of ''f''.]] |
||
"Definition" of '''codomain''' in informal [[mathematics]] is similar to this one: |
|||
==Informal definition== |
|||
In [[mathematics]], the '''codomain''', or '''target''' set, of a [[function (mathematics)|function]], described symbolically as ''<math>f</math>'' : ''<math>X</math>'' → ''<math>Y</math>'', is the set ''<math>Y</math>'' into which all of the output of the function is constrained to fall. |
In [[mathematics]], the '''codomain''', or '''target''' set, of a [[function (mathematics)|function]], described symbolically as ''<math>f</math>'' : ''<math>X</math>'' → ''<math>Y</math>'', is the set ''<math>Y</math>'' into which all of the output of the function is constrained to fall. |
||
Line 52: | Line 56: | ||
A second example of the difference between codomain and image can be seen by considering the matrix of a linear transformation. By convention, the domain of a [[linear transformation]] associated with a [[matrix (mathematics)|matrix]] is '''R'''<sup>''n''</sup> and its codomain is '''R'''<sup>''m''</sup>, where the matrix is <math>m \times n</math> (has ''<math>m</math>'' rows and ''<math>n</math>'' columns) and the image is |
A second example of the difference between codomain and image can be seen by considering the matrix of a linear transformation. By convention, the domain of a [[linear transformation]] associated with a [[matrix (mathematics)|matrix]] is '''R'''<sup>''n''</sup> and its codomain is '''R'''<sup>''m''</sup>, where the matrix is <math>m \times n</math> (has ''<math>m</math>'' rows and ''<math>n</math>'' columns) and the image is |
||
usually called the [[range]]. But the range (the set of numbers obtained when the matrix is [[right-multiplication|right-multiplied]] by every [[column vector]] of length ''<math>n</math>'') could be much smaller. For example, if the matrix contains only <math>0</math>s, then no matter how large it is, the range is just the vector [[Null vector (vector space)|'''0''']]. But the dimension of the resulting vector is ''<math>m</math>''. This is important, because it is enough to change just one number in the matrix to make its range non-zero. |
usually called the [[range]]. But the range (the set of numbers obtained when the matrix is [[right-multiplication|right-multiplied]] by every [[column vector]] of length ''<math>n</math>'') could be much smaller. For example, if the matrix contains only <math>0</math>s, then no matter how large it is, the range is just the vector [[Null vector (vector space)|'''0''']]. But the dimension of the resulting vector is ''<math>m</math>''. This is important, because it is enough to change just one number in the matrix to make its range non-zero. |
||
==Formal aspects== |
|||
The truth is that informal definition use nonstandard definition of function. Standard definition of function is the set of [[Ordered pair|ordered pairs]]. So when having two functions, they are equal if and only if they have same elements, same pairs ([[Axiom of extensionality]]). So according to this definition functions: |
|||
: <math>f\colon \mathbb{R}\rightarrow\mathbb{R}</math> |
|||
: <math>f\colon\,x\mapsto x^2.</math> |
|||
: <math>g\colon\mathbb{R}\rightarrow\mathbb{R}^+_0</math> |
|||
: <math>g\colon\,x\mapsto x^2.</math> |
|||
are the same set, same function. As you might notice, formulas above are not true definitions, but each pair of these formulas is enough to create correct definition, so they are often used instead of it. First formula is equivalent to <math>function(f) \and dom(f)=\mathbb{R} \and rg(f)\subseteq\mathbb{R}</math> and second is equivalent to <math>\forall{x\in dom{(f)}\;}{(f(x)=x^2)}</math>. For function <math>g</math> first formula is equivalent to <math>function(g) \and dom(g)=\mathbb{R} \and rg(f)\subseteq\mathbb{R}^+_0</math>, and second is similar to formula for function <math>f</math>. Correct definitions looks like that: |
|||
: <math>f\overset{\underset{\mathrm{def}}{}}{=} \!\,\{x^2\colon\,x\in\mathbb{R}\}</math> |
|||
: <math>g\overset{\underset{\mathrm{def}}{}}{=} \!\,\{x^2\colon\,x\in\mathbb{R}\}</math> |
|||
In standard definition of function one function can have many codomains ('''every set which has image of function as its subset is function's codomain'''). If we would like to use codomains in nonstandard way similar to informal definition we have to use for example definition of function as a pair of two sets, first is set of pairs from standard definition, and second is function's codomain. Also we could use some axiomatical approach like [[Category theory]] in which, among others, codomains are basic objects. But nonstandard approaches create some problems like our intuitions of function composition. In example above author claims that <math>h \circ f</math> doesn't make sense. According to [[first order logic]] there is nothing like nonsense terms. (They are possible in other logics). Moreover composition has strict definition which goes well with our intuitions: |
|||
: <math> h=f \circ g \iff \forall{x,y}\left[x h y\iff\exist{z}\left(x g z \and z f y\right)\right]</math> |
|||
Which means, that <math>y=(f \circ g)(x)</math> if and only if there exist some element <math>z</math> such that <math>z=g(x)</math> and <math>y=f(z)</math>. |
|||
As you might see, the "problems" claimed by the author of informal definition are nonexistent. If function <math>f</math> from informal definition has some negative values there is no such z that is the element of domain of <math>h</math>. |
|||
Informal definition showed above is a great example of how informal mathematics allows some vague notions, and why formalization of mathematics is important issue. |
|||
[[Category:Functions and mappings]] |
[[Category:Functions and mappings]] |
Revision as of 21:13, 22 May 2009
![](http://upload.wikimedia.org/wikipedia/commons/thumb/6/64/Codomain2.SVG/250px-Codomain2.SVG.png)
"Definition" of codomain in informal mathematics is similar to this one:
Informal definition
In mathematics, the codomain, or target set, of a function, described symbolically as : → , is the set into which all of the output of the function is constrained to fall.
All the output that the function can possibly produce from its given domain, , is the image. The function's image will not necessarily fill the entire codomain , even though the output must all land inside of the codomain: there can be points in the codomain that are "not used."
The codomain (or target) is part of the definition of a function. The image (or range) is a consequence of the definition of a function: the image is a subset of the codomain and depends upon (i.e. is a consequence of) how the definition of the function prescribes the domain, codomain, and map or formula.
(The domain of is the set .)
Examples
As an example, let the function be a function on the real numbers:
defined by
- , or equivalently .
The codomain of is , but clearly f does not map to any negative number. Thus the image of f is the set
,i.e., the interval [0,∞) where:
We can define an alternative function thus:
While and map a given x to the same number, they are not, in the modern view, the same function because they have different codomains. To see why, suppose that we define a third function h:
We must define the domain of h to be :
- .
Now let's define the compositions
- ,
- .
As it turns out, doesn't make sense. Suppose (as we must, unless we explicitly state otherwise) that we do not know what the image of is; we only know that it can be . But then we are in trouble because the square root is not defined for negative numbers. Now we have a possible contradiction because function h, when composed on function f, might receive an argument which it "can't handle."
This unclarity should be avoided in formal work. Function composition therefore requires by definition that the codomain of the function on the right side of a composition (not its image, which is a consequence of the function and is said to be indeterminate at the level of the composition) must be the same as the domain of the function on the left side.
The codomain affects whether a function is a surjection. In our example, is a surjection while is not. The codomain does not affect whether a function is an injection.
A second example of the difference between codomain and image can be seen by considering the matrix of a linear transformation. By convention, the domain of a linear transformation associated with a matrix is Rn and its codomain is Rm, where the matrix is (has rows and columns) and the image is usually called the range. But the range (the set of numbers obtained when the matrix is right-multiplied by every column vector of length ) could be much smaller. For example, if the matrix contains only s, then no matter how large it is, the range is just the vector 0. But the dimension of the resulting vector is . This is important, because it is enough to change just one number in the matrix to make its range non-zero.
Formal aspects
The truth is that informal definition use nonstandard definition of function. Standard definition of function is the set of ordered pairs. So when having two functions, they are equal if and only if they have same elements, same pairs (Axiom of extensionality). So according to this definition functions:
are the same set, same function. As you might notice, formulas above are not true definitions, but each pair of these formulas is enough to create correct definition, so they are often used instead of it. First formula is equivalent to and second is equivalent to . For function first formula is equivalent to , and second is similar to formula for function . Correct definitions looks like that:
In standard definition of function one function can have many codomains (every set which has image of function as its subset is function's codomain). If we would like to use codomains in nonstandard way similar to informal definition we have to use for example definition of function as a pair of two sets, first is set of pairs from standard definition, and second is function's codomain. Also we could use some axiomatical approach like Category theory in which, among others, codomains are basic objects. But nonstandard approaches create some problems like our intuitions of function composition. In example above author claims that doesn't make sense. According to first order logic there is nothing like nonsense terms. (They are possible in other logics). Moreover composition has strict definition which goes well with our intuitions:
Which means, that if and only if there exist some element such that and . As you might see, the "problems" claimed by the author of informal definition are nonexistent. If function from informal definition has some negative values there is no such z that is the element of domain of .
Informal definition showed above is a great example of how informal mathematics allows some vague notions, and why formalization of mathematics is important issue.