 |
|
 |
morphism | A Wisdom Archive on morphism |  | morphism A selection of articles related to morphism |  |
 | |
morphism, Morphism, Morphism - Definition, Morphism - Examples, Morphism - Types of morphisms
|  | | | Top | » Page 9 « |  |
 | |
| ARTICLES RELATED TO morphism |  |  |  | morphism: Encyclopedia II - Function mathematics - Formal definitionFormally a function f from a set X to a set Y, written f : X → Y, is an ordered triple (X, Y, G(f)), where G(f) is a subset of the cartesian product X × Y, such that for each x in X, there is a unique y in Y such that the ordered pair (x, y) is in G(f). X is called the domain of f, Y is called the codomain of F, and G(f) is called th ...
See also:Function mathematics, Function mathematics - Introduction, Function mathematics - Functions of more than one variable, Function mathematics - History, Function mathematics - Formal definition, Function mathematics - Domains codomains and ranges, Function mathematics - Injective surjective and bijective functions, Function mathematics - Images and preimages, Function mathematics - Graph of a function, Function mathematics - Examples of functions, Function mathematics - Properties of functions, Function mathematics - Ambiguous functions, Function mathematics - n-ary function: function of several variables, Function mathematics - Composing functions, Function mathematics - Inverse function, Function mathematics - Restrictions and extensions, Function mathematics - Pointwise operations, Function mathematics - Computable and non-computable functions, Function mathematics - Functions from the categorical viewpoint Read more here: » Function mathematics: Encyclopedia II - Function mathematics - Formal definition |
|  |
|  |  |  | morphism: Encyclopedia II - Function mathematics - Domains codomains and rangesX, the set of input values, is called the domain of f, sometimes denoted dom(f), and Y. The distinction between "codomain" and "range" is best understood by means of an example. Consider, once again, f(x) = x2. This function has no negative outputs, but does permit negative inputs. The domain is R, the set of all real numbers. It is often convenient to consider this as a function from R into R, and so it is possible to call R the codomain and to write f:R → R. The "range", however, is the set of all outputs, which in this ca ...
See also:Function mathematics, Function mathematics - Introduction, Function mathematics - Functions of more than one variable, Function mathematics - History, Function mathematics - Formal definition, Function mathematics - Domains codomains and ranges, Function mathematics - Injective surjective and bijective functions, Function mathematics - Images and preimages, Function mathematics - Graph of a function, Function mathematics - Examples of functions, Function mathematics - Properties of functions, Function mathematics - Ambiguous functions, Function mathematics - n-ary function: function of several variables, Function mathematics - Composing functions, Function mathematics - Inverse function, Function mathematics - Restrictions and extensions, Function mathematics - Pointwise operations, Function mathematics - Computable and non-computable functions, Function mathematics - Functions from the categorical viewpoint Read more here: » Function mathematics: Encyclopedia II - Function mathematics - Domains codomains and ranges |
|  |
|  |  |  | morphism: Encyclopedia II - Function mathematics - Images and preimagesThe image of an element x in X under f is the output f(x).
The image of a subset A of X under f is the subset of Y formally defined by
f[A] = {f(x) | x is in A}
Usually (when subsets of the domain are not at the same time elements of the domain) one writes f(A) instead of f[A].
(An old-fashioned notation writes f'x instead of f(x ...
See also:Function mathematics, Function mathematics - Introduction, Function mathematics - Functions of more than one variable, Function mathematics - History, Function mathematics - Formal definition, Function mathematics - Domains codomains and ranges, Function mathematics - Injective surjective and bijective functions, Function mathematics - Images and preimages, Function mathematics - Graph of a function, Function mathematics - Examples of functions, Function mathematics - Properties of functions, Function mathematics - Ambiguous functions, Function mathematics - n-ary function: function of several variables, Function mathematics - Composing functions, Function mathematics - Inverse function, Function mathematics - Restrictions and extensions, Function mathematics - Pointwise operations, Function mathematics - Computable and non-computable functions, Function mathematics - Functions from the categorical viewpoint Read more here: » Function mathematics: Encyclopedia II - Function mathematics - Images and preimages |
|  |
|  |  |  | morphism: Encyclopedia II - Function mathematics - HistoryAs a mathematical term, "function" was coined by Leibniz in 1694, to describe a quantity related to a curve, such as a curve's slope or a specific point of a curve. The functions Leibniz considered are today called differentiable functions, and they are the type of function most frequently encountered by nonmathematicians. For this type of function, one can talk about limits and derivatives; both are measurements of the change of output values associated to a change of input values, a ...
See also:Function mathematics, Function mathematics - Introduction, Function mathematics - Functions of more than one variable, Function mathematics - History, Function mathematics - Formal definition, Function mathematics - Domains codomains and ranges, Function mathematics - Injective surjective and bijective functions, Function mathematics - Images and preimages, Function mathematics - Graph of a function, Function mathematics - Examples of functions, Function mathematics - Properties of functions, Function mathematics - Ambiguous functions, Function mathematics - n-ary function: function of several variables, Function mathematics - Composing functions, Function mathematics - Inverse function, Function mathematics - Restrictions and extensions, Function mathematics - Pointwise operations, Function mathematics - Computable and non-computable functions, Function mathematics - Functions from the categorical viewpoint Read more here: » Function mathematics: Encyclopedia II - Function mathematics - History |
|  |
|  |  |  | morphism: Encyclopedia II - Function mathematics - Functions of more than one variableA straightforward generalization is to allow functions depending on several arguments. For instance,
g(x,y) = xy
is a function which takes two inputs, x and y, and outputs their product, xy. The input (x,y) is often thought of as an ordered pair. Functions whose inputs consist of ordered pairs are called "binary" or "2-ary".
In the sciences, we often encounter functions that are not given by (known) formulas. Consider ...
See also:Function mathematics, Function mathematics - Introduction, Function mathematics - Functions of more than one variable, Function mathematics - History, Function mathematics - Formal definition, Function mathematics - Domains codomains and ranges, Function mathematics - Injective surjective and bijective functions, Function mathematics - Images and preimages, Function mathematics - Graph of a function, Function mathematics - Examples of functions, Function mathematics - Properties of functions, Function mathematics - Ambiguous functions, Function mathematics - n-ary function: function of several variables, Function mathematics - Composing functions, Function mathematics - Inverse function, Function mathematics - Restrictions and extensions, Function mathematics - Pointwise operations, Function mathematics - Computable and non-computable functions, Function mathematics - Functions from the categorical viewpoint Read more here: » Function mathematics: Encyclopedia II - Function mathematics - Functions of more than one variable |
|  |
| | |  |  |  | morphism: Encyclopedia II - Associative algebra - GeneralizationsOne may consider associative algebras over a commutative ring R: these are modules over R together with a R-bilinear map which yields an associative multiplication. In this case, a unital R-algebra A can equivalently be defined as a ring A with a ring homomorphism R→A.
The n-by-n matrices with integer entries form an associative algebra over the integers and the polynomials with coefficients in the ring Z/nZ (see modular arithmetic) form ...
See also:Associative algebra, Associative algebra - Definition, Associative algebra - Examples, Associative algebra - Algebra homomorphisms, Associative algebra - Index-free notation, Associative algebra - Generalizations, Associative algebra - Coalgebras, Associative algebra - Representations, Associative algebra - Motivation for a Hopf algebra, Associative algebra - Motivation for a Lie algebra Read more here: » Associative algebra: Encyclopedia II - Associative algebra - Generalizations |
|  |
|  | | | Top | » Page 9 « |  |
 | |
|
|