Definition 1.1. The ordered pair (S,*) is a semi-group iff S is a set and * is an associative binary operation (multiplication) on S. Notation. A semigroup (S,*) will ordinarily be referred to by the set S, with the multiplication understood. In other words, if (a,b)e SX , then *[(a,b)] = a*b = ab. The proof of the following proposition is found on p. 4 of Introduction to Semigroups, by Mario Petrich. Proposition 1.2. Every semigroup S satisfies the general associative law.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc504365 |
| Date | 12 1900 |
| Creators | Winton, Richard Alan |
| Contributors | Lau, Yiu-Wa August, Dawson, David Fleming |
| Publisher | North Texas State University |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | i, 83 leaves, Text |
| Rights | Public, Winton, Richard Alan, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved. |
Page generated in 0.003 seconds