In
group theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups.
The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ...
, a
group
A group is a number of persons or things that are located, gathered, or classed together.
Groups of people
* Cultural group, a group whose members share the same cultural identity
* Ethnic group, a group whose members share the same ethnic ide ...
is algebraically closed if any finite set of equations and inequations that are applicable to
have a solution in
without needing a
group extension
In mathematics, a group extension is a general means of describing a group in terms of a particular normal subgroup and quotient group. If Q and N are two groups, then G is an extension of Q by N if there is a short exact sequence
:1\to N\;\ov ...
. This notion will be made precise later in the article in .
Informal discussion
Suppose we wished to find an element
of a group
satisfying the conditions (equations and inequations):
::
::
::
Then it is easy to see that this is impossible because the first two equations imply
. In this case we say the set of conditions are
inconsistent
In classical deductive logic, a consistent theory is one that does not lead to a logical contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consistent i ...
with
. (In fact this set of conditions are inconsistent with any group whatsoever.)
Now suppose
is the group with the multiplication table to the right.
Then the conditions:
::
::
have a solution in
, namely
.
However the conditions:
::
::
Do not have a solution in
, as can easily be checked.
However if we extend the group
to the group
with the adjacent multiplication table:
Then the conditions have two solutions, namely
and
.
Thus there are three possibilities regarding such conditions:
* They may be inconsistent with
and have no solution in any extension of
.
* They may have a solution in
.
* They may have no solution in
but nevertheless have a solution in some extension
of
.
It is reasonable to ask whether there are any groups
such that whenever a set of conditions like these have a solution at all, they have a solution in
itself? The answer turns out to be "yes", and we call such groups algebraically closed groups.
Formal definition
We first need some preliminary ideas.
If
is a group and
is the
free group
In mathematics, the free group ''F'S'' over a given set ''S'' consists of all words that can be built from members of ''S'', considering two words to be different unless their equality follows from the group axioms (e.g. ''st'' = ''suu''− ...
on
countably
In mathematics, a Set (mathematics), set is countable if either it is finite set, 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 fro ...
many generators, then by a finite set of equations and inequations with coefficients in
we mean a pair of subsets
and
of
the
free product
In mathematics, specifically group theory, the free product is an operation that takes two groups ''G'' and ''H'' and constructs a new The result contains both ''G'' and ''H'' as subgroups, is generated by the elements of these subgroups, and ...
of
and
.
This formalizes the notion of a set of equations and inequations consisting of variables
and elements
of
. The set
represents equations like:
::
::
::
The set
represents inequations like
::
::
By a solution in
to this finite set of equations and inequations, we mean a homomorphism
, such that
for all
and
for all
, where
is the unique homomorphism
that equals
on
and is the identity on
.
This formalizes the idea of substituting elements of
for the variables to get true identities and inidentities. In the example the substitutions
and
yield:
::
::
::
::
::
We say the finite set of equations and inequations is consistent with
if we can solve them in a "bigger" group
. More formally:
The equations and inequations are consistent with
if there is a group
and an embedding
such that the finite set of equations and inequations
and
has a solution in
, where
is the unique homomorphism
that equals
on
and is the identity on
.
Now we formally define the group
to be algebraically closed if every finite set of equations and inequations that has coefficients in
and is consistent with
has a solution in
.
Known Results
It is difficult to give concrete examples of algebraically closed groups as the following results indicate:
* Every
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 number ...
group can be embedded in a countable algebraically closed group.
* Every algebraically closed group is
simple
Simple or SIMPLE may refer to:
* Simplicity, the state or quality of being simple
Arts and entertainment
* ''Simple'' (album), by Andy Yorke, 2008, and its title track
* "Simple" (Florida Georgia Line song), 2018
* "Simple", a song by John ...
.
* No algebraically closed group is
finitely generated.
* An algebraically closed group cannot be
recursively presented.
* A finitely generated group has a
solvable word problem if and only if it can be embedded in every algebraically closed group.
The proofs of these results are in general very complex. However, a sketch of the proof that a countable group
can be embedded in an algebraically closed group follows.
First we embed
in a countable group
with the property that every finite set of equations with coefficients in
that is consistent in
has a solution in
as follows:
There are only countably many finite sets of equations and inequations with coefficients in
. Fix an enumeration
of them. Define groups
inductively by:
::
::
Now let:
::
Now iterate this construction to get a sequence of groups
and let:
::
Then
is a countable group containing
. It is algebraically closed because any finite set of equations and inequations that is consistent with
must have coefficients in some
and so must have a solution in
.
See also
*
Algebraic closure
In mathematics, particularly abstract algebra, an algebraic closure of a field ''K'' is an algebraic extension of ''K'' that is algebraically closed. It is one of many closures in mathematics.
Using Zorn's lemmaMcCarthy (1991) p.21Kaplansky ...
**
Algebraically closed field
References
* A. Macintyre: On algebraically closed groups, ann. of Math, 96, 53-97 (1972)
* B.H. Neumann: A note on algebraically closed groups. J. London Math. Soc. 27, 227-242 (1952)
* B.H. Neumann: The isomorphism problem for algebraically closed groups. In: Word Problems, pp 553–562. Amsterdam: North-Holland 1973
* W.R. Scott: Algebraically closed groups. Proc. Amer. Math. Soc. 2, 118-121 (1951)
Properties of groups