• Nebyly nalezeny žádné výsledky

Foundations of the Theory of Groupoids and Groups

N/A
N/A
Protected

Academic year: 2022

Podíl "Foundations of the Theory of Groupoids and Groups"

Copied!
4
0
0

Načítání.... (zobrazit plný text nyní)

Fulltext

(1)

Foundations of the Theory of Groupoids and Groups

20. Cosets of subgroups

In: Otakar Borůvka (author): Foundations of the Theory of Groupoids and Groups. (English). Berlin:

VEB Deutscher Verlag der Wissenschaften, 1974. pp. 155--157.

Persistent URL:http://dml.cz/dmlcz/401559

Terms of use:

© VEB Deutscher Verlag der Wissenschaften, Berlin

Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain theseTerms of use.

This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the projectDML-CZ: The Czech Digital Mathematics Libraryhttp://project.dml.cz

(2)

20. Cosets of subgroups 155

20. Cosets of subgroups

20.1. Definition

Consider a group ® and let 2C be a subgroup of &. Let, moreover, p £ @J be an arbitrary element of ©.

The subset p% of @, i.e., the set of the products of the elements p and each element of 21, is called the left coset or left class of p with regard to 2t or (if we know it is a question of 21), briefly, the left coset or left class of p.

Similarly, the subset %p, i.e., the set of the products of each element of % and the element p is called the right coset or right class of p with regard to %, briefly the right coset or right class of p.

Note that the field A of the subgroup 21 is simultaneously both the left and the right coset of the element 1 with regard to 21.

We shall first describe, in a few simple theorems, the properties of the left cosets; as the properties of the right cosets are analogous, we shall not deal with them here and leave it to the reader to consider them himself.

20.2. Properties of the left (right) cosets

Let 21 cz @ be a subgroup and p, q arbitrary elements of ©. Then the following theorems are true:

1. The left coset p% contains the element p.

Indeed, since 21 is a subgroup, there holds 1 € 21 and we have p = pi £ p%.

2. If and only if p £ 21, then p% = A.

To prove that the above statement applies, let us first assume p £ SBC. Since 2t is a subgroup, the product of p and any element of 21 is again included in 21, hence p% cz A. Moreover, p~x £ 21 and, for any element a 6 21, there is p~xa € 2C so that p(p~la) 6 p%; but p(p~%a) = (pp~x)a = l a = a; hence a £ p% and we have A cz p%. Consequently, p% = A. Let us now suppose that for some element p £ & there holds p% = A. Then the product pa, for every a £ 2C, is contained in 21 and therefore, in particular (for a = 1), p is an element of 21.

Theorem 2 may be generalized in terms of:

3. If and only if p~xq £ % then p% = q%.

In fact, if p~xq £ 21, then in accordance with theorem 2, p-xq% = A and, con- sequently, q% = (pp~%)q% = p(p~xqW = P(V"\21) == |>2t. Conversely, from q% = p%

there follows (p~xq)% = A and so p~%q £ 2t, which we were to prove.

(3)

156 III. Groups

4. The left cosets p%, q% are either disjoint or identical.

This remarkable property of the left cosets may be verified in the following way: If both left cosets p% and q% have a common element x and so x € p%, x 6 q%, then prho £ % q~xx £ %. Hence, in accordance with theorem 3, we have p% = x% = q% and both left cosets p% and gSl are identical.

5. The left cosets p%, q% are equivalent sets.

Our object now is to show that there exists a simple mapping of the set p%

onto q%. Each element of p% (q%) is the product pa (qa) of the element p (q) and a convenient element a £ St. Since pa = pb (qa = qb) yields a = b, the element a is uniquely determined. Conversely, if a £ St, then pa £ p% (qa £ gSt). We observe that I ^ J is a simple mapping of the set p% onto % and, similarly, j J is a sim-

\a I ia\ (m\ \%a!

pie mapping of the subgroup SI onto q%. Hence f J IF ) is a simple mapping of the set p% onto q%, which was to be proved.

Let us now proceed to the case when (U contains, besides St, a further sub- group, 58.

6. / / the left cosets p$t, $93 are incident, then their intersection p% n qS$ is the left coset of each of its own elements with regard to the subgroup St n 93.

In fact, if the cosets p%, $93 have a common element c £ &, then by theorem 1 and theorem 2, there holds: pSt = c%, $93 -== c93 whence p% n qSd = c% n c93.

Every element x £ cSt n c93 is the product of c and a convenient element a £ 31 and, at the same time, the product of c and a convenient element b £ 93 and so x = ca = cb. Consequently, a = b £ St n S3 and, therefore, a; £ c(% n 93). Thus we have p% n g93 cz e(St n 93). Moreover, every element a; £ c(3t n 93) is the product of the element c and an element a £ St n 93, so that ar = ca £ cSt n c93. Conse- quently, c(3t n §8) cz p% n g93 and we have the required result.

7. If 31 cz 93, £Aew /rom £Ae incidence of the left cosets p%, g93 there follows p% cz q^8.

Indeed, by 1.10.3, St cz 93 yields St n 93 = St; in accordance with theorems 6 and 4, there applies pU n f93 = pSt and, consequently, j?3C cz g93 (1.10.3).

As we have already mentioned, the properties of the right cosets with regard to 81 are analogous. Between the left and the right cosets with regard to St there holds the following relation:

8. The left coset p% is mapped, under the inversion n of the group (B, onto the right coset %p-x: n(p%) = Stfr1. Simultaneously there holds the analogous formula n(%p) -= p-m.

From x £ p% there follows x = pa (a £ 31) and x~l = a^pr1 (a~x £ SI) yields x~x £ %p~x. Hence n(p%) cz Mpr1. Moreover, every point y = a'p~x cz %p~x (af £ %)

(4)

21. Decompositions generated by subgroups 157 is t h e w-image of t h e element paf~x £ p% (a'-1 £ SC). T h u s we have %p-% a n(p%) and, consequently, n(p%) = S l y1, which completes t h e proof.

R e m a r k . B o t h p% a n d %p~x are referred t o as mutually inverse cosets. If one of t h e m is denoted e.g. b y a, t h e n t h e other is or1.

9. The left coset p% and the right coset %q are equivalent sets.

W e are t o prove t h a t there exists a simple mapping of t h e set p% onto %q. I n accordance with theorem 8 a n d 7.3.4, t h e sets p% a n d %p~x are equivalent; b y t h e theorem analogous t o theorem 5 a n d valid for t h e right cosets, St^r1 and %q have t h e same property. Consequently, b y 6.10.7, t h e assertion is correct.

20.3. Exercises

1. If © is Abelian, then the left coset of an element p € © with regard to a subgroup % a © is, at the same time, the right coset and so p% = %p.

2. Let %,*?& denote arbitrary subgroups and G a complex in ©. Prove that there holds:

a) the sum of all left (right) cosets with regard to % which are incident with G coincides with the complex G% (%G); b) the sum %$p% of all left cosets with regard to % which|are incident with some right coset %$p (p e ©) coincides with the sum of all right cosets with regard to 33 which are incident with the left coset p%.

3. Let p € © be an arbitrary element and © the (p)-group associated with © (19.7.11). Next, let % be an arbitrary subgroup of ©. Prove that: a) the left (right) coset p% (%p) of p with regard to 31 is the field of a subgroup 9fy c : © (%r cz @) of ©; b) the left (right) coset x o %i (%r o x) coincides, for each element x of ©, with the left (right) coset x% (%x).

21. Decompositions generated by subgroups

A most remarkable p r o p e r t y of groups is t h a t every subgroup of an arbitrary group determines certain decompositions on t h e latter.

21.1. Left and right decompositions

Consider t h e system of all t h e subsets of t h e group © g i v e n b y t h e left cosets with regard t o 91. B y 20.2.1, every element p 6 ® is included in t h e left coset p%

which is, of course, a n element of t h e considered system. B y 20.2.4, every two

Odkazy

Související dokumenty

We observe that, with regard to the upper (lower) partial ordering of a lattice, each pair of its elements has both the least upper and the greatest lower bounds; the least

The property that to each element a of a group there exists an inverse a- 1 is char- acteristic of groups and distinguishes them among the associative groupoids with a unit..

The notion of the sum of two sets can easily be extended to the sum of systems of sets: by the sum or union of anys ystem of sets, A, we mean the set of all the points belonging

If the left decomposition of ® generated by 9t is a covering of the left decompo- sition generated by 33 then, in particular, the field A of ft is the sum of certain left cosets

A nonempty system of subgroups of @ any two elements of which are interchangeable and which is closed with respect to the intersections and the products of any two sub- groups forms

The series of subgroups, (21) and (»), are called: a) complementary or inter- changeable, b) chain-equivalent or co-basally chain-equivalent, c) semi-joint or loosely joint,

The theorems (24.3) on generating decompositions in groups, together with the study of generating decompositions in groupoids and of decompositions of groups generated by

According to the definition of a factoroid, the field of © is a generating decomposition of & and is therefore generated by a suitable subgroup 9t invariant in @5 (24.3.2)..