When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Codomain - Wikipedia

    en.wikipedia.org/wiki/Codomain

    A function f from X to Y. The blue oval Y is the codomain of f. The yellow oval inside Y is the image of f, and the red oval X is the domain of f. In mathematics, a codomain or set of destination of a function is a set into which all of the output of the function is constrained to fall. It is the set Y in the notation f: XY.

  3. Range of a function - Wikipedia

    en.wikipedia.org/wiki/Range_of_a_function

    Given two sets X and Y, a binary relation f between X and Y is a function (from X to Y) if for every element x in X there is exactly one y in Y such that f relates x to y. The sets X and Y are called the domain and codomain of f, respectively. The image of the function f is the subset of Y consisting of only those elements y of Y such that ...

  4. Function (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Function_(mathematics)

    A function :, with domain X and codomain Y, is bijective, if for every y in Y, there is one and only one element x in X such that y = f(x). In this case, the inverse function of f is the function f − 1 : YX {\displaystyle f^{-1}:Y\to X} that maps yY {\displaystyle y\in Y} to the element xX {\displaystyle x\in X} such that y = f ...

  5. Domain of a function - Wikipedia

    en.wikipedia.org/wiki/Domain_of_a_function

    A function f from X to Y. The set of points in the red oval X is the domain of f. Graph of the real-valued square root function, f(x) = √ x, whose domain consists of all nonnegative real numbers. In mathematics, the domain of a function is the set of inputs accepted by the function.

  6. Surjective function - Wikipedia

    en.wikipedia.org/wiki/Surjective_function

    The cardinality of the domain of a surjective function is greater than or equal to the cardinality of its codomain: If f : XY is a surjective function, then X has at least as many elements as Y, in the sense of cardinal numbers. (The proof appeals to the axiom of choice to show that a function g : YX satisfying f(g(y)) = y for all y ...

  7. Bijection, injection and surjection - Wikipedia

    en.wikipedia.org/wiki/Bijection,_injection_and...

    For every function f, let X be a subset of the domain and Y a subset of the codomain. One has always Xf −1 ( f ( X )) and f ( f −1 ( Y )) ⊆ Y , where f ( X ) is the image of X and f −1 ( Y ) is the preimage of Y under f .

  8. Image (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Image_(mathematics)

    Similarly, the inverse image (or preimage) of a given subset of the codomain is the set of all elements of that map to a member of . The image of the function f {\displaystyle f} is the set of all output values it may produce, that is, the image of X {\displaystyle X} .

  9. Graph of a function - Wikipedia

    en.wikipedia.org/wiki/Graph_of_a_function

    Given a function: from a set X (the domain) to a set Y (the codomain), the graph of the function is the set [4] = {(, ()):}, which is a subset of the Cartesian product.In the definition of a function in terms of set theory, it is common to identify a function with its graph, although, formally, a function is formed by the triple consisting of its domain, its codomain and its graph.