In the branch of
mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
known as
universal algebra
Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures themselves, not examples ("models") of algebraic structures.
For instance, rather than take particular groups as the object of study, ...
(and in its applications), a subdirectly irreducible algebra is an
algebra
Algebra () is one of the broad areas of mathematics. Roughly speaking, algebra is the study of mathematical symbols and the rules for manipulating these symbols in formulas; it is a unifying thread of almost all of mathematics.
Elementary a ...
that cannot be factored as a
subdirect product In mathematics, especially in the areas of abstract algebra known as universal algebra, group theory, ring theory, and module theory, a subdirect product is a subalgebra of a direct product that depends fully on all its factors without however ne ...
of "simpler" algebras. Subdirectly irreducible algebras play a somewhat analogous role in algebra to
primes
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways ...
in
number theory
Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic function, integer-valued functions. German mathematician Carl Friedrich Gauss (1777â ...
.
Definition
A
universal algebra
Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures themselves, not examples ("models") of algebraic structures.
For instance, rather than take particular groups as the object of study, ...
''A'' is said to be subdirectly irreducible when ''A'' has more than one element, and when any
subdirect representation of ''A'' includes (as a factor) an algebra
isomorphic
In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is ...
to ''A'', with the isomorphism being given by the projection map.
Examples
* The two-element
chain
A chain is a serial assembly of connected pieces, called links, typically made of metal, with an overall character similar to that of a rope in that it is flexible and curved in compression but linear, rigid, and load-bearing in tension. A c ...
, as either a
Boolean algebra
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values ''true'' and ''false'', usually denoted 1 and 0, whereas in e ...
, a
Heyting algebra In mathematics, a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with least element 0 and greatest element 1) equipped with a binary operation ''a'' → ''b'' of '' ...
, a
lattice
Lattice may refer to:
Arts and design
* Latticework, an ornamental criss-crossed framework, an arrangement of crossing laths or other thin strips of material
* Lattice (music), an organized grid model of pitch ratios
* Lattice (pastry), an ornam ...
, or a
semilattice
In mathematics, a join-semilattice (or upper semilattice) is a partially ordered set that has a join (a least upper bound) for any nonempty finite subset. Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a mee ...
, is subdirectly irreducible. In fact, the two-element chain is the only subdirectly irreducible
distributive lattice
In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other. The prototypical examples of such structures are collections of sets for which the lattice operations can be given by set uni ...
.
* Any finite chain with two or more elements, as a
Heyting algebra In mathematics, a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with least element 0 and greatest element 1) equipped with a binary operation ''a'' → ''b'' of '' ...
, is subdirectly irreducible. (This is not the case for chains of three or more elements as either lattices or semilattices, which are subdirectly reducible to the two-element chain. The difference with Heyting algebras is that ''a'' → ''b'' need not be comparable with ''a'' under the lattice order even when ''b'' is.)
* Any
finite
Finite is the opposite of infinite. It may refer to:
* Finite number (disambiguation)
* Finite set, a set whose cardinality (number of elements) is some natural number
* Finite verb, a verb form that has a subject, usually being inflected or marked ...
cyclic group
In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative bina ...
of order a power of a prime (i.e. any finite
''p''-group) is subdirectly irreducible. (One weakness of the analogy between subdirect irreducibles and prime numbers is that the
integer
An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign (−1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language ...
s are subdirectly representable by any infinite family of nonisomorphic prime-power cyclic groups, e.g. just those of order a Mersenne prime assuming there are infinitely many.) In fact, an
abelian group
In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commut ...
is subdirectly irreducible
if and only if
In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false.
The connective is bicondi ...
it is
isomorphic
In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is ...
to a finite ''p''-group or isomorphic to a
Prüfer group
In mathematics, specifically in group theory, the Prüfer ''p''-group or the ''p''-quasicyclic group or ''p''∞-group, Z(''p''∞), for a prime number ''p'' is the unique ''p''-group in which every element has ''p'' different ''p''-th roots.
...
(an infinite but
countable
In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbers; ...
''p''-group, which is the
direct limit
In mathematics, a direct limit is a way to construct a (typically large) object from many (typically smaller) objects that are put together in a specific way. These objects may be groups, rings, vector spaces or in general objects from any categor ...
of its finite ''p''-subgroups).
* A
vector space
In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called ''vectors'', may be added together and multiplied ("scaled") by numbers called '' scalars''. Scalars are often real numbers, but can ...
is subdirectly irreducible if and only if it has
dimension
In physics and mathematics, the dimension of a Space (mathematics), mathematical space (or object) is informally defined as the minimum number of coordinates needed to specify any Point (geometry), point within it. Thus, a Line (geometry), lin ...
one.
Properties
The subdirect representation theorem of universal algebra states that every algebra is subdirectly representable by its subdirectly irreducible
quotient
In arithmetic, a quotient (from lat, quotiens 'how many times', pronounced ) is a quantity produced by the division of two numbers. The quotient has widespread use throughout mathematics, and is commonly referred to as the integer part of a ...
s. An equivalent definition of "subdirect irreducible" therefore is any algebra ''A'' that is not subdirectly representable by those of its quotients not isomorphic to ''A''. (This is not quite the same thing as "by its proper quotients" because a proper quotient of ''A'' may be isomorphic to ''A'', for example the quotient of the semilattice (Z, ) obtained by identifying just the two elements 3 and 4.)
An immediate
corollary
In mathematics and logic, a corollary ( , ) is a theorem of less importance which can be readily deduced from a previous, more notable statement. A corollary could, for instance, be a proposition which is incidentally proved while proving another ...
is that any
variety
Variety may refer to:
Arts and entertainment Entertainment formats
* Variety (radio)
* Variety show, in theater and television
Films
* ''Variety'' (1925 film), a German silent film directed by Ewald Andre Dupont
* ''Variety'' (1935 film), ...
, as a class closed under homomorphisms, subalgebras, and direct products, is determined by its subdirectly irreducible members, since every algebra ''A'' in the variety can be constructed as a subalgebra of a suitable direct product of the subdirectly irreducible quotients of ''A'', all of which belong to the variety because ''A'' does. For this reason one often studies not the variety itself but just its subdirect irreducibles.
An algebra ''A'' is subdirectly irreducible if and only if it contains two elements that are identified by every proper quotient, equivalently, if and only if its lattice Con ''A'' of
congruence
Congruence may refer to:
Mathematics
* Congruence (geometry), being the same size and shape
* Congruence or congruence relation, in abstract algebra, an equivalence relation on an algebraic structure that is compatible with the structure
* In mod ...
s has a least nonidentity element. That is, any subdirect irreducible must contain a specific pair of elements witnessing its irreducibility in this way. Given such a witness (''a'', ''b'') to subdirect irreducibility we say that the subdirect irreducible is (''a'', ''b'')-irreducible.
Given any class ''C'' of similar algebras, Jónsson's lemma (due to
Bjarni Jónsson
Bjarni Jónsson (February 15, 1920 – September 30, 2016) was an Icelandic mathematician and logician working in universal algebra, lattice theory, model theory and set theory. He was emeritus distinguished professor of mathematics at Vanderbilt ...
) states that if the variety HSP(''C'') generated by ''C'' is
congruence-distributive, its subdirect irreducibles are in HSP
U(''C''), that is, they are quotients of subalgebras of
ultraproduct
The ultraproduct is a mathematical construction that appears mainly in abstract algebra and mathematical logic, in particular in model theory and set theory. An ultraproduct is a quotient of the direct product of a family of structures. All factors ...
s of members of ''C''. (If ''C'' is a finite set of finite algebras, the ultraproduct operation is redundant.)
Applications
A necessary and sufficient condition for a Heyting algebra to be subdirectly irreducible is for there to be a greatest element strictly below 1. The witnessing pair is that element and 1, and identifying any other pair ''a'', ''b'' of elements identifies both ''a''→''b'' and ''b''→''a'' with 1 thereby collapsing everything above those two implications to 1. Hence every finite chain of two or more elements as a Heyting algebra is subdirectly irreducible.
By
Jónsson's Lemma, subdirectly irreducible algebras of a congruence-distributive variety generated by a finite set of finite algebras are no larger than the generating algebras, since the quotients and subalgebras of an algebra ''A'' are never larger than ''A'' itself. For example, the subdirect irreducibles in the variety generated by a finite
linearly ordered
In mathematics, a total or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation \leq on some set X, which satisfies the following for all a, b and c in X:
# a \leq a ( reflexive) ...
Heyting algebra ''H'' must be just the nondegenerate quotients of ''H'', namely all smaller linearly ordered nondegenerate Heyting algebras. The conditions cannot be dropped in general: for example, the variety of all Heyting algebras is generated by the set of its finite subdirectly irreducible algebras, but there exist subdirectly irreducible Heyting algebras of arbitrary (infinite)
cardinality
In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set A = \ contains 3 elements, and therefore A has a cardinality of 3. Beginning in the late 19th century, this concept was generalized ...
. There also exists a single finite algebra generating a (non-congruence-distributive) variety with arbitrarily large subdirect irreducibles.
[R. McKenzie, ''The residual bounds of finite algebras'', Int. J. Algebra Comput. 6 (1996), 1–29.]
References
* {{cite book, author=Pierre Antoine Grillet, title=Abstract algebra, year=2007, publisher=Springer, isbn=978-0-387-71567-4
Universal algebra
Properties of groups