n-ary derived operation in universal algebra I've just come across the definition of the n-ary derived operation, namely that starting with an operational type $(\Omega, \alpha)$, set $ X_n = (x_1, ... , x_n) $ and $ \Omega$-structure $A$, we can define a function $ t_A : A^n \to A $ for each $t \in FX_n $ inductively as follows:
if $ t = x_i \ (1 \leq i \leq n) $, then $t_A$ is the projection map onto the ith factor. 
if $ t = \omega t_1 ... t_m$ where $ \alpha(\omega) = m $, then $t_A$ is the composite map $ \omega_A \circ ((t_1)_A, ... , (t_m)_A)  : A^n \to A^m \to A $.
In particular, if $t$ is the term $\omega x_1 ... x_n $ where $ n = \alpha(\omega) $, then $ t_A = \omega_A$. 
Now I'm trying to make this definition more concrete, by interpreting it in a group theoretical context. Take $ \Omega = (m, i, e) $, where $m, i, e$ are the binary, unary and nullary group operations respectively. Now, I'm getting confused about the roles that $ X_n$ and $A$ play here. Which should I take to be the set of elements of the group? What should the other be interpreted as (if applicable)?
Thanks
 A: This is simply the recursive definition of the $n$-ary operations induced by $\Omega$-terms in the "variables" $x_1,\ldots,x_n$. For example, in groups the commutator $\:[x_1,x_2]\: :=\: x_1\:x_2\:x_1^{-1}\:x_2^{-1}\:$ is a derived binary operation, and $x_1\:x_2^{-1}\:x_3\:$ is a derived ternary operation, and the $n$-ary product $\:x_1\:x_2\:\cdots\:x_n\:$ is a derived $n$-ary operation. In other words, every term in the free $\Omega$-algebra $F_\Omega\{x_1,\ldots,x_n\}$ induces an $n$-ary function by simply evaluating the term on the supplied arguments. It's just the analog in general equational algebras (varieties) of the well-known fact that formal $n$-variable polynomials over a ring induce $n$-ary polynomial functions on the ring.
A: In this context, "an $\Omega$-structure $A$" just means a particular group $\mathbf{G}$. "$FX_n$" means the free group on $X_n=\{x_1,\ldots,x_n\}$. The function $t_A\colon A^n\to A$ is a set-theoretic function from the $n$th fold cartesian power of (the underlying set of) $A$ to the set $A$, and is defined in terms of an element $t\in FX_n$.
For example, say $A=S_3$, the symmetric group in three letters; $n=4$, so $FX_4$ is the free group in $x_1,x_2,x_3,x_4$. For each element $t\in FX_4$ we get a function from $A^4$ to $A$.


*

*The function associated to $t=x_3$, for example, is just the function that sends $(\sigma_1,\sigma_2,\sigma_3,\sigma_4)$ to $\sigma_3$ for all $\sigma_i\in G$. 

*The function associated to $t=x_1x_2x_3^{-1}$ is the function that sends $(\sigma_1,\sigma_2,\sigma_3,\sigma_4)$ to $\sigma_1\sigma_2\sigma_3^{-1}$.

*The function associated to $t=x_3x_2^{-1}x_4^2x_1x_3^{-1}$ is the function that sends $(\sigma_1,\sigma_2,\sigma_3,\sigma_4)$ to $\sigma_3\sigma_2^{-1}\sigma_4^2\sigma_1\sigma_3^{-1}$. 
etc. Each element of the free group gives you an operation on $A$.
A: In the context of groups, $A$ is the underlying set, $m$ is group multiplication, $i$ is the group inverse, and $e$ is the identity. The axioms of groups are:


*

*$m(a,m(b,c)) = m(m(a,b),c)$ (associativity).

*$m(a,i(a)) = m(i(a),a))$ (inverse).

*$m(a,e) = m(e,a) = a$ (identity element).

