Alge­braic struc­ture tree

WikiLast edit: 17 Jul 2016 3:39 UTC by Ryan Hendrickson

Some classes of algebraic structure are given special names based on the properties of their sets and operations. These terms grew organically over the history of modern mathematics, so the overall list of names is a bit arbitrary (and in a few cases, some authors will use slightly different assumptions about certain terms, such as whether a semiring needs to have identity elements). This list is intended to clarify the situation to someone who has some familiarity with what an algebraic structure is, but not a lot of experience with using these specific terms.

Tree is the wrong word; this should be more of an algebraic structure collection of disjoint directed acyclic graphs? But this is what other pages seem to have chosen to link to, so here we are!

One set, one binary operation

One set, two binary operations

For the below, we’ll use and to denote the two binary operations in question. It might help to think of as “like addition” and as “like multiplication”, but be careful—in most of these structures, properties of addition and multiplication like commutativity won’t be assumed!