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. If f is injective, then X = f −1 (f(X)), and if f is surjective, then f(f −1 (Y)) = Y.

  8. List of types of functions - Wikipedia

    en.wikipedia.org/wiki/List_of_types_of_functions

    Even function: is symmetric with respect to the Y-axis. Formally, for each x: f (x) = f (−x). Odd function: is symmetric with respect to the origin. Formally, for each x: f (−x) = −f (x). Relative to a binary operation and an order: Subadditive function: for which the value of f (x + y) is less than or equal to f (x) + f (y).

  9. Image (mathematics) - Wikipedia

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

    The preimage of element ′ is . is a function from domain to codomain . The image of all elements in subset A {\displaystyle A} is subset B {\displaystyle B} . The preimage of B {\displaystyle B} is subset C {\displaystyle C} f {\displaystyle f} is a function from domain X {\displaystyle X} to codomain Y . {\displaystyle Y.}