Basic Algebra: Groups, Rings and Fields

Front Cover
Springer Science & Business Media, Dec 1, 2004 - Mathematics - 465 pages

Basic Algebra is the first volume of a new and revised edition of P.M. Cohn's classic three-volume text Algebra which is widely regarded as one of the most outstanding introductory algebra textbooks. For this edition, the text has been reworked and updated into two self-contained, companion volumes, covering advanced topics in algebra for second- and third-year undergraduate and postgraduate research students.

In this first volume, the author covers the important results of algebra; the companion volume, Further Algebra and Applications, brings more advanced topics and focuses on the applications. Readers should have some knowledge of linear algebra and have met groups and fields before, although all the essential facts and definitions are recalled.

The coverage is comprehensive and includes topics such as:

- Groups

- lattices and categories

- rings, modules and algebras

- fields

The author gives a clear account, supported by worked examples, with full proofs. There are numerous exercises with occasional hints, and some historical remarks.

From inside the book

Contents

III
3
V
10
VI
17
VII
27
IX
34
X
36
XI
39
XII
44
LI
240
LII
251
LIV
254
LV
258
LVI
261
LVII
270
LVIII
274
LIX
277

XIII
48
XIV
53
XVI
62
XVII
67
XVIII
72
XIX
81
XXI
86
XXII
93
XXIII
98
XXIV
103
XXV
107
XXVI
112
XXVII
119
XXVIII
127
XXIX
133
XXXI
139
XXXII
143
XXXIII
148
XXXIV
155
XXXV
159
XXXVI
167
XXXVII
170
XXXVIII
175
XXXIX
181
XL
191
XLII
197
XLIII
202
XLIV
205
XLV
208
XLVI
213
XLVII
219
XLVIII
225
XLIX
229
L
234
LX
281
LXI
293
LXII
300
LXIII
303
LXIV
309
LXVI
314
LXVII
324
LXVIII
333
LXIX
338
LXX
349
LXXI
351
LXXII
356
LXXIII
363
LXXIV
364
LXXV
373
LXXVI
378
LXXVII
382
LXXVIII
388
LXXIX
393
LXXX
399
LXXXII
404
LXXXIII
407
LXXXIV
411
LXXXV
416
LXXXVI
420
LXXXVII
429
LXXXVIII
433
LXXXIX
439
XC
443
XCI
451
XCII
455
XCIII
459
XCIV
461
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 2 - The vertices in the graph represent elements of the set; an edge from vertex x to vertex y means "x is related to y." A relation is called an equivalence relation if it is reflexive, transitive, and symmetric. Clearly a relation has these properties iff its digraph representation does. Write a function to determine if a graph G, implemented as an adjacency matrix, represents an equivalence relation. 2. A relation is called a partial ordering if it is reflexive, transitive, and antisymmetric. Using...

References to this book

Bibliographic information