Talk:Magma (algebra)

Closed

I wonder if the set is required to be closed under the operation—it's not clear from the article. For instance, would it be right to call Z a magma under the operation of taking the average of two integers, possibly yielding a non-integer?

Also, I think the opening sentence is misleading:

... a magma is a particularly simple kind of algebraic structure.

That's probably intended to mean that being a magma imposes little structure on a set, but one could also interpret it as: "If I can just show that my set here is a magma, why, then it must have a particularly simple algebraic structure!" Since highly complicated fields exist (and fields are magmas), that conclusion would be false.
—Herbee 16:24, 2004 Feb 27 (UTC)

By a binary operation on a set M, we mean a function from M×M to M. I think this is clear from the binary operation article. So a magma is necessarily closed. I agree that "simple" may be misleading - perhaps you can think of a better wording. (A field is not a magma; it's two interrelated magmas.) --Zundark 16:37, 27 Feb 2004 (UTC)

It's clear from you, Zundark; thanks for explaining. But it's not clear from the binary operation article, which points out that the term is sometimes used for any binary function, i.e. not necessarily from S × S to S.

A field not a magma? A field has a binary operation, so it fulfills the definition of a magma, doesn't it? Sure, it has another operation and more stuff, but that doesn't demagmafy it. Otherwise it would sound like "a bicicle doesn't have a wheel because it has two wheels!"

I wonder why they call it a "magma"? Next thing you know they'll rename a field to a "volcano", because of the magma in there...

—Herbee 22:11, 2004 Feb 27 (UTC)

I've actually made that basic rather than simple, which is certainly POV or worse.

Charles Matthews 16:53, 27 Feb 2004 (UTC)

I'd like to suggest that the adjective "closed" be dropped from the definition entirely. If we define a magma to be a set M equipped with a "binary operation on M ", then there's really no chance of confusion (the key is the preposition "on".) The more general notion of a function M × M to N, where the codomain is a second set N, shouldn't be called a binary operation on M. The older literature may have used this terminology, but it's relatively rare to encounter it in contemporary writing. Moreover, I think it's confusing: closure is important when dealing with subobjects, but for the object itself, the adjective raises more questions than it answers (e.g., "why wouldn't a function M × M to M be closed? what would it even mean not to be?", etc.)

Peterlittig (talk) 20:11, 30 April 2016 (UTC)

Groupoid vs magma

We have this tendency to use weird terminology, and here's a good example. Groupoids are called magmas by almost nobody, basically just Bourbaki and the Magma computer algebra system. The people who actually study them call them groupoids. (The fact that every external link the page gives calls them groupoids should be a hint.) It's unfortunate that groupoid has two meanings, but it's not like we don't have plenty of tools to handle ambiguity for links. I suggest we move this to "groupoid (blah)", for suitable value for "blah".-- Walt Pohl 01:12, 16 Mar 2004 (UTC)

The title uses disambiguation anyway, so I don't see any objection to moving it. But I don't know what "blah" should be - "algebra" doesn't seem specific enough, as the other type of groupoid can also be considered as an algebraic object. --Zundark 17:22, 17 Dec 2004 (UTC)

I'd only ever heard of 'magma' - and it hadn't occurred to me that groupoid was ambiguous. Sorry, the other groupoid meaning here would be a horrid addition, except as a redirect. 'Magma' is good enough for Jean-Pierre Serre (I learned it from his lectures on Lie algebras), which makes it good enough for me.

Charles Matthews 17:30, 17 Dec 2004 (UTC)

But nobody who actually studies them calls them magmas. They call them groupoids. Magma is a Bourbaki-ism (so it's not surprising that Serre uses it) that never caught on among the actual practitioners of groupoids.

Well, I quibble at that. He's fussy about nomenclature, and not uncritical of Bourbaki. I have never come across a specialist in these things; apart that is from User:Deflog who added all these bitty definitions. But that is enough to undermine the idea that no one who works in the area says magma? Category theorists don't count? Well, it's anyway kind of obvious that category theorists would hate having 'groupoid' here. Charles Matthews

As for what to use for disambiguation, I don't know. Maybe 'groupoid (category theory)' for the other definition, and 'groupoid (algebra)' for the magma definition? I agree that the other kind of groupoids can be considered an algebraic object, so it's not perfect. Maybe 'groupoid (binary operation)'? -- Walt Pohl 20:34, 17 Dec 2004 (UTC)

I thought this over, and I still think we have no right to dictate which definition of groupoid is the right one. The term is used in two different senses in mathematics, and we should reflect that. -- Walt Pohl 06:32, 25 Jan 2005 (UTC)

Two comments:

1. "Magma" is also to me much more common than "groupoid", for this meaning.
2. I'm already worried about the "specification" "(algebra)" and just created a redirect for "Magma (mathematics)". Generalizing the principle that no such "specification" at all is added if there is no ambiguity, it seems most logical to me to add the name of the most largest possible "category" where no ambiguity exists. Else it is virtually impossible to guess for a user, what to add if (s)he searches the definition of an unknown term (and maybe does not even know what the precise meaning is). Thus:

• Why is this called Magma (algebra) and not Magma (mathematics) ?
• I really would regret addition of (binary operation) or even less intuitive things to "Magma", and I regret wherever an unnecessarily restrictive qualifier is added. (This seems b.t.w. especially common (almost exclusive) in this area of abstract algebra.)
• Just think about a term of everyday life or of a domain you're not common with, and what you would do if you were searching for its definition, lacking a disambiguation page. MFH 20:52, 17 Mar 2005 (UTC)

tinyurl.com/uh3t here -- I learned "groupoid" in school, not "magma". Today on WikiPedia was my first sighting of "magma" with this meaning, as contrasted with melted basalt under the Earth's crust. I strongly feel a disambiguation page is needed. If somebody, as I did, searches for "groupoid", he should see *both* definitions, via diaambiguation page, rather than only the category-theory one which is there now. Move the category-theory one qualified name such as groupoid (category theory), and either have brief groupoid (algebra) that points to Magma, or just link to here directly from disambiguation page.

On the Mathematics Subject Classification (2000) the word magma apparently never appears. I believe that there is no doubt that MSC represents standard current mathematical terminology, hence I think that the page should be renamed Groupoid (algebra). Popopp 16:21, 13 February 2007 (UTC)

As already pointed out, the problem with using groupoid (algebra) is that the categorical meaning can also be defined as an algebraic structure. So groupoid (algebra) is still ambiguous. -- Fropuff 18:39, 13 February 2007 (UTC)

You are right; I was not familiar with the other notion of Groupoid, so I missed the main point that the other notion is algebraic, too. Anyway, I still do not see why the present notion should be called Magma (see also below). Since the main difference between the two notions is that one is a partial algebraic structure and the present one is a total algebraic structure, I believe that the right name for the present one could be Groupoid (total algebraic structure), while the former Groupoid page might be eventually (but not necessarily) moved to Groupoid (partial algebraic structure). One might also consider the number of operations, hence call this one Groupoid (one operation). In order to definitely check the status of the use of magma among mathematics, I have made a search within AMS mathscinet database; I searched the word magma anywhere in reviews of papers with Primary classification 20n02 (Sets with a single binary operation). The search has given two matches, while the search of the word groupoid has given 172 matches! Searching on Arxiv.org is not that easy, I looked at some results for magma-anywhere, and I have found one case in which it is used in the present sense, but I have found many other uses for it (for example, [1] uses it for still another kind of algebraic structure-four operations!). My conclusion is that Magma is much more unusual and even more confusing than Groupoid (whatever). In my opinion, the only thing to do is to choose the most appropriate whatever. As I mentioned, I suggest Groupoid (total algebraic structure). —The preceding unsigned comment was added by 82.84.201.129 (talk) 21:04, 13 February 2007 (UTC).

I have thougt a lot about the problem. One one side, it is just a matter of terminology, hence it is not very relevant, as far as the mathematical content of the entry is correct. On the other side, it might cause problems to someone wanting to study the notion both on wikipedia and on the mathematical literature, or simply just trying to learn and understand definitions. But what conviced me to talk again about the terminology is the consideration that wikipedia is not original research, and is not original research even in naming conventions. Hence we must adhere to well established conventions which, as I argued, in this case coincide with those used in the Mathematical Subject Classification (and to the use of mathematicians working in the field as well: as I mentioned mathscinet in Primary classification 20n02 gives 2 matches for magma and 172 matches for groupoid!). Because of the above reasons I propose to use Groupoid (Set with a single binary operation), which is the name used in the MSC Classification. Please make me know if you do not agree.--Popopp 08:15, 2 May 2007 (UTC)

I do agree. Please make the move ;-) --Tchoř (talk) 11:12, 18 July 2009 (UTC)

Well, this is very confusing for people ignorant of algebra (like me). Could we put a disambiguation in the template: Template:Group-like structures. Because the two books I am reading right now don't give inverses, neutral, etc... to groupoids. Tony (talk) 16:43, 17 September 2010 (UTC)

Whatever happened to moving this page? It sounds like it would be quite appropriate. I'd do it myself, but the most recent suggestion ("Groupoid (Set with a single binary operation)") sounds fairly awkward. However, I don't know ewnough about the topic to suggest a better alternative. I'll try finishing the article and seeing if I can think of something better by then. If someone smarter than me could do it instead or at least offer an alternative, it'd be appreciated. 71.199.190.190 (talk) 00:32, 3 September 2011 (UTC)

The current naming of Wikipedia is the best in practice. There are two very different kinds of objects: (1) small categories where every morphism is invertible and (2) sets with a binary operation. For (1) there is only one well-established name, 'groupoid', and for (2) there are two well-established names, 'magma' and 'groupoid'. So it is just better to avoid collision, and use 'magma' for (2) --- and of course, mention the alternate naming for it. --- 2011-11-27

Division vs cancelation

Would it be better to say that quasigroups allow cancelation, rather than division? Division implies that there is an inverse for each element.

(a*b)*c = (a*c)*(b*c)

In a completely unrealated subject I found that when I expressed a certian process as a binary operater it followed the identity (a*b)*c = (a*c)*(b*c). Is there any significance to this identity? --SurrealWarrior 19:50, 22 January 2006 (UTC)

It means that the operation is right distributive over itself. Any binary operation that is both idempotent and medial will have this property. For example, * could be the operation of taking the midpoint of two points in a real vector space. I don't know if this answers your question. --Zundark 20:51, 22 January 2006 (UTC)

Thank you! The process I was talking about is quite similar to taking the midpoint of two points in a real vector space, it is mixing two ideas to produce a third, for instance, mixing sports and player to produce a sports player.--SurrealWarrior 21:02, 22 January 2006 (UTC)

That sounds like you're looking for quandles. RandomP 19:04, 29 April 2006 (UTC)

Monad

According to [[2]] a magma is synonymous for monad?

In dutch 'monade' is our name for that.

What do you think?

Evilbu 17:38, 16 February 2006 (UTC)

I think maybe the term magma isn't so standard. Some people call magmas groupoids (a usage which I don't condone, since groupoids should be categories with all invertible morphisms). Similarly, I guess some people call magmas monads, like the link you show. I don't like that usage either, because a monad should be monoid object in a monoidal category. Groupoids, monoids, and monads have identities and associativity, while magmas do not, so the different definitions are not very related. Of course, you can use any name you want, but using the name "groupoid" or "monad" for magma strikes me as unnecessarily ambiguous. -lethe ^{talk +} 00:34, 17 February 2006 (UTC)

Free magma/binary tree automorphisms endomorphisms

It seems to me that a free magma is necessarily endowed with any operation that can be performed on a (rooted, complete) binary tree that leaves the binary tree rooted and complete. Right? In essence, magmas have well-defined, natural automorphisms endomorphisms. Yet, the discussion here, and corresponding discussion in the cat theory pages are notable in being silent on this matter. Is this ommission due to an incompleteness of the article, or is this due to some unwillingness or "incorrectness" of discussing this topic? Maybe this is an expression of "forgetfullness" in the cat theory sense? In which case, is there a category of "free magmas with their natural automorphisms"? linas 20:23, 11 February 2007 (UTC)

It's true that any magma has an automorphism group and that the elements of a free magma $\mathbf {F} (X)$ on a generating set $X$ can be identified with the rooted binary trees labeled with a member of $X$ at each leaf (with the assignment of a «left» and «right» child node for each nonleaf node). I don't recall ever seeing a detailed account of automorphisms of free magmas and a short search just now returned nothing of note. Off the top of my head I'm not seeing any other automorphisms than those induced by permuting the elements of $X$, but there may well be other examples. It's worth noting that an automorphism of $\mathbf {F} (X)$ permutes the set of those labeled trees, not the nodes of the trees themselves. If you're thinking that automorphisms of the free magmas are «natural» in the sense that they induce automorphisms of all other magmas that is incorrect. There is an automorphism of $\mathbf {F} (\{x,y\})$ which swaps $x$ and $y$, yet the abelian group $\mathbb {Z} _{2}\oplus \mathbb {Z} _{3}$ (viewed as a magma) is a quotient of $\mathbf {F} (\{x,y\})$ generated by $\{(1,0),(0,1)\}$ which does not have an automorphism swapping these two generators. That is, automorphisms of free magmas do not descend to automorphisms of all other magmas. The concept of «forgetfulness» in category theory doesn't apply here, since that is more about dropping structure as when we forget about the binary operation on a magma and only look at its underlying set. There is a category whose objects are the free magmas and whose morphisms are all the free magma automorphisms. It is a subcategory of the usual category whose objects are magmas and whose morphisms are magma homomorphisms. caterpillar_tree (talk) 23:17, 20 April 2020 (UTC)

The original question was sloppy. The "natural maps" are the ones generated by the left-subtree map $L:(ab)\mapsto a$, the right subtree map $R:(ab)\mapsto b$, and the hyperbolic rotation $\theta :((ab)c)\mapsto (a(bc))$. Note that $\theta$ is invertible. Obviously, these do not commute with the magma product itself; they are endomorphisms only in the sense that given an element of $\mathbf {F} (X)$, they return another element of $\mathbf {F} (X)$. They do preserve morphisms, in the sense that if $f:M\to N$ is a morphism of magmas, these three maps all commute with $f$ in that $f\circ L=L\circ f$ and $f\circ \theta =\theta \circ f$ and etc. Because they commute, the universal property is conserved. Because the universal property is preserved, these are "natural". These are not the only ones, they generated an infinite set: for example, you can make some arbitrary number of left-right moves down the tree, and then apply $\theta$ at that location, but keep the rest of the tree above that point unchanged. So there's an infinite number of these maps that are natural. The "rotation" is "hyperbolic" because binary trees embed into the modular group (which describes the hyperbolic rotations of the hyperbolic plane). And once you say these magic words, you've opened the flood-gates to all of riemann surfaces and number theory and what-not. So lets keep those flood-gates closed. Besides these, there are also also the tree-editing maps: e.g. take a bunch of left-right moves down the tree, take whatever you find there, and replace it with a different tree. So these are a raft of "self-evident" operations; seems like they belong in the article, right? 67.198.37.16 (talk) 01:21, 14 October 2020 (UTC)

I'm not sure I'm following you here. If $f\colon \mathbf {M} \to \mathbf {N}$ is a magma homomorphism then $f\colon M\to N$ is a function which eats a single member of $M$ at a time. You claim that $f\circ L=L\circ f$ but as far as I can see $L\colon F(X)\to F(X)$ is a function taking elements of the universe of the free magma (so in other words those rooted binary trees whose leaves are labeled with members of $X$) to other elements of the same set, which makes it looks like these two functions $f$ and $L$ cannot be composed with each other in any sensible way. Do you care to elaborate on what you meant by this? caterpillar_tree (talk) 20:35, 15 December 2021 (UTC)

Division ?

It would be helpful to provide an information about what division is. Following the given link take to a page where the best one can find is the section on abstract algebra, where division is "defined" as multiplication with the inverse. Here it seems you talk about something else. What can it be? The best I can imagine is the possibility to solve uniquely(?) the equation a x=b for any a,b. Must this solution be unique? Or is it only the surjectivity of left-multiplication, for all elements? I think several definitions are possible, but even knowing semigroups, magmas, etc quite well, I believe that this notion is far from being standard and should be explained.— MFH:Talk 21:46, 12 February 2007 (UTC)

Because magma is a relatively simple, intuitive structure, the notions of Galois connection, free functor could be at least mentioned in the Free magma section

Would it be worth to mention the (rather hard) concepts of Galois connection and Adjoint functor using the (intuitively simple) example of magma? Now, these concepts are demonstrated on the example of free group — but I think a free group is a rather hard concept, a free magma is much more familiar and didactic (overall usage and applications in computer science). I thought of the following modifications on section Free magma:

1. A clear distinction between algebraic structure (typeset with fraktur) and set (typeset with Roman), especially carefully distinguishing structure vs its universe (otherwise, the very "flavor" of Galois connection and adjoint functor cannot be rendered well didactically. Even if we do not mention forgetful functor explicitly, but at least the notation could refer to its tacit usage implicitly.
2. Adding at least a summarizing mentioning of these concepts (marked below with red).

Thus, the section Free magma would look like this:

A free magma ${\mathfrak {M}}_{X}$ on a set X is the "most general possible" magma generated by the set X (that is there are no relations or axioms imposed on the generators; see free object). It can be described, in terms familiar in computer science, as the magma of binary trees with leaves labeled by elements of X. The operation is that of joining trees at the root. It therefore has a foundational role in syntax.

A free magma has the universal property such that, if $f:X\to N$ is a function from the set X to the universe N of any magma ${\mathfrak {N}}$, then there is a unique extension of $f$ to a morphism of magmas $f^{\prime }$

$f^{\prime }:{\mathfrak {M}}_{X}\to {\mathfrak {N}}.$

This property establishes a special relatedness among two sets and two algebraic structures, where N is gotten from ${\mathfrak {N}}$ by “forgetting” the structure imposed by the operation (forgetful functor), and ${\mathfrak {M}}_{X}$ is gotten from X by regarding it as generators of a [free] algebraic structure (free functor). This special interlinkedness (somewhat resembling to Galois connection) can be generalized to the notion of adjoint functor.

See also: free semigroup, free group, Hall set

-- 23:14, 27 February 2008‎ User:Physis

The "somewhat resembling" is problematic. Anything adjoint to something forgetful "somewhat resembles" anything that's adjoint to something else. 67.198.37.16 (talk) 01:41, 14 October 2020 (UTC)

Algebraic structure of NAND and NOR functions?

Is there a specific name for the algebraic structure of the boolean NAND(sheffer) and Logical_NOR(peirce) functions? They satisfy no other "common" algebraic axioms except for being closed, unital and commutative. —Preceding unsigned comment added by 129.13.186.1 (talk) 21:58, 6 August 2008 (UTC)

Are there associative, divisible magmas without identity elements and/or non-associative magmas with identity elements but not inverse elements?

Looking at the "Types of magmas" section of this article, in the Hexagonal-shaped image of two paths of successive additional membership creteria from a magma to a group (divisibility-identity-associativity and associativity-identity-inversibility, inversibility being equivilent to divisibility where there is identity and associativity, and even without associativilty if different left- and right inverses are allowed in the definition of inversibility), I have wondered if a path of proper subsets could be formed either with identity first or identity last (or both). Can a magma have an identity element without being either associative or even left- and right-inversible (divisible)? It would surprise me if a magma could have an indentity element without being associative as long as was divisible and without being divisible as long as it was associative but not if the magma was neither associative nor divisible. And can a magma be associative and divisible (an associative quasigroup or a divisible semigroup, or equivilently both a quasigroup and a semigroup) without also having an identity element and thus being a group? Are there 2 paths from a magma to a group forming a hexagon of subsets or 3! = 6 paths forming a cube of subsets? Finally, are there special names for magmas with identity elements (if they aren't all loops and/or monoids including groups) or quasigroups that are also semigroups (if they aren't all groups)? Thanks. Kevin Lamoreau (talk) 19:40, 6 September 2008 (UTC)

"Can a magma have an identity element without being either associative or even left- and right-inversible (divisible)?" Yes: the octonions under mutliplication have an identity element (1), but are neither commutative nor associative. On the other hand, the octonions do have multiplicative inverses. Sullivan.t.j (talk) 20:50, 6 September 2008 (UTC)

I could have phrased that question better. I knew about monoids like the octonions, put I was wondering, in that question if a magma could satisfy three conditions: (1) existence of an identity element; (2) lack of associtativity; and (3) lack of divisibility (and thus lack of inversability). My second question was if a magma could satisfy the following three conditions: (1) absence of an identity element; (2) associativity; and (3) divisibility (the opposite of the first case). My final question was what names there were if there were any for those sets (or rather the ones whose members could satisfy all of those criteria like associativity, identity, divisibility and inversability but only had to satisfy identity in the first case and associativity and divisibility in the second case. I wasn't concerned with whether or not a magma was commutative here. Thanks for your attempt to answer part of my question though. Kevin Lamoreau (talk) 00:11, 7 September 2008 (UTC)

Your first set of conditions is easily satisfied - fill in a 5x5 multiplication table at random, add an identity element, and you are very likely to have an example. The 3-element magma I posted here appears to be an example too, but all its elements have an inverse (which you seem to think is ruled out by the lack of divisibility - maybe I've misunderstood what you meant). Your second of set of conditions is impossible to satisfy, unless you count the empty semigroup.

I don't think there's a special term for a magma with an identity element - just "groupoid with an identity element" would be the usual expression. A magma with associativity and divisibility is called a group (unless it's empty). --Zundark (talk) 08:09, 7 September 2008 (UTC)

Is or is not a magma a groupoid?

In abstract algebra, a magma (or groupoid; not to be confused with groupoids in category theory) is a basic kind of algebraic structure.

---

http://en.wiki.x.io/wiki/Magma_(algebra)#Types_of_magmas

---

Is or is not a magma a groupoid? In the section "Types of magmas", groupoid completely reverses the definition of a magma. —Preceding unsigned comment added by Fantadox (talk • contribs) 13:01, 30 November 2009 (UTC)

If you're referring to the "Group-like structures" table, that table is using the other (category-theoretic) meaning of "groupoid". I'm inclined to remove the table on the grounds that it's needlessly confusing and doesn't really add anything to the article anyway. --Zundark (talk) 13:48, 30 November 2009 (UTC)

"Inversibility"?

Is "inversibility" a word? Is it the one frequently used in this topic? What is wrong with "invertibility" — does it mean something else? Shreevatsa (talk) 05:27, 30 May 2010 (UTC)

Note: I have changed the article to say "invertibility" for now, on the assumption that the old word was just a mistake (this article is the only one on Wikipedia that contained the word). If I'm wrong, I'd like to know. Shreevatsa (talk) 05:01, 31 May 2010 (UTC)

a simple solution to the terminology "groupoid" ambiguity is the name 'nonassociative semigroup' or even shorter 'pre-semigroup', where the prefix 'pre-' is an abbreviation for 'nonassociative' Doc at ut (talk) 17:42, 14 March 2011 (UTC)doc at ut

'Semicategory'?

Is 'semicategory' the standard term for a set with a partial associative binary operation? As the name for a set endowed with a total associative binary operation is called a 'semigroup', and when we remove the axiom of identity from the definition of a monoid, we do not call it a 'semimonoid'. Thus, calling its non-closed cousin a 'semicategory' is inconsistent nomenclature. I propose we use the term 'semigroupoid' here and mention any alternate names on the target page. Further supporting this suggestion is, a) the 'semicategory' link actually redirects to the 'semigroupoid' page anyway; b) on a lesser note, 'semigroupoid' is the preferred term for the Haskell implementation of this algebraic structure. MaxwellEdisonPhD (talk) 12:50, 14 September 2013 (UTC)

Probably not or at least has multiple defs. See Talk:Semigroupoid. JMP EAX (talk) 11:42, 26 August 2014 (UTC)

Reason

The article says, "Magmas are not often studied as such". The lack of interesting theorems might be the reason. — Preceding unsigned comment added by 64.38.197.205 (talk) 11:02, 25 July 2014 (UTC)

Bourbaki

According to [3] Bourbaki called a magma what today is called a semigroup, i.e. having associativity. The source could be wrong though, but it was written by two French sounding names... JMP EAX (talk) 12:15, 26 August 2014 (UTC)

According to [4] "magma" with the meaning given in this article was used [and probably introduced] by Serre. JMP EAX (talk) 12:32, 26 August 2014 (UTC)

Why not go straight to the source? Bourbaki's Algebra I defines a "magma" on page 1 [5]. It is not required to be associative. On page 4 is the definition of an "associative magma". Deltahedron (talk) 16:41, 26 August 2014 (UTC) Additional. It happens that I found a copy of the 1951 fascicule of Algebre I. This starts by defining a partial binary operation ("loi de composition interne") which need not satisfy associativity. As far as I can tell, the word magma does not appear in this version. According to Zbl 0261.00001 the term "magma" appears in the 1971 edition. Kiechle [6] states that Bourbaki first used the term magma in that edition. Incidentally, the 1951 edition defines as "monoide" what we would now call a semigroup, that is, an associative everywhere defined operation. This may be what was intended by Gondran & Minoux. Deltahedron (talk) 18:53, 26 August 2014 (UTC)

Zeropotent?

The article has a definition of a zeropotent magma that is not equivalent to nilpotent. I cannot find this term used at all in a Google search. Should we delete this definition? —Quondum 21:32, 11 January 2015 (UTC)

A simple GScholar search shows 46 results. This paper is the first hit. It seems a verifiable term. --Mark viking (talk) 22:44, 11 January 2015 (UTC)

I was searching for "magma", where there were no results. I'll ignore references that only define zeropotent in the context of a more restricted structure (e.g. semigroups), such as the article you linked to. I see that there are several references that use the equivalent term groupoid, though. From [7], we get:

"By a groupoid we mean a non-empty set with one binary operation. If G is a groupoid then an element o£ G is said to be absorbing if xo = o = ox for every x ∈ G. A groupoid G with an absorbing element o is said to be zeropotent if xx = o for every x ∈ G and G is said to be a Z-semigroup if xy = o for all x,y ∈ G."

So basically, a zeropotent magma is one in which every element squares to the two-sided absorbing element, which must exist. The identities in the article seem to be a poor way to capture that, and indeed seem to me to be nonequivalent (they do not imply a right zero). I'll make changes to make them equivalent. —Quondum 23:32, 11 January 2015 (UTC)

Emptyness

Hi !

I wonder if the definition of a magma requires the set to be non-empty. If so, i think it would be relevent to mention it in the article...

Best regards ! — Preceding unsigned comment added by 109.23.11.115 (talk) 18:54, 8 March 2015 (UTC)

This definition in this article does not require the set to be nonempty. Some authors may exclude empty objects from consideration in their definitions, but I suspect that has more to do with not being bothered to think about it. I don't see any change needed in the article in this regard. —Quondum 21:02, 8 March 2015 (UTC)

Group doesn't possess an Identity element?

In the table labeled "Group-like structures", it has groups and the empty domain under the same category, and states that neither groups nor the empty domain require an identity element. Not a big deal, but does seem like an error. The empty domain should be given it's own row perhaps. — Preceding unsigned comment added by 2600:1700:C821:39D0:FD8C:2365:6D39:F3B2 (talk) 20:31, 23 June 2022 (UTC)

It was added in this edit Feb 22, 2022 [8], changing from Inverse semigroup, note Inverse semigroups do not belong in the table; what fits, if anything, are possibly-empty groups. I don't know of a better wording, however.. I'll comment out the confusing row for now. Tom Ruen (talk) 21:46, 23 June 2022 (UTC)

Homogeneous element

What is the definition of homogeneous element in free magma? 213.6.145.233 (talk) 09:19, 26 September 2022 (UTC)