Anticommutative

Anticommutative
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Anticommutative".

In mathematics, anticommutativity refers to the property of an operation being anticommutative, i.e. being non-commutative in a precise way. Anticommutative operations are widely used in algebra, geometry, mathematical analysis and, as a consequence in physics: they are often called antisymmetric operations.

content

1 Definition
2 Properties
3 Examples
4 See also
5 References
6 External links

Definition

An $n$ -ary operation is anticommutative if swapping the order of any two arguments negates the result. For example, a binary operation * is anticommutative if for all x and y, x*y = −y*x.

More formally, a map $\scriptstyle *:A^n \longrightarrow \mathfrak{G}$ from the set of all n-tuples of elements in a set $A$ (where $n$ is a general integer) to a group $\scriptstyle\mathfrak{G}$ (whose operation is written in additive notation for the sake of simplicity), is anticommutative if and only if

$x_1*x_2*\dots*x_n = \sgn(\sigma) x_{\sigma(1)}*x_{\sigma(2)}*\dots* x_{\sigma(n)} \qquad \forall\boldsymbol{x} = (x_1,x_2,\dots,x_n) \in A^n$

where $\scriptstyle\sigma:(n)\longrightarrow(n)$ is an arbitrary permutation of the set $(n)$ of first $n$ non-zero integers and $sgn(σ)$ is its sign. This equality expresses the following concept

the value of the operation is unchanged, when applied to all ordered tuples constructed by even permutation of the elements of a fixed one.
the value of the operation is the inverse of its value on a fixed tuple, when applied to all ordered tuples constructed by odd permutation to the elements of the fixed one. The need for the existence of this inverse element is the main reason for requiring the codomain $\scriptstyle\mathfrak{G}$ of the operation to be at least a group.

Note that this is an abuse of notation, since the codomain of the operation needs only to be a group: " $- 1$ " has not a precise meaning since a multiplication is not necessarily defined on $\scriptstyle\mathfrak{G}$ .

Particularly important is the case $n = 2$ . A binary operation $\scriptstyle *:A\times A\longrightarrow \mathfrak{G}$ is anticommutative if and only if

$x_1 * x_2 = -x_2 * x_1 \qquad\forall(x_1,x_2)\in A\times A$

This means that $\scriptstyle x_1 * x_2$ is the inverse of the element $\scriptstyle x_2 * x_1$ in $\scriptstyle\mathfrak{G}$ .

Properties

If the group $\scriptstyle\mathfrak{G}$ is such that

$\mathfrak{-a} = \mathfrak{a} \iff \mathfrak{a} = \mathfrak{0}\qquad \forall \mathfrak{a} \in \mathfrak{G}$

i.e. the only element equal to its inverse is the neutral element, then for all the ordered tuples such that $x j = x i$ for at least two different index $i, j$

$x_1*x_2*\dots*x_n = \mathfrak{0}$

In the case $n = 2$ this means

$x_1*x_1 = x_2*x_2 = \mathfrak{0}$

Examples

Anticommutative operators include:

References

Bourbaki, Nicolas (1989). Algebra. Chapters 1-3 (paperback ed.). Berlin, Heidelberg, New York: Springer-Verlag, ISBN 3-540-64243-9, chapter III, "Tensor algebras, exterior algebras, symmetric algebras".

External links

Look up Anticommutativity in
Wiktionary, the free dictionary.

Weisstein, Eric W."Anticommutative". From MathWorld--A Wolfram Web Resource.
A.T. Gainov, "Anti-commutative algebra", Springer-Verlag Online Encyclopaedia of Mathematics.

Your Ad Here

Contents

Definition

Properties

Examples

See also

References

External links