Lesson plan
Semigroup
In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. In mathematical analysis, the term also appears in the theory of one-parameter operator semigroups: see C0-semigroup. The binary operation of a semigroup is most often denoted multiplicatively: x\cdot y , or simply xy , denotes the result of applying the semigroup operation to the ordered pair (x,y) . Associativity is formally expressed as that (x\cdot y)\cdot z=x\cdot (y\cdot z) for all x , y and z in the semigroup. An example of a semigroup is that formed by string concatenation, which glues together strings. For example, the concatenation of the strings "spot " and "run" is the string "spot " • "run" = "spot run". Associativity means that : "See " • ("spot " • "run") = "See " • "spot run" = "See spot run" = "See spot " • "run" = ("See " • "spot ") • "run". The formal study of semigroups began in the early 20th century. Early results include a Cayley theorem for semigroups realizing any semigroup as a transformation semigroup, in which arbitrary functions replace the role of bijections in group theory. A deep result in the classification of finite semigroups is Krohn–Rhodes theory, analogous to the Jordan–Hölder decomposition for finite groups.…
Article summary
In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. In mathematical analysis, the term also appears in the theory of one-parameter operator semigroups: see C0-semigroup. The binary operation of a semigroup is most often denoted multiplicatively: x\cdot y , or simply xy , denotes the result of applying the semigroup operation to the ordered pair (x,y) . Associativity is formally expressed as that (x\cdot y)\cdot z=x\cdot (y\cdot z) for all x , y and z in the semigroup. An example of a semigroup is that formed by string concatenation, which glues together strings. For example, the concatenation of the strings "spot " and "run" is the string "spot " • "run" = "spot run". Associativity means that : "See " • ("spot " • "run") = "See " • "spot run" = "See spot run" = "See spot " • "run" = ("See " • "spot ") • "run". The formal study of semigroups began in the early 20th century. Early results include a Cayley theorem for semigroups realizing any semigroup as a transformation semigroup, in which arbitrary functions replace the role of bijections in group theory. A deep result in the classification of finite semigroups is Krohn–Rhodes theory, analogous to the Jordan–Hölder decomposition for finite groups.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.