|
|
|
|
algebraic system
|
(Definition)
|
|
|
Before defining what an algebraic system is, let's recall that, for a non-negative integer , an -ary operator on a set is a function of the form
. The number is called the arity of . The most common -ary operators are those with arity . An -ary operator is nullary (a constant) if , unary if , and binary if . Finally, a finitary operator on is just an -ary operator on for some non-negative integer .
Informally, an algebraic system consists of
a pair of sets such that each element of is a finitary operator on .
However, because we want to be able to compare various algebraic systems with the same , the dependency of on is undesirable. Therefore, to define an algebraic system formally, one employs the language of model theory, which requires two stages: (1) define what is, and (2) define what is.
- A set
is called an operator set if there is a function from to
. Each element
is called an operator symbol and is its arity.
- Given an operator set
and a set , the pair is called an -algebra if there is a set such that
An algebraic system (variously called an algebraic structure, universal algebra, or simply algebra), is an -algebra for some set and some operator set .
In an algebraic system , is called the underlying set of , and the operator set of . When there is no confusion, we shall simply say that (instead of ) is an operator on
. If the underlying set is a singleton, then is called a trivial algebraic system.
Remarks
- In any algebra
, we typically adopt the convention that the constant operators are identifed with their values in . Also, we write as the value of a unary operator applied to . Finally, denotes the value of a binary operator applied
to
.
- Two algebraic systems
and are of the same type, or signature, if . A set of algebraic systems is of the same type if any two of them are of the same type.
Examples.
- If
, then an -algebra is any set, empty or not. If is a singleton whose sole element has arity 0, then an -algebra is a non-empty set, and in fact a pointed set.
- A group
is an algebraic system with three operators: a constant operator , a unary operator , and a binary operator called the multiplication. Of course, these operators satisfy additional conditions.
- A ring
without a multiplicative identity is an algebraic system with one constant operator 0, a unary operator , and two binary operators and . As in the previous examples, these operators meet certain additional constraints before can be called a ring. For example, with
form a group (in fact, Abelian group).
- A ring
with a multiplicative identity is an algebraic system. Like the previous examples, it has operators
. In addition, it has a second constant operator , called the multiplicative identity.
- A field
is not an algebraic system. The multiplicative inverse of an element is not defined when . It is not an operator, only a partial operator. It is possible to artificially define the inverse of 0 to be 0, which makes a field into an algebraic structure. However, the drawback is that it violates the rule that (which means we are no longer looking at a field!) A field is an example of a partial algebraic system.
- A lattice
is an algebraic system with two binary operators and . A bounded lattice is also an algebraic system. In addition of being a lattice, it has two constant operators 0 and .
- A complete lattice is not an algebraic system, since arbitrary meet and join are infinitary operators, that is, the domain has the form
, where is some arbitrary set of cardinality not necessarily finite.
- So far, all of the algebraic systems listed above have finite operator sets. Here's an example where the operator set
is possibly infinite. Let be a ring and a (left) module over . Then is an abelian group (with operators ). In addition, for each , we can define a unary operator on by left multiplication
. So, , together with
constitute an algebraic system.
Remark. All of the examples are trivially algebraic structures, if we “forget” one or more (or all) of the operators. For example, a field is by definition a ring with an additional operator (multiplicative inverse). Therefore, as a ring, a field is an algebraic structure. But as a field, it is not. Formally, if
, then any -algebra is an
-algebra.
- 1
- А. И. Мальцев: Алгебраические системы. Издательство ``Наука''. Москва(1970).
- 2
- P. M. Cohn: Universal Algebra, Harper & Row, (1965).
- 3
- G. Grätzer: Universal Algebra, 2nd Edition, Springer, New York (1978).
- 4
- P. Jipsen: Mathematical Structures: Homepage
|
Anyone with an account can edit this entry. Please help improve it!
"algebraic system" is owned by CWoo. [ full author list (4) | owner history (1) ]
|
|
(view preamble)
See Also: relational system
| Other names: |
algebraic structure, universal algebra, signature, trivial algebra |
| Also defines: |
-ary operator, finitary operator, infinitary operator, operator set, constant operator, operator symbol, nullary operator, type, trivial algebraic system |
|
|
Cross-references: module, infinite, finite, cardinality, domain, join, arbitrary meet, complete lattice, bounded lattice, lattice, partial algebraic system, inverse, partial operator, multiplicative inverse, field, abelian group, meet, multiplicative identity, ring, satisfy, group, pointed set, singleton, algebra, mapping, one-to-one correspondence, model theory, binary, unary, arity, number, function, operator, integer
There are 89 references to this entry.
This is version 34 of algebraic system, born on 2006-03-07, modified 2007-08-31.
Object id is 7695, canonical name is AlgebraicSystem.
Accessed 9207 times total.
Classification:
| AMS MSC: | 08A62 (General algebraic systems :: Algebraic structures :: Finitary algebras) | | | 03E99 (Mathematical logic and foundations :: Set theory :: Miscellaneous) | | | 08A05 (General algebraic systems :: Algebraic structures :: Structure theory) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|