请输入您要查询的百科知识:

 

词条 Magma (algebra)
释义

  1. History and terminology

  2. Definition

  3. Morphism of magmas

  4. Notation and combinatorics

  5. Free magma

  6. Types of magma

  7. Classification by properties

  8. Generalizations

  9. See also

  10. References

  11. Further reading

{{other uses|Magma (disambiguation)}}

In abstract algebra, a magma (or groupoid; not to be confused with groupoids in category theory) is a basic kind of algebraic structure. Specifically, a magma consists of a set equipped with a single binary operation. The binary operation must be closed by definition but no other properties are imposed.

{{Algebraic structures |Group}}

History and terminology

The term groupoid was introduced in 1927 by Heinrich Brandt describing his Brandt groupoid (translated from the German Gruppoid). The term was then appropriated by B. A. Hausmann and Øystein Ore (1937)[1] in the sense (of a set with a binary operation) used in this article. In a couple of reviews of subsequent papers in Zentralblatt, Brandt strongly disagreed with this overloading of terminology. The Brandt groupoid is a groupoid in the sense used in category theory, but not in the sense used by Hausmann and Ore. Nevertheless, influential books in semigroup theory, including Clifford and Preston (1961) and Howie (1995) use groupoid in the sense of Hausmann and Ore. Hollings (2014) writes that the term groupoid is "perhaps most often used in modern mathematics" in the sense given to it in category theory.[2]

According to Bergman and Hausknecht (1996): "There is no generally accepted word for a set with a not necessarily associative binary operation. The word groupoid is used by many universal algebraists, but workers in category theory and related areas object strongly to this usage because they use the same word to mean 'category in which all morphisms are invertible'. The term magma was used by Serre [Lie Algebras and Lie Groups, 1965]."[3] It also appears in Bourbaki's Éléments de mathématique, Algèbre, chapitres 1 à 3, 1970.[4]

Definition

A magma is a set M matched with an operation, •, that sends any two elements {{nowrap|a, bM}} to another element, {{nowrap|ab}}. The symbol, •, is a general placeholder for a properly defined operation. To qualify as a magma, the set and operation {{nowrap|(M, •)}} must satisfy the following requirement (known as the magma or closure axiom):

For all a, b in M, the result of the operation {{nowrap|ab}} is also in M.

And in mathematical notation:

.

If • is instead a partial operation, then {{math|S}} is called a partial magma[5] or more often a partial groupoid.[5][6]

Morphism of magmas

A morphism of magmas is a function, {{nowrap|f : MN}}, mapping magma M to magma N, that preserves the binary operation:

f (xM y) = f(x) •N f(y)

where •M and •N denote the binary operation on M and N respectively.

Notation and combinatorics

The magma operation may be applied repeatedly, and in the general, non-associative case, the order matters, which is notated with parentheses. Also, the operation, •, is often omitted and notated by juxtaposition:

{{math|1= (a • (bc)) • d = (a(bc))d}}

A shorthand is often used to reduce the number of parentheses, in which the innermost operations and pairs of parentheses are omitted, being replaced just with juxtaposition, {{math|1=xyz = (xy) • z}}. For example, the above is abbreviated to the following expression, still containing parentheses:

{{math|1= (abc)d}}.

A way to avoid completely the use of parentheses is prefix notation, in which the same expression would be written {{math|1= ••abcd}}. Another way, familiar to programmers, is postfix notation (Reverse Polish notation), in which the same expression would be written {{math|1= abc••d•}}, in which the order of execution is simply left-to-right (no Currying).

The set of all possible strings consisting of symbols denoting elements of the magma, and sets of balanced parentheses is called the Dyck language. The total number of different ways of writing {{math|n}} applications of the magma operator is given by the Catalan number, {{math|Cn}}. Thus, for example, {{math|1=C2 = 2}}, which is just the statement that {{math|(ab)c}} and {{math|a(bc)}} are the only two ways of pairing three elements of a magma with two operations. Less trivially, {{math|1=C3 = 5}}: {{math|((ab)c)d}}, {{math|(a(bc))d}}, {{math|(ab)(cd)}}, {{math|a((bc)d)}}, and {{math|a(b(cd))}}.

There are magmas with elements so 1, 1, 16, 19683, 4294967296, ... {{OEIS|A002489}} magmas with 0, 1, 2, 3, 4, ... elements. The corresponding numbers of non-isomorphic magmas are 1, 1, 10, 3330, 178981952, ... {{OEIS|A001329}} and of simultaneously non-isomorphic and non-antiisomorphic magmas are 1, 1, 7, 1734, 89521056, ... {{OEIS|A001424}}.[7]

Free magma

A free magma, MX, on a set, X, is the "most general possible" magma generated by X (i.e., there are no relations or axioms imposed on the generators; see free object). It can be described as the set of non-associative words on X with parentheses retained.[8]

It can also be viewed, in terms familiar in computer science, as the magma of binary trees with leaves labelled 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 {{nowrap|f : XN}} is a function from X to any magma, N, then there is a unique extension of f to a morphism of magmas, f ′

f ′ : MXN.

{{see also|Free semigroup|Free group|Hall set|Wedderburn–Etherington number}}

Types of magma

Magmas are not often studied as such; instead there are several different kinds of magma, depending on what axioms the operation is required to satisfy. Commonly studied types of magma include:

//Quasigroup">Quasigroup: A magma where division is always possible
//Loop (algebra)">Loop: A quasigroup with an identity element
//Semigroup">Semigroup: A magma where the operation is associative
//Semilattice">Semilattice: A semigroup where the operation is commutative and idempotent
//Monoid">Monoid: A semigroup with an identity element
//Group (mathematics)">Group: A monoid with inverse elements, or equivalently, an associative loop, or a non-empty associative quasigroup
//Abelian group">Abelian group: A group where the operation is commutative

Note that each of divisibility and invertibility imply the cancellation property.

Classification by properties

{{Group-like structures}}

A magma {{math|(S, •)}}, with {{math|x, y, u, z}} ∈ {{math|S}}, is called

//Medial magma">Medial: If it satisfies the identity, {{math|xyuzxuyz}}
Left semimedial
If it satisfies the identity, {{math|xxyzxyxz}}
Right semimedial
If it satisfies the identity, {{math|yzxxyxzx}}
Semimedial
If it is both left and right semimedial
Left distributive
If it satisfies the identity, {{math|xyzxyxz}}
Right distributive
If it satisfies the identity, {{math|yzxyxzx}}
Autodistributive
If it is both left and right distributive
//Commutative magma">Commutative: If it satisfies the identity, {{math|xyyx}}
//Idempotent">Idempotent: If it satisfies the identity, {{math|xxx}}
//Unipotent">Unipotent: If it satisfies the identity, {{math|xxyy}}
Zeropotent
If it satisfies the identities, {{math|xxyxxyxx}}[9]
//Alternativity">Alternative: If it satisfies the identities {{math|xxyxxy}} and {{math|xyyxyy}}
//Power-associative">Power-associative: If the submagma generated by any element is associative
A
//semigroup">semigroup, or associative: If it satisfies the identity, {{math|xyzxyz}}
A left unar
If it satisfies the identity, {{math|xyxz}}
A right unar
If it satisfies the identity, {{math|yxzx}}
Semigroup with zero multiplication, or
//null semigroup">null semigroup: If it satisfies the identity, {{math|xyuv}}
{{anchor|unital}}Unital
If it has an identity element
Left-
//cancellative">cancellative: If, for all {{math|x, y}}, and, {{math|z}}, {{math|xy {{=}} xz}} implies {{math|y {{=}} z}}
Right-cancellative
If, for all {{math|x, y}}, and, {{math|z}}, {{math|yx {{=}} zx}} implies {{math|y {{=}} z}}
Cancellative
If it is both right-cancellative and left-cancellative
A
//Null semigroup#Left zero semigroup">semigroup with left zeros: If it is a semigroup and, for all {{math|x}}, the identity, {{math|xxy}}, holds
A
//Null semigroup#Right zero semigroup">semigroup with right zeros: If it is a semigroup and, for all {{math|x}}, the identity, {{math|xyx}}, holds
Trimedial
If any triple of (not necessarily distinct) elements generates a medial submagma
Entropic
If it is a homomorphic image of a medial cancellation magma.[10]

Generalizations

See n-ary group.

See also

  • Magma category
  • Auto magma object
  • Universal algebra
  • Magma computer algebra system, named after the object of this article.
  • Commutative non-associative magmas
  • Algebraic structures whose axioms are all identities
  • Groupoid algebra

References

1. ^{{citation |first=B. A. |last=Hausmann |first2=Øystein |last2=Ore |title=Theory of quasi-groups |journal=American Journal of Mathematics |volume=59 |issue=4 |pages=983–1004 |year=October 1937 |jstor=2371362 |doi=10.2307/2371362}}
2. ^{{citation |first=Christopher |last=Hollings |title=Mathematics across the Iron Curtain: A History of the Algebraic Theory of Semigroups |url=https://books.google.com/books?id=O9wJBAAAQBAJ&pg=PA142 |year=2014 |publisher=American Mathematical Society |isbn=978-1-4704-1493-1 |pages=142–3}}
3. ^{{citation |first=George M. |last=Bergman |first2=Adam O. |last2=Hausknecht |title=Cogroups and Co-rings in Categories of Associative Rings |url=https://books.google.com/books?id=s6NnkQs3JBMC&pg=PA61 |year=1996 |publisher=American Mathematical Society |isbn=978-0-8218-0495-7 |page=61}}
4. ^{{citation |first=N. |last=Bourbaki |title=Algebra I: Chapters 1–3 |chapter=Algebraic Structures: §1.1 Laws of Composition: Definition 1 |chapterurl=https://books.google.com/books?id=STS9aZ6F204C&pg=PA1 |year=1998 |publisher=Springer |isbn=978-3-540-64243-5 |page=1 |origyear=1970}}
5. ^{{citation |editor-first=Folkert |editor-last=Müller-Hoissen |editor2-first=Jean Marcel |editor2-last=Pallo |editor3-first=Jim |editor3-last=Stasheff |title=Associahedra, Tamari Lattices and Related Structures: Tamari Memorial Festschrift |url=https://books.google.com/books?id=Y01d6g5UemQC&pg=PA11 |year=2012 |publisher=Springer |isbn=978-3-0348-0405-9 |page=11}}
6. ^{{citation |editor-first=Ben |editor-last=Silver |title=Nineteen Papers on Algebraic Semigroups |publisher=American Mathematical Society |isbn=0-8218-3115-1 |last=Evseev |first=A. E. |chapter=A survey of partial groupoids |year=1988}}
7. ^{{mathworld|urlname=Groupoid|title=Groupoid}}
8. ^{{citation | title=Graduate Algebra: Noncommutative View | page=321 | series=Graduate Studies in Mathematics | first=Louis Halle | last=Rowen | publisher=American Mathematical Society | year=2008 | isbn=0-8218-8408-5 |chapter=Definition 21B.1. |chapterurl=https://books.google.com/books?id=8svFC09gGeMC&pg=PA321 }}
9. ^{{citation |first=T. |last=Kepka |first2=P. |last2=Němec |title=Simple balanced groupoids |journal=Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica |volume=35 |issue=1 |pages=53–60 |year=1996 |format=PDF |url=http://dml.cz/bitstream/handle/10338.dmlcz/120353/ActaOlom_35-1996-1_7.pdf }}
10. ^{{citation | last1 = Ježek | first1 = Jaroslav | last2 = Kepka | first2 = Tomáš | issue = 2 | journal = Commentationes Mathematicae Universitatis Carolinae | mr = 620359 | pages = 223–233 | title = Free entropic groupoids | url = http://dml.cz/bitstream/handle/10338.dmlcz/106070/CommentatMathUnivCarol_022-1981-2_2.pdf | volume = 22 | year = 1981}}.
{{refbegin}}
  • {{springer|id=m/m110040|author=M. Hazewinkel|title=Magma}}
  • {{springer|id=Groupoid|author=M. Hazewinkel|title=Groupoid}}
  • {{springer|id=f/f110190|author=M. Hazewinkel|title=Free magma}}
  • {{mathworld|urlname=Groupoid|title=Groupoid}}
{{refend}}

Further reading

  • {{citation |first=Richard Hubert |last=Bruck |authorlink=Richard Hubert Bruck |title=A survey of binary systems |year=1971 |publisher=Springer |isbn=978-0-387-03497-3 |edition=3rd}}
{{DEFAULTSORT:Magma (Algebra)}}

3 : Non-associative algebra|Binary operations|Algebraic structures

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/9/23 4:38:26