Question about Algebraic structure? Mathematicians use parentheses to represent a algebraic structure e.g. $ (G, \times)$.
Also parentheses are used to represent ordered pair (or general ordered n-tuple) e.g. $(x,y)$. 
My question: Is algebraic structure in fact a ordered pair consisting of set and operation? I have friend, and he says Yes, but I am little suspicions. Thanks.  
 A: The situation may perhaps be clarified if one recalls that functions are often defined as sets of ordered pairs.  That is, a function $f:X \to Y$ is a subset of $X \color{red}\times Y$ with the additional property that if $(x, y_1), (x, y_2) \in f \subset X \color{red}\times Y$ then we must have $y_1 = y_2$; this latter requirement formalizing the notion that $f$ takes a unique value for each $x$, as opposed to a mere relation which may have $(x, y_i) \in f$ for many $y_i \in Y$.  Thus, in the case of "$\times$" in $(G, \times)$ being a binary operation, it represents a set of ordered pairs in $G \color{red}\times G$; we might even write $\times \subset G \color{red}\times G$, although care must be taken to distinguish between the two meanings of the symbols "$\times$" in this formal "sentence".  In any event, the ordered pair $(G, \times)$ has as its first element the set $G$, and as its second the set $\times \subset G \color{red}\times G$; it is an ordered pair of sets.  I trust the potentially confusing use of the symbol $\times$ here is nevertheless clear enough to be unambiguous; the context and color should resolve any doubts as to which "$\times$" means what!
Note added edit: At the suggestion of our colleague Git Gud (see his comments below), I have use the red typeface for $\times$ as Cartesian product of two sets.  This should further reduce any chance of confusion. End note.
Hope this helps.  Cheers,
and as always,
Fiat Lux!!!
A: The answer to your question is sort-of.
One way to think about algebraic structures is that they consist of a set of elements, and there are (possibly) some operations you can apply to elements.
Thus, when we think this way, we need some sort of data structure to hold all of the relevant pieces if we want to work with them in a set-theoretic manner.
For example, for groups, we need a data structure that contains the set of elements in the group, the multiplication operation, the inversion operation, and which element is the identity.
The standard way to create this data structure is to use an ordered 4-tuple: the first entry contains the set of elements, the second contains the identity element, the third contains the inversion operation, and the fourth contains the multiplication operation. The operations are stored in this 4-tuple in the form of set-theoretic functions.
Other data structures could be used as well to denote groups, so long as these four pieces of information can still be extracted. An ordered pair consisting of just the set of elements and the multiplication operation is a popular choice.
This convention also gives a cute notational shortcut: saying "the group $(G, 0, -, +)$" is much more concise than "a group whose set of elements we will call $G$, whose group operation we will denote as $+$, whose negation element we will denote as $-$, and whose identity we will write as $0$".
