Pseudo magma

from Wikipedia, the free encyclopedia

A pseudo-magma (neuter , plural pseudo magmas ), partial Magma , pseudo-groupoid , partial groupoid or Halbgruppoid (based on the English halfgroupoid ) is an algebraic structure (more precisely, partial algebra ) consisting of a quantity of one, and partial mapping consists.

It is a generalization of the mathematical concept of the magma or groupoid , in which the mapping must be a two-digit, internal link ( ), i.e. it must no longer be partial.

Alternative definition

A pseudo-magma can also be defined as a set together with an outer two-digit link of the second kind .

A pseudo-magma defined via a partial mapping can be converted into an equivalent pseudo-magma with an outer two-digit link of the second kind by specifying with and setting, if , otherwise .

Conversely, a pseudo-magma with an outer two-digit link of the second kind can be converted into an equivalent pseudo-magma defined via a partial mapping by setting as undefined at the point , if , otherwise .

Both definitions are therefore equivalent in a certain sense.

Further definitions

Sub-pseudomagma

Analogous to a sub magma or a sub-group , a lower pseudo magma (or Teilhalbgruppoid or Unterhalbgruppoid based on the English subhalfgroupoid be defined) from a pseudo-magma. Here, however, the definition range of the link must be considered separately.

Be a pseudo-magma. A pseudo-magma is called a sub-pseudomagma of , if and , i.e. H. the shortcut is the restriction of on .

So if and is a sub-pseudo magma of when and it is

and

for everyone .

A magma can therefore contain a sub-pseudomagma that is not a sub- magma , namely if:

.

example

Be and with , and following shortcut boards for and :

a b c
a a b -
b c b a
c c a -
a b
a a b
b - b

Then sub-pseudomagma is of .

Remarks:

  • The value of can be anything (it could also be , or undefined), there .
  • However, if there were, then there would be no sub-pseudomagma of , since then because of would not apply.

Further properties of sub-pseudomagmas

Be a pseudo-magma and a sub -pseudo-magma of .

  • means closed in (English "closed in M" ), if from and and follows and . Example:
a b c
a a b -
b b - a
c c a -
a b
a a b
b b -
  • ie extension of (Engl. "extension of U" ) when made and followed , and out of following . Example:
a b c
a a - -
b b c -
c - - -
a b
a a -
b b -
  • An extension of means full expansion of (Engl. "Complete extension of U" ) if . Example:
a b c
a a b -
b b c -
c - - -
a b
a a -
b b -
  • An extension of means open extension of (Engl. "Open extension of U" ) when made , and follows and , and from and follow . Example:
a b c d
a a - - -
b d c - -
c - - - -
d - - - -
a b
a a -
b - -

Remarks:

  • Each pseudo-magma is a self-contained sub-pseudo-magma.
  • Each pseudo-magma is an open extension of itself.
  • A pseudo-magma that is a complete extension of itself is a magma.
  • A non-magma pseudo-magma can have an open, or full, or open and full extension. Example of an open and full extension:
a b c d e
a a e - - -
b d c - - -
c - - - - -
d - - - - -
e - - - - -
a b
a a -
b - -

Laws of Calculation

Analogous to a magma, a pseudo-magma can be associative or commutative , but here the domain of definition must be considered more precisely. The following modified calculation laws apply:

  • A pseudo-Magma is associative (and is also called partial semigroup ) if for all with and applies
  1. exactly when
  2. and , if (and thus after 1. also )
  • A pseudo-magma is commutative if holds for all
  1. exactly when
  2. and , if (and thus after 1. also )

Examples

  • An example of an associative pseudo-magma can be found in the so-called small categories , in which the class of arrows is a lot. This set, together with the linkage explained for arrows, forms an associative pseudo-magma. - The formal requirement that the category has to be small is mostly negligible. As a rule, all knowledge about pseudo-magmas can also be transferred to the class of arrows with the associated link.
  • In general, the requirements for categories can be reduced to a composition operation in order to obtain a pseudo-magma, but this then does not have to be associative and also has no single elements.
  • Any set  M of images becomes an associative pseudo-magma by virtue of being executed one after the other as a composition
  • Formal languages are generally associative pseudo-magmas in terms of concatenation (spelling) as a link. The so-called * -language (read: "Star language", cf. Kleene star ) over an alphabet Σ is initially a semigroup (even a monoid ), because in it the concatenation of two words is explained to a new word and that new word is back in the language. Formal languages, however, are defined as any subsets of any such * -language, so that in a special language the concatenation of two words is still explained / explainable, but does not lead to a word in the same language.

Individual evidence

  1. ^ A b Günther Eisenreich: Lexicon of Algebra . Akademie-Verlag / Springer-Verlag, Berlin 1989, ISBN 3-05-500231-8 .
  2. a b c d e f Richard Hubert Bruck: A survey of binary systems . In: PJHilton (ed.): Results of mathematics and their border areas . 3. Edition. tape 20 . Springer Verlag, Berlin / Heidelberg / New York 1971, ISBN 978-3-662-42837-5 .
  3. ^ Yoshifumi Inui, François Le Gall: Quantum Property Testing of Group Solvability . S. 2 , arxiv : 0712.3829 (definition at the beginning of § 2.1).
  4. Shelp, RH: A Partial Semigroup Approach to Partially Ordered Sets . In: Proc. London Math. Soc. (1972) p3-24 (1) . London Mathematical Soc., 1972, pp. 46-58.