Opposite ring

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, specifically abstract algebra, the opposite of a ring is another ring with the same elements and addition operation, but with the multiplication performed in the reverse order. More explicitly, the opposite of a ring Template:Nowrap is the ring Template:Nowrap whose multiplication ∗ is defined by Template:Nowrap for all Template:Nowrap in R.[1]Template:Sfn The opposite ring can be used to define multimodules, a generalization of bimodules. They also help clarify the relationship between left and right modules (see Template:Section link).

Monoids, groups, rings, and algebras can all be viewed as categories with a single object. The construction of the opposite category generalizes the opposite group, opposite ring, etc.

Relation to automorphisms and antiautomorphisms

In this section the symbol for multiplication in the opposite ring is changed from asterisk to diamond, to avoid confusing it with some unary operations.

A ring is called a self-opposite ring if it is isomorphic to its opposite ring,Template:R[2]Template:Efn which name indicates that Rop is essentially the same as Template:Tmath.

All commutative rings are self-opposite.

Let us define the antiisomorphism

Template:Tmath, where ι(a)=a for Template:Tmath.Template:Efn

It is indeed an antiisomorphism, since Template:Tmath. The antiisomorphism ι can be defined generally for semigroups, monoids, groups, rings, rngs, algebras. In case of rings (and rngs) we obtain the general equivalence.

A ringTemplate:Efn is self-opposite if and only if it has at least one antiautomorphism.

Proof: Template:Tmath: Let (R,) be self-opposite. If f:(R,)(R,) is an isomorphism, then Template:Tmath, being a composition of antiisomorphism and isomorphism, is an antiisomorphism from (R,) to itself, hence antiautomorphism.

Template:Tmath: If g:(R,)(R,) is an antiautomorphism, then (ι1g):(R,)(R,) is an isomorphism as a composition of two antiisomorphisms. So (R,) is self-opposite.

and

If (R,) is self-opposite and the group of automorphisms Aut(R,) is finite, then the number of antiautomorphisms equals the number of automorphisms.

Proof: By the assumption and the above equivalence there exist antiautomorphisms. If we pick one of them and denote it by Template:Tmath, then the map Template:Tmath, where h runs over Template:Tmath, is clearly injective but also surjective, since each antiautomorphism g=q(q1g)=qh for some automorphism Template:Tmath.

It can be proven in a similar way, that under the same assumptions the number of isomorphisms from (R,) to (R,) equals the number of antiautomorphisms of Template:Tmath.

If some antiautomorphism g is also an automorphism, then for each a,b(R,)

g(ab)=g(b)g(a)=g(ba)

Since g is bijective, ab=ba for all a and Template:Tmath, so the ring is commutative and all antiautomorphisms are automorphisms. By contraposition, if a ring is noncommutative (and self-opposite), then no antiautomorphism is an automorphism.

Denote by G the group of all automorphisms together with all antiautomorphisms. The above remarks imply, that |G|=2|Aut(R,)| if a ring (or rng) is noncommutative and self-opposite. If it is commutative or non-self-opposite, then Template:Tmath.

Examples

The smallest noncommutative ring with unity

The smallest such ring R has eight elements and it is the only noncommutative ring among 11 rings with unity of order 8, up to isomorphism.[3] It has the additive group Template:Tmath.[4]Template:Rp Obviously Rop is antiisomorphic to Template:Tmath, as is always the case, but it is also isomorphic to Template:Tmath. Below are the tables of addition and multiplication in Template:Tmath,Template:Efn and multiplication in the opposite ring, which is a transposed table.

Addition
+ 0 1 2 3 4 5 6 7
0 0 1 2 3 4 5 6 7
1 1 0 6 7 5 4 2 3
2 2 6 0 4 3 7 1 5
3 3 7 4 0 2 6 5 1
4 4 5 3 2 0 1 7 6
5 5 4 7 6 1 0 3 2
6 6 2 1 5 7 3 0 4
7 7 3 5 1 6 2 4 0
   
Multiplication
0 1 2 3 4 5 6 7
0 0 0 0 0 0 0 0 0
1 0 1 2 3 4 5 6 7
2 0 2 1 3 7 5 6 4
3 0 3 5 3 6 5 6 0
4 0 4 4 0 4 0 0 4
5 0 5 3 3 0 5 6 6
6 0 6 6 0 6 0 0 6
7 0 7 7 0 7 0 0 7
   
Opposite multiplication
0 1 2 3 4 5 6 7
0 0 0 0 0 0 0 0 0
1 0 1 2 3 4 5 6 7
2 0 2 1 5 4 3 6 7
3 0 3 3 3 0 3 0 0
4 0 4 7 6 4 0 6 7
5 0 5 5 5 0 5 0 0
6 0 6 6 6 0 6 0 0
7 0 7 4 0 4 6 6 7

To prove that the two rings are isomorphic, take a map f:RopR given by the table

Isomorphism between R and Rop
x 0 1 2 3 4 5 6 7
f(x) 0 1 2 4 3 7 6 5

The map swaps elements in only two pairs: 34 and Template:Tmath. Rename accordingly the elements in the multiplication table for (arguments and values). Next, rearrange rows and columns to bring the arguments back to ascending order. The table becomes exactly the multiplication table of Template:Tmath. Similar changes in the table of additive group yield the same table, so f is an automorphism of this group, and since f(1)=1, it is indeed a ring isomorphism.

The map is involutory, i.e. Template:Tmath, so f1=f and it is an isomorphism from R to Rop equally well.

So, the permutation f can be reinterpreted to define isomorphism f:(R,)(R,) and then q=ιf is an antiautomorphism of (R,) given by the same permutation Template:Tmath.

The ring R has exactly two automorphisms: identity idR and p=(3,5)(4,7), that is Aut(R)={idR,p}. So its full group G has four elements with two of them antiautomorphisms. One is q and the second, denote it by r, can be calculated

r=qp=(3,4)(5,7)(3,5)(4,7)=(3,7)(4,5)
G={idR,p,q,r}={idR,(3,5)(4,7),(3,4)(5,7),(3,7)(4,5)}

There is no element of order 4, so the group is not cyclic and must be the group D2 (the Klein group Template:Tmath), which can be confirmed by calculation. The "symmetry group" of this ring is isomorphic to the symmetry group of rectangle.

Noncommutative ring with 27 elements

The ring of the upper triangular Template:Nowrap matrices over the field with 3 elements F3 has 27 elements and is a noncommutative ring. It is unique up to isomorphism, that is, all noncommutative rings with unity and 27 elements are isomorphic to it.Template:R The largest noncommutative ring S listed in the "Book of the Rings" has 27 elements, and is also isomorphic. In this section the notation from "The Book" for the elements of S is used. Two things should be kept in mind: that the element denoted by 18 is the unity of S and that 1 is not the unity.Template:R The additive group of S is Template:Tmath.Template:R

The group of all automorphisms Aut(S) has 6 elements:

h1=idSh2=(1,13,25)(2,26,14)(4,16,19)(5,20,17)(7,10,22)(8,23,11)h3=(1,25,13)(2,14,26)(4,19,16)(5,17,20)(7,22,10)(8,11,23)=h21=h22h4=(4,16)(5,17)(7,22)(8,23)(13,25)(14,26)(3,15)(6,21)(12,24)h5=(1,13)(2,26)(4,19)(8,11)(10,22)(17,20)(3,15)(6,21)(12,24)h6=(1,25)(2,14)(5,20)(7,10)(11,23)(16,19)(3,15)(6,21)(12,24).

Since S is self-opposite, it has also 6 antiautomorphisms. One isomorphism f:(S,)(S,) is Template:Tmath, which can be verified using the tables of operations in "The Book" like in the first example by renaming and rearranging. This time the changes should be made in the original tables of operations of S=(S,). The result is the multiplication table of Sop=(S,) and the addition table remains unchanged. Thus, one antiautomorphism

q1=ιf=(1,14,13,2,25,26)(4,20,16,17,19,5)(7,8,10,23,22,11)(3,15)(6,21)(12,24)

is given by the same permutation. The other five can be calculated (in the multiplicative notation the composition symbol can be dropped):

q2=q1h2=(1,14,13,2,25,26)(4,20,16,17,19,5)(7,8,10,23,22,11)(3,15)(6,21)(12,24)(1,13,25)(2,26,14)(4,16,19)(5,20,17)(7,10,22)(8,23,11)=[(1,14,13,2,25,26)(1,13,25)(2,26,14)][(4,20,16,17,19,5)(4,16,19)(5,20,17)][(7,8,10,23,22,11)(7,10,22)(8,23,11)](3,15)(6,21)(12,24)=(1,2)(13,26)(14,25)(4,17)(5,16)(19,20)(7,23)(8,22)(10,11)(3,15)(6,21)(12,24)=(1,2)(4,17)(5,16)(7,23)(8,22)(10,11)(13,26)(14,25)(19,20)(3,15)(6,21)(12,24)q3=q1h3=(1,26,25,2,13,14)(4,5,19,17,16,20)(7,11,22,23,10,8)(3,15)(6,21)(12,24)=q11q4=q1h4=(1,14)(2,25)(4,17)(5,19)(7,11)(8,22)(10,23)(13,26)(16,20)q5=q1h5=(1,2)(4,5)(7,8)(10,11)(13,14)(16,17)(19,20)(22,23)(25,26)q6=q1h6=(1,26)(2,13)(4,20)(5,16)(7,23)(8,10)(11,22)(14,25)(17,19)

G={h1,h2,h3,h4,h5,h6,q1,q2,q3,q4,q5,q6}.

The group G has 7 elements of order 2 (3 automorphisms and 4 antiautomorphisms) and can be identified as the dihedral group D6Template:Efn (see List of small groups). In geometric analogy the ring S has the "symmetry group" G isomorphic to the symmetry group of 3-antiprism,Template:Efn which is the point group D3d in Schoenflies notation or 3m in short Hermann–Mauguin notation for 3-dimensional space.

The smallest non-self-opposite rings with unity

All the rings with unity of orders ranging from 9 up to 15 are commutative,Template:R so they are self-opposite. The rings, that are not self-opposite, appear for the first time among the rings of order 16. There are 4 different non-self-opposite rings out of the total number of 50 rings with unity[5] having 16 elements (37[6] commutative and 13Template:R noncommutative).[7] They can be coupled in two pairs of rings opposite to each other in a pair, and necessarily with the same additive group, since an antiisomorphism of rings is an isomorphism of their additive groups.

One pair of rings R1Template:R and R2=R1op has the additive group C4×C2×C2Template:R and the other pair R3Template:R and Template:Tmath,Template:R the group Template:Tmath.Template:R Their tables of operations are not presented in this article, as they can be found in the source cited, and it can be verified that R3op=R4, they are opposite, but not isomorphic. The same is true for the pair R1 and Template:Tmath, however, the ring R~2Template:R listed in "The Book of the Rings" is not equal but only isomorphic to Template:Tmath.

The remaining Template:Nowrap noncommutative rings are self-opposite.

Free algebra with two generators

The free algebra kx,y over a field k with generators x,y has multiplication from the multiplication of words. For example,

(2x2yx+3yxy)(xyxy+1)= 2x2yx2yxy+2x2yx+3yxyxyxy+3yxy.

Then the opposite algebra has multiplication given by

(2x2yx+3yxy)*(xyxy+1)=(xyxy+1)(2x2yx+3yxy)=2xyxyx2yx+3xyxy2xy+2x2yx+3yxy,

which are not equal elements.

Quaternion algebra

The quaternion algebra H(a,b)[8] over a field F with a,bF× is a division algebra defined by three generators i,j,k with the relations

i2=a, j2=b, k=ij=ji

All elements xH(a,b) are of the form

x=x0+xii+xjj+xkk, where x0,xi,xj,xkF

For example, if F=, then H(1,1) is the usual quaternion algebra.

If the multiplication of H(a,b) is denoted , it has the multiplication table

i j k
i a k aj
j k b bi
k aj bi ab

Then the opposite algebra H(a,b)op with multiplication denoted * has the table

* i j k
i a k aj
j k b bi
k aj bi ab

Commutative ring

A commutative ring (R,) is isomorphic to its opposite ring (R,*)=Rop since xy=yx=x*y for all x and y in Template:Tmath. They are even equal Template:Tmath, since their operations are equal, i.e. Template:Tmath.

Properties

Notes

Template:Notelist

Citations

Template:Reflist

References

See also