Direct product
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, one can often define a direct product of objects already known, giving a new one. This generalizes the Cartesian product of the underlying sets, together with a suitably defined structure on the product set. More abstractly, one talks about the product in category theory, which formalizes these notions. Examples are the product of sets,
groups A group is a number of persons or things that are located, gathered, or classed together. Groups of people * Cultural group, a group whose members share the same cultural identity * Ethnic group, a group whose members share the same ethnic ide ...
(described below), rings, and other algebraic structures. The product of
topological space In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called poin ...
s is another instance. There is also the direct sum – in some areas this is used interchangeably, while in others it is a different concept.


Examples

* If we think of \R as the set of real numbers, then the direct product \R \times \R is just the Cartesian product \. * If we think of \R as the group of real numbers under addition, then the direct product \R\times \R still has \ as its underlying set. The difference between this and the preceding example is that \R \times \R is now a group, and so we have to also say how to add their elements. This is done by defining (a,b) + (c,d) = (a+c, b+d). * If we think of \R as the ring of real numbers, then the direct product \R\times \R again has \ as its underlying set. The ring structure consists of addition defined by (a,b) + (c,d) = (a+c, b+d) and multiplication defined by (a,b) (c,d) = (ac, bd). * Although the ring \R is a field, \R \times \R is not one, because the element (1,0) does not have a
multiplicative inverse In mathematics, a multiplicative inverse or reciprocal for a number ''x'', denoted by 1/''x'' or ''x''−1, is a number which when multiplied by ''x'' yields the multiplicative identity, 1. The multiplicative inverse of a fraction ''a''/' ...
. In a similar manner, we can talk about the direct product of finitely many algebraic structures, for example, \R \times \R \times \R \times \R. This relies on the fact that the direct product is associative up to isomorphism. That is, (A \times B) \times C \cong A \times (B \times C) for any algebraic structures A, B, and C of the same kind. The direct product is also commutative up to isomorphism, that is, A \times B \cong B \times A for any algebraic structures A and B of the same kind. We can even talk about the direct product of infinitely many algebraic structures; for example we can take the direct product of countably many copies of \mathbb R, which we write as \R \times \R \times \R \times \dotsb.


Group direct product

In
group theory In abstract algebra, group theory studies the algebraic structures known as groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as rings, fields, and vector spaces, can all be seen ...
one can define the direct product of two groups (G, \circ) and (H, \cdot), denoted by G \times H. For
abelian group In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is comm ...
s which are written additively, it may also be called the direct sum of two groups, denoted by G \oplus H. It is defined as follows: * the
set Set, The Set, SET or SETS may refer to: Science, technology, and mathematics Mathematics *Set (mathematics), a collection of elements *Category of sets, the category whose objects and morphisms are sets and total functions, respectively Electro ...
of the elements of the new group is the ''Cartesian product'' of the sets of elements of G \text H, that is \; * on these elements put an operation, defined element-wise: (g, h) \times \left(g', h'\right) = \left(g \circ g', h \cdot h'\right) Note that (G, \circ) may be the same as (H, \cdot). This construction gives a new group. It has a normal subgroup isomorphic to G (given by the elements of the form (g, 1)), and one isomorphic to H (comprising the elements (1, h)). The reverse also holds. There is the following recognition theorem: If a group K contains two normal subgroups G \text H, such that K = GH and the intersection of G \text H contains only the identity, then K is isomorphic to G \times H. A relaxation of these conditions, requiring only one subgroup to be normal, gives the semidirect product. As an example, take as G \text H two copies of the unique (up to isomorphisms) group of order 2, C^2: say \ \text \. Then C_2 \times C_2 = \, with the operation element by element. For instance, (1,b)^* (a,1) = \left(1^* a, b^* 1\right) = (a, b), and(1,b)^* (1, b) = \left(1, b^2\right) = (1, 1). With a direct product, we get some natural group homomorphisms for free: the projection maps defined by \begin \pi_1: G \times H \to G, \ \ \pi_1(g, h) &= g \\ \pi_2: G \times H \to H, \ \ \pi_2(g, h) &= h \end are called the coordinate functions. Also, every homomorphism f to the direct product is totally determined by its component functions f_i = \pi_i \circ f. For any group (G, \circ) and any integer n \geq 0, repeated application of the direct product gives the group of all n-
tuple In mathematics, a tuple is a finite ordered list (sequence) of elements. An -tuple is a sequence (or ordered list) of elements, where is a non-negative integer. There is only one 0-tuple, referred to as ''the empty tuple''. An -tuple is defi ...
s G^n (for n = 0, this is the trivial group), for example \Z^n and \R^n.


Direct product of modules

The direct product for
modules Broadly speaking, modularity is the degree to which a system's components may be separated and recombined, often with the benefit of flexibility and variety in use. The concept of modularity is used primarily to reduce complexity by breaking a s ...
(not to be confused with the
tensor product In mathematics, the tensor product V \otimes W of two vector spaces and (over the same field) is a vector space to which is associated a bilinear map V\times W \to V\otimes W that maps a pair (v,w),\ v\in V, w\in W to an element of V \otime ...
) is very similar to the one defined for groups above, using the Cartesian product with the operation of addition being componentwise, and the scalar multiplication just distributing over all the components. Starting from \R we get
Euclidean space Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, that is, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are Euclidea ...
\R^n, the prototypical example of a real n-dimensional vector space. The direct product of \R^m and \R^n is \R^. Note that a direct product for a finite index \prod_^n X_i is canonically isomorphic to the direct sum \bigoplus_^n X_i. The direct sum and direct product are not isomorphic for infinite indices, where the elements of a direct sum are zero for all but for a finite number of entries. They are dual in the sense of category theory: the direct sum is the coproduct, while the direct product is the product. For example, consider X = \prod_^\infty \R and Y = \bigoplus_^\infty \R, the infinite direct product and direct sum of the real numbers. Only sequences with a finite number of non-zero elements are in Y. For example, (1, 0, 0, 0, \ldots) is in Y but (1, 1, 1, 1, \ldots) is not. Both of these sequences are in the direct product X; in fact, Y is a proper subset of X (that is, Y \subset X).


Topological space direct product

The direct product for a collection of
topological space In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called poin ...
s X_i for i in I, some index set, once again makes use of the Cartesian product \prod_ X_i. Defining the
topology In mathematics, topology (from the Greek words , and ) is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing ...
is a little tricky. For finitely many factors, this is the obvious and natural thing to do: simply take as a basis of open sets to be the collection of all Cartesian products of open subsets from each factor: \mathcal B = \left\. This topology is called the
product topology In topology and related areas of mathematics, a product space is the Cartesian product of a family of topological spaces equipped with a natural topology called the product topology. This topology differs from another, perhaps more natural-seem ...
. For example, directly defining the product topology on \R^2 by the open sets of \R (disjoint unions of open intervals), the basis for this topology would consist of all disjoint unions of open rectangles in the plane (as it turns out, it coincides with the usual metric topology). The product topology for infinite products has a twist, and this has to do with being able to make all the projection maps continuous and to make all functions into the product continuous if and only if all its component functions are continuous (that is, to satisfy the categorical definition of product: the morphisms here are continuous functions): we take as a basis of open sets to be the collection of all Cartesian products of open subsets from each factor, as before, with the proviso that all but finitely many of the open subsets are the entire factor: \mathcal B = \left\. The more natural-sounding topology would be, in this case, to take products of infinitely many open subsets as before, and this does yield a somewhat interesting topology, the
box topology In topology, the cartesian product of topological spaces can be given several different topologies. One of the more obvious choices is the box topology, where a base is given by the Cartesian products of open sets in the component spaces. Another p ...
. However it is not too difficult to find an example of bunch of continuous component functions whose product function is not continuous (see the separate entry box topology for an example and more). The problem which makes the twist necessary is ultimately rooted in the fact that the intersection of open sets is only guaranteed to be open for finitely many sets in the definition of topology. Products (with the product topology) are nice with respect to preserving properties of their factors; for example, the product of Hausdorff spaces is Hausdorff; the product of connected spaces is connected, and the product of compact spaces is compact. That last one, called Tychonoff's theorem, is yet another equivalence to the
axiom of choice In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that ''a Cartesian product of a collection of non-empty sets is non-empty''. Informally put, the axiom of choice says that given any collection ...
. For more properties and equivalent formulations, see the separate entry
product topology In topology and related areas of mathematics, a product space is the Cartesian product of a family of topological spaces equipped with a natural topology called the product topology. This topology differs from another, perhaps more natural-seem ...
.


Direct product of binary relations

On the Cartesian product of two sets with binary relations R \text S, define (a, b) T (c, d) as a R c \text b S d. If R \text S are both reflexive,
irreflexive In mathematics, a binary relation ''R'' on a set ''X'' is reflexive if it relates every element of ''X'' to itself. An example of a reflexive relation is the relation " is equal to" on the set of real numbers, since every real number is equal ...
, transitive, symmetric, or antisymmetric, then T will be also. Similarly, totality of T is inherited from R \text S. Combining properties it follows that this also applies for being a preorder and being an equivalence relation. However if R \text S are
connected relation In mathematics, a relation on a set is called connected or total if it relates (or "compares") all pairs of elements of the set in one direction or the other while it is called strongly connected if it relates pairs of elements. As described i ...
s, T need not be connected; for example, the direct product of \,\leq\, on \N with itself does not relate (1, 2) \text (2, 1).


Direct product in universal algebra

If \Sigma is a fixed
signature A signature (; from la, signare, "to sign") is a Handwriting, handwritten (and often Stylization, stylized) depiction of someone's name, nickname, or even a simple "X" or other mark that a person writes on documents as a proof of identity and ...
, I is an arbitrary (possibly infinite) index set, and \left(\mathbf_i\right)_ is an indexed family of \Sigma algebras, the direct product \mathbf = \prod_ \mathbf_i is a \Sigma algebra defined as follows: * The universe set A of \mathbf is the Cartesian product of the universe sets A_i of \mathbf_i, formally: A = \prod_ A_i. * For each n and each n-ary operation symbol f \in \Sigma, its interpretation f^ in \mathbf is defined componentwise, formally: for all a_1, \dotsc, a_n \in A and each i \in I, the ith component of f^\!\left(a_1, \dotsc, a_n\right) is defined as f^\!\left(a_1(i), \dotsc, a_n(i)\right). For each i \in I, the ith projection \pi_i : A \to A_i is defined by \pi_i(a) = a(i). It is a surjective homomorphism between the \Sigma algebras \mathbf \text \mathbf_i.Stanley N. Burris and H.P. Sankappanavar, 1981.
A Course in Universal Algebra.
' Springer-Verlag. . Here: Def.7.8, p.53 (=p. 67 in pdf file)
As a special case, if the index set I = \, the direct product of two \Sigma algebras \mathbf_1 \text \mathbf_2 is obtained, written as \mathbf = \mathbf_1 \times \mathbf_2. If \Sigma just contains one binary operation f, the above definition of the direct product of groups is obtained, using the notation A_1 = G, A_2 = H, f^ = \circ, \ f^ = \cdot, \ \text f^A = \times. Similarly, the definition of the direct product of modules is subsumed here.


Categorical product

The direct product can be abstracted to an arbitrary category. In a category, given a collection of objects (A_i)_ indexed by a set I, a product of these objects is an object A together with morphisms p_i \colon A \to A_i for all i \in I, such that if B is any other object with morphisms f_i \colon B \to A_i for all i \in I, there exists a unique morphism B \to A whose composition with p_i equals f_i for every i. Such A and (p_i)_ do not always exist. If they do exist, then (A,(p_i)_) is unique up to isomorphism, and A is denoted \prod_ A_i. In the special case of the category of groups, a product always exists: the underlying set of \prod_ A_i is the Cartesian product of the underlying sets of the A_i, the group operation is componentwise multiplication, and the (homo)morphism p_i \colon A \to A_i is the projection sending each tuple to its ith coordinate.


Internal and external direct product

Some authors draw a distinction between an internal direct product and an external direct product. If A, B \subseteq X and A \times B \cong X, then we say that X is an ''internal'' direct product of A \text B, while if A \text B are not subobjects then we say that this is an ''external'' direct product.


See also

* * * * * * * *


Notes


References

* {{DEFAULTSORT:Direct Product Abstract algebra ru:Прямое произведение#Прямое произведение групп