Editing Direct product

{{Short description|Generalization of the Cartesian product}}
In [[mathematics]], a '''direct product''' of objects already known can often be defined by giving a new one. That induces a structure on the [[Cartesian product]] of the underlying [[set (mathematics)|sets]] from that of the contributing objects. More abstractly, the [[product (category theory)|product in category theory]] is mentioned, which formalizes those notions.

Examples are the product of sets, [[group (mathematics)|groups]] (described below), [[product ring|rings]], and other [[algebraic structures]]. The [[product topology|product]] of [[topological spaces]] is another instance.

There is also the [[direct sum]], which in some areas is used interchangeably but in others is a different concept.

== Examples ==
* If <math>\R</math> is thought of as the set of [[real numbers]] without further structure, the direct product <math>\R \times \R</math> is just the Cartesian product <math>\{(x,y) : x,y \in \R\}.</math>
* If <math>\R</math> is thought of as the [[group (mathematics)|group]] of real numbers under addition, the direct product <math>\R\times \R</math> still has <math>\{(x,y) : x,y \in \R\}</math> as its underlying set. The difference between this and the preceding examples is that <math>\R \times \R</math> is now a group and so how to add their elements must also be stated. That is done by defining <math>(a,b) + (c,d) = (a+c, b+d).</math>
* If <math>\R</math> is thought of as the [[ring (mathematics)|ring]] of real numbers, the direct product <math>\R\times \R</math> again has <math>\{(x,y) : x,y \in \R\}</math> as its underlying set. The ring structure consists of addition defined by <math>(a,b) + (c,d) = (a+c, b+d)</math> and multiplication defined by <math>(a,b) (c,d) = (ac, bd).</math>
* Although the ring <math>\R</math> is a [[field (mathematics)|field]], <math>\R \times \R</math> is not because the nonzero element <math>(1,0)</math> does not have a [[multiplicative inverse]].

In a similar manner, the direct product of finitely many algebraic structures can be talked about; for example, <math>\R \times \R \times \R \times \R.</math> That relies on the direct product being [[associative]] [[up to]] [[isomorphism]]. That is, <math>(A \times B) \times C \cong A \times (B \times C)</math> for any algebraic structures <math>A,</math> <math>B,</math> and <math>C</math> of the same kind. The direct product is also [[commutative]] up to isomorphism; that is, <math>A \times B \cong B \times A</math> for any algebraic structures <math>A</math> and <math>B</math> of the same kind. Even the direct product of infinitely many algebraic structures can be talked about; for example, the direct product of [[countably infinite|countably]] many copies of <math>\mathbb R,</math> is written as <math>\R \times \R \times \R \times \dotsb.</math>

== Direct product of groups ==
{{main|Direct product of groups|Direct sum}}
In [[group (mathematics)|group theory]], define the direct product of two groups <math>(G, \circ)</math> and <math>(H, \cdot),</math> can be denoted by <math>G \times H.</math> For [[abelian group|abelian groups]] that are written additively, it may also be called the [[direct sum of groups|direct sum of two groups]], denoted by <math>G \oplus H.</math>

It is defined as follows:
* the [[Set (mathematics)|set]] of the elements of the new group is the ''Cartesian product'' of the sets of elements of <math>G \text{ and } H,</math> that is <math>\{(g, h) : g \in G, h \in H\};</math>
* on these elements put an operation, defined element-wise: <math display="block">(g, h) \times \left(g', h'\right) = \left(g \circ g', h \cdot h'\right)</math>
Note that <math>(G, \circ)</math> may be the same as <math>(H, \cdot).</math>

The construction gives a new group, which has a [[normal subgroup]] that is isomorphic to <math>G</math> (given by the elements of the form <math>(g, 1)</math>) and one that is isomorphic to <math>H</math> (comprising the elements <math>(1, h)</math>).

The reverse also holds in the recognition theorem. If a group <math>K</math> contains two normal subgroups <math>G \text{ and } H,</math> such that <math>K = GH</math> and the intersection of <math>G \text{ and } H</math> contains only the identity, <math>K</math> is isomorphic to <math>G \times H.</math> A relaxation of those conditions by requiring only one subgroup to be normal gives the [[semidirect product]].

For example, <math>G \text{ and } H</math> are taken as two copies of the unique (up to isomorphisms) group of order 2, <math>C^2:</math> say <math>\{1, a\} \text{ and } \{1, b\}.</math> Then, <math>C_2 \times C_2 = \{(1,1), (1,b), (a,1), (a,b)\},</math> with the operation element by element. For instance, <math>(1,b)^* (a,1) = \left(1^* a, b^* 1\right) = (a, b),</math> and<math>(1,b)^* (1, b) = \left(1, b^2\right) = (1, 1).</math>

With a direct product, some natural [[group homomorphisms]] are obtained for free: the projection maps defined by
<math display=block>\begin{align}
  \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{align}</math>
are called the '''coordinate functions'''.

Also, every homomorphism <math>f</math> to the direct product is totally determined by its component functions <math>f_i = \pi_i \circ f.</math>

For any group <math>(G, \circ)</math> and any integer <math>n \geq 0,</math> repeated application of the direct product gives the group of all <math>n</math>-[[tuples]]  <math>G^n</math> (for <math>n = 0,</math> that is the [[trivial group]]); for example, <math>\Z^n</math> and <math>\R^n.</math>

== Direct product of modules ==
The direct product for [[module (mathematics)|modules]] (not to be confused with the [[tensor product of modules|tensor product]]) is very similar to the one that is defined for groups above by using the Cartesian product with the operation of addition being componentwise, and the [[scalar multiplication]] just distributing over all the components. Starting from <math>\R</math>, [[Euclidean space]] <math>\R^n</math> is gotten, the prototypical example of a real <math>n</math>-dimensional vector space. The direct product of <math>\R^m</math> and <math>\R^n</math> is <math>\R^{m+n}.</math>

A direct product for a finite index <math display="inline">\prod_{i=1}^n X_i</math> is canonically isomorphic to the [[direct sum of modules|direct sum]] <math display="inline">\bigoplus_{i=1}^n X_i.</math> The direct sum and the direct product are not isomorphic for infinite indices for which 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]], and the direct product is the product.

For example, for <math display="inline">X = \prod_{i=1}^\infty \R</math> and <math display="inline">Y = \bigoplus_{i=1}^\infty \R,</math> the infinite direct product and direct sum of the real numbers. Only sequences with a finite number of non-zero elements are in <math>Y.</math> For example, <math>(1, 0, 0, 0, \ldots)</math> is in <math>Y</math> but <math>(1, 1, 1, 1, \ldots)</math> is not. Both sequences are in the direct product <math>X;</math> in fact, <math>Y</math> is a proper subset of <math>X</math> (that is, <math>Y \subset X</math>).<ref>{{Cite web|url=http://mathworld.wolfram.com/DirectProduct.html|title=Direct Product| last = Weisstein | first = Eric W.|website=mathworld.wolfram.com|language=en|access-date=2018-02-10}}</ref><ref>{{Cite web |url=http://mathworld.wolfram.com/GroupDirectProduct.html|title=Group Direct Product| last = Weisstein | first = Eric W.| website=mathworld.wolfram.com | language=en|access-date=2018-02-10}}</ref>

== Topological space direct product ==
The direct product for a collection of [[topological spaces]] <math>X_i</math> for <math>i</math> in <math>I,</math> some index set, once again makes use of the Cartesian product
<math display=block>\prod_{i \in I} X_i.</math>

Defining the [[topology]] is a little tricky. For finitely many factors, it is the obvious and natural thing to do: simply take as a [[basis (topology)|basis]] of open sets to be the collection of all Cartesian products of open subsets from each factor:
<math display=block>\mathcal B = \left\{U_1 \times \cdots \times U_n\ : \ U_i\ \mathrm{open\ in}\ X_i\right\}.</math>

That topology is called the [[product topology]]. For example, by directly defining the product topology on <math>\R^2</math> by the open sets of <math>\R</math> (disjoint unions of open intervals), the basis for that topology would consist of all disjoint unions of open rectangles in the plane (as it turns out, it coincides with the usual [[metric space|metric]] topology).

The product topology for infinite products has a twist, which 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). The basis of open sets is taken 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:
<math display=block>\mathcal B = \left\{ \prod_{i \in I} U_i\ : \ (\exists j_1,\ldots,j_n)(U_{j_i}\ \mathrm{open\ in}\ X_{j_i})\ \mathrm{and}\ (\forall i \neq j_1,\ldots,j_n)(U_i = X_i) \right\}.</math>

The more natural-sounding topology would be, in this case, to take products of infinitely many open subsets as before, which yields a somewhat interesting topology, the [[box topology]]. 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 that makes the twist necessary is ultimately rooted in the fact that the intersection of open sets is guaranteed to be open only 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]].

For more properties and equivalent formulations, see [[product topology]].

== Direct product of binary relations ==
On the Cartesian product of two sets with [[binary relations]] <math>R \text{ and } S,</math> define <math>(a, b) T (c, d)</math> as <math>a R c \text{ and } b S d.</math> If <math>R \text{ and } S</math> are both [[reflexive relation|reflexive]], [[Irreflexive relation|irreflexive]], [[transitive relation|transitive]], [[Symmetric relation|symmetric]], or [[Antisymmetric relation|antisymmetric]], then <math>T</math> will be also.<ref>{{cite web| url = http://cr.yp.to/2005-261/bender1/EO.pdf| title = Equivalence and Order}}</ref> Similarly, [[total relation|totality]] of <math>T</math> is inherited from <math>R \text{ and } S.</math> If the properties are combined, that also applies for being a [[preorder]] and being an [[equivalence relation]]. However, if <math>R \text{ and } S</math> are [[connected relation|connected relations]], <math>T</math> need not be connected; for example, the direct product of <math>\,\leq\,</math> on <math>\N</math> with itself does not relate <math>(1, 2) \text{ and } (2, 1).</math>

== Direct product in universal algebra ==
If <math>\Sigma</math> is a fixed [[signature (logic)|signature]], <math>I</math> is an arbitrary (possibly infinite) index set, and <math>\left(\mathbf{A}_i\right)_{i \in I}</math> is an [[indexed family]] of <math>\Sigma</math> algebras, the '''direct product''' <math display="inline">\mathbf{A} = \prod_{i \in I} \mathbf{A}_i</math> is a <math>\Sigma</math> algebra defined as follows:
* The universe set <math>A</math> of <math>\mathbf{A}</math> is the Cartesian product of the universe sets <math>A_i</math> of <math>\mathbf{A}_i,</math> formally: <math display="inline">A = \prod_{i \in I} A_i.</math>
* For each <math>n</math> and each <math>n</math>-ary operation symbol <math>f \in \Sigma,</math> its interpretation <math>f^{\mathbf{A}}</math> in <math>\mathbf{A}</math> is defined componentwise, formally. For all <math>a_1, \dotsc, a_n \in A</math> and each <math>i \in I,</math> the <math>i</math>th component of <math>f^{\mathbf{A}}\!\left(a_1, \dotsc, a_n\right)</math> is defined as <math>f^{\mathbf{A}_i}\!\left(a_1(i), \dotsc, a_n(i)\right).</math> 
For each <math>i \in I,</math> the <math>i</math>th projection <math>\pi_i : A \to A_i</math> is defined by <math>\pi_i(a) = a(i).</math> It is a [[surjective homomorphism]] between the <math>\Sigma</math> algebras <math>\mathbf{A} \text{ and } \mathbf{A}_i.</math><ref>Stanley N. Burris and H.P. Sankappanavar, 1981. ''[http://www.thoralf.uwaterloo.ca/htdocs/ualg.html A Course in Universal Algebra.]''  Springer-Verlag. {{ISBN|3-540-90578-2}}. Here: Def. 7.8, p. 53 (p. 67 in PDF)</ref>

As a special case, if the index set <math>I = \{1, 2\},</math> the direct product of two <math>\Sigma</math> algebras <math>\mathbf{A}_1 \text{ and } \mathbf{A}_2</math> is obtained, written as <math>\mathbf{A} = \mathbf{A}_1 \times \mathbf{A}_2.</math> If <math>\Sigma</math> contains only one binary operation <math>f,</math> the [[#Group direct product|above]] definition of the direct product of groups is obtained by using the notation <math>A_1 = G, A_2 = H,</math> <math>f^{A_1} = \circ, \ f^{A_2} = \cdot, \ \text{ and } f^A = \times.</math> Similarly, the definition of the direct product of modules is subsumed here.

== Categorical product ==
{{Main|Product (category theory)}}
The direct product can be abstracted to an arbitrary [[category theory|category]]. In a category, given a collection of objects <math>(A_i)_{i \in I}</math> indexed by a set <math>I</math>, a '''product''' of those objects is an object <math>A</math> together with [[morphisms]] <math>p_i \colon A \to A_i</math> for all <math>i \in I</math>, such that if <math>B</math> is any other object with morphisms <math>f_i \colon B \to A_i</math> for all <math>i \in I</math>, there is a unique morphism <math>B \to A</math> whose composition with <math>p_i</math> equals <math>f_i</math> for every <math>i</math>.  
<!-- This is easier to visualize as a [[commutative diagram]]; eventually, somebody should insert a relevant diagram for the categorical product here! -->
Such <math>A</math> and <math>(p_i)_{i \in I}</math> do not always exist. If they exist, then <math>(A,(p_i)_{i \in I})</math> is unique up to isomorphism, and <math>A</math> is denoted <math>\prod_{i \in I} A_i</math>.

In the special case of the category of groups, a product always exists. The underlying set of <math>\prod_{i \in I} A_i</math> is the Cartesian product of the underlying sets of the <math>A_i</math>, the group operation is componentwise multiplication, and the (homo)morphism <math>p_i \colon A \to A_i</math> is the projection sending each tuple to its <math>i</math>th coordinate.

== Internal and external direct product ==
<!-- linked from [[Internal direct product]] and [[External direct product]] -->
{{see also|Internal direct sum}}
Some authors draw a distinction between an '''internal direct product''' and an '''external direct product'''. For example, if <math>A</math> and <math>B</math> are subgroups of an additive abelian group <math>G</math> such that <math>A + B = G</math> and <math>A \cap B = \{0\}</math>, <math>A \times B \cong G,</math> and it is said that <math>G</math> is the ''internal'' direct product of <math>A</math> and <math>B</math>. To avoid ambiguity, the set <math>\{\, (a,b) \mid a \in A, \, b \in B \,\}</math> can be referred to as the ''external'' direct product of <math>A</math> and <math>B</math>.

== See also ==
* {{annotated link|Direct sum}}
* {{annotated link|Cartesian product}}
* {{annotated link|Coproduct}}
* {{annotated link|Free product}}
* {{annotated link|Semidirect product}}
* {{annotated link|Zappa–Szep product}}
* {{annotated link|Tensor product of graphs}}
* {{annotated link|Total order#Orders on the Cartesian product of totally ordered sets|Orders on the Cartesian product of totally ordered sets}}

== Notes ==
{{reflist}}

== References ==
* {{Lang Algebra}}

{{DEFAULTSORT:Direct Product}}
[[Category:Abstract algebra]]

[[ru:Прямое произведение#Прямое произведение групп]]