Art of Problem Solving

Magma: Difference between revisions

No edit summary
 
Charking (talk | contribs)
m Added Categories
 
Line 1: Line 1:
A '''magma''' (or a '''groupoid''') is a [[set]] <math> \displaystyle S </math>, together with a function <math> \bot : S \times S \mapsto S </math>, i.e., a set with a [[binary operation]] <math> \bot </math>.  A set <math> \displaystyle S </math> with an operation <math> \bot </math> that maps some proper [[subset]] of <math> S \times S </math> into <math> \displaystyle S </math> may be described as a magma with an operation ''not everywhere defined'' on <math> \displaystyle S </math>.
A '''magma''' (or a '''groupoid''') is a [[set]] <math>S </math>, together with a function <math> \bot : S \times S \mapsto S </math>, i.e., a set with a [[binary operation]] <math> \bot </math>.  A set <math>S </math> with an operation <math> \bot </math> that maps some proper [[subset]] of <math> S \times S </math> into <math>S </math> may be described as a magma with an operation ''not everywhere defined'' on <math>S </math>.


Magmas so general that usually one studies special cases of magmas.  For example, [[monoid]]s are [[associative]] magmas with an identity.
Magmas so general that usually one studies special cases of magmas.  For example, [[monoid]]s are [[associative]] magmas with an identity.
Line 10: Line 10:


{{stub}}
{{stub}}
[[Category:Mathematics]]

Latest revision as of 17:34, 28 September 2024

A magma (or a groupoid) is a set $S$, together with a function $\bot : S \times S \mapsto S$, i.e., a set with a binary operation $\bot$. A set $S$ with an operation $\bot$ that maps some proper subset of $S \times S$ into $S$ may be described as a magma with an operation not everywhere defined on $S$.

Magmas so general that usually one studies special cases of magmas. For example, monoids are associative magmas with an identity.

Resources


This article is a stub. Help us out by expanding it.