Hubbry Logo
Group theoryGroup theoryMain
Open search
Group theory
Community hub
Group theory
logo
8 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Group theory
Group theory
from Wikipedia
The popular Rubik's Cube puzzle, invented in 1974 by Ernő Rubik, has been used as an illustration of permutation groups. See Rubik's Cube group.

In abstract algebra, group theory studies the algebraic structures known as groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as rings, fields, and vector spaces, can all be seen as groups endowed with additional operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right.

Various physical systems, such as crystals and the hydrogen atom, and three of the four known fundamental forces in the universe, may be modelled by symmetry groups. Thus group theory and the closely related representation theory have many important applications in physics, chemistry, and materials science. Group theory is also central to public key cryptography.

The early history of group theory dates from the 19th century. One of the most important mathematical achievements of the 20th century[1] was the collaborative effort, taking up more than 10,000 journal pages and mostly published between 1960 and 2004, that culminated in a complete classification of finite simple groups.

History

[edit]

Group theory has three main historical sources: number theory, the theory of algebraic equations, and geometry. The number-theoretic strand was begun by Leonhard Euler, and developed by Gauss's work on modular arithmetic and additive and multiplicative groups related to quadratic fields. Early results about permutation groups were obtained by Lagrange, Ruffini, and Abel in their quest for general solutions of polynomial equations of high degree. Évariste Galois coined the term "group" and established a connection, now known as Galois theory, between the nascent theory of groups and field theory. In geometry, groups first became important in projective geometry and, later, non-Euclidean geometry. Felix Klein's Erlangen program proclaimed group theory to be the organizing principle of geometry.

Galois, in the 1830s, was the first to employ groups to determine the solvability of polynomial equations. Arthur Cayley and Augustin Louis Cauchy pushed these investigations further by creating the theory of permutation groups. The second historical source for groups stems from geometrical situations. In an attempt to come to grips with possible geometries (such as euclidean, hyperbolic or projective geometry) using group theory, Felix Klein initiated the Erlangen programme. Sophus Lie, in 1884, started using groups (now called Lie groups) attached to analytic problems. Thirdly, groups were, at first implicitly and later explicitly, used in algebraic number theory.

The different scope of these early sources resulted in different notions of groups. The theory of groups was unified starting around 1880. Since then, the impact of group theory has been ever growing, giving rise to the birth of abstract algebra in the early 20th century, representation theory, and many more influential spin-off domains. The classification of finite simple groups is a vast body of work from the mid 20th century, classifying all the finite simple groups.

Main classes of groups

[edit]

The range of groups being considered has gradually expanded from finite permutation groups and special examples of matrix groups to abstract groups that may be specified through a presentation by generators and relations.

Permutation groups

[edit]

The first class of groups to undergo a systematic study was permutation groups. Given any set X and a collection G of bijections of X into itself (known as permutations) that is closed under compositions and inverses, G is a group acting on X. If X consists of n elements and G consists of all permutations, G is the symmetric group Sn; in general, any permutation group G is a subgroup of the symmetric group of X. An early construction due to Cayley exhibited any group as a permutation group, acting on itself (X = G) by means of the left regular representation.

In many cases, the structure of a permutation group can be studied using the properties of its action on the corresponding set. For example, in this way one proves that for n ≥ 5, the alternating group An is simple, i.e. does not admit any proper normal subgroups. This fact plays a key role in the impossibility of solving a general algebraic equation of degree n ≥ 5 in radicals.

Matrix groups

[edit]

The next important class of groups is given by matrix groups, or linear groups. Here G is a set consisting of invertible matrices of given order n over a field K that is closed under the products and inverses. Such a group acts on the n-dimensional vector space Kn by linear transformations. This action makes matrix groups conceptually similar to permutation groups, and the geometry of the action may be usefully exploited to establish properties of the group G.

Transformation groups

[edit]

Permutation groups and matrix groups are special cases of transformation groups: groups that act on a certain space X preserving its inherent structure. In the case of permutation groups, X is a set; for matrix groups, X is a vector space. The concept of a transformation group is closely related with the concept of a symmetry group: transformation groups frequently consist of all transformations that preserve a certain structure.

The theory of transformation groups forms a bridge connecting group theory with differential geometry. A long line of research, originating with Lie and Klein, considers group actions on manifolds by homeomorphisms or diffeomorphisms. The groups themselves may be discrete or continuous.

Abstract groups

[edit]

Most groups considered in the first stage of the development of group theory were "concrete", having been realized through numbers, permutations, or matrices. It was not until the late nineteenth century that the idea of an abstract group began to take hold, where "abstract" means that the nature of the elements are ignored in such a way that two isomorphic groups are considered as the same group. A typical way of specifying an abstract group is through a presentation by generators and relations,

A significant source of abstract groups is given by the construction of a factor group, or quotient group, G/H, of a group G by a normal subgroup H. Class groups of algebraic number fields were among the earliest examples of factor groups, of much interest in number theory. If a group G is a permutation group on a set X, the factor group G/H is no longer acting on X; but the idea of an abstract group permits one not to worry about this discrepancy.

The change of perspective from concrete to abstract groups makes it natural to consider properties of groups that are independent of a particular realization, or in modern language, invariant under isomorphism, as well as the classes of group with a given such property: finite groups, periodic groups, simple groups, solvable groups, and so on. Rather than exploring properties of an individual group, one seeks to establish results that apply to a whole class of groups. The new paradigm was of paramount importance for the development of mathematics: it foreshadowed the creation of abstract algebra in the works of Hilbert, Emil Artin, Emmy Noether, and mathematicians of their school.[citation needed]

Groups with additional structure

[edit]

An important elaboration of the concept of a group occurs if G is endowed with additional structure, notably, of a topological space, differentiable manifold, or algebraic variety. If the multiplication and inversion of the group are compatible with this structure, that is, they are continuous, smooth or regular (in the sense of algebraic geometry) maps, then G is a topological group, a Lie group, or an algebraic group.[2]

The presence of extra structure relates these types of groups with other mathematical disciplines and means that more tools are available in their study. Topological groups form a natural domain for abstract harmonic analysis, whereas Lie groups (frequently realized as transformation groups) are the mainstays of differential geometry and unitary representation theory. Certain classification questions that cannot be solved in general can be approached and resolved for special subclasses of groups. Thus, compact connected Lie groups have been completely classified. There is a fruitful relation between infinite abstract groups and topological groups: whenever a group Γ can be realized as a lattice in a topological group G, the geometry and analysis pertaining to G yield important results about Γ. A comparatively recent trend in the theory of finite groups exploits their connections with compact topological groups (profinite groups): for example, a single p-adic analytic group G has a family of quotients which are finite p-groups of various orders, and properties of G translate into the properties of its finite quotients.

Branches of group theory

[edit]

Finite group theory

[edit]

During the twentieth century, mathematicians investigated some aspects of the theory of finite groups in great depth, especially the local theory of finite groups and the theory of solvable and nilpotent groups.[citation needed] As a consequence, the complete classification of finite simple groups was achieved, meaning that all those simple groups from which all finite groups can be built are now known.

During the second half of the twentieth century, mathematicians such as Chevalley and Steinberg also increased our understanding of finite analogs of classical groups, and other related groups. One such family of groups is the family of general linear groups over finite fields. Finite groups often occur when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving transformations. The theory of Lie groups, which may be viewed as dealing with "continuous symmetry", is strongly influenced by the associated Weyl groups. These are finite groups generated by reflections which act on a finite-dimensional Euclidean space. The properties of finite groups can thus play a role in subjects such as theoretical physics and chemistry.

Representation of groups

[edit]

Saying that a group G acts on a set X means that every element of G defines a bijective map on the set X in a way compatible with the group structure. When X has more structure, it is useful to restrict this notion further: a representation of G on a vector space V is a group homomorphism:

where GL(V) consists of the invertible linear transformations of V. In other words, to every group element g is assigned an automorphism ρ(g) such that ρ(g) ∘ ρ(h) = ρ(gh) for any h in G.

This definition can be understood in two directions, both of which give rise to whole new domains of mathematics.[3] On the one hand, it may yield new information about the group G: often, the group operation in G is abstractly given, but via ρ, it corresponds to the multiplication of matrices, which is very explicit.[4] On the other hand, given a well-understood group acting on a complicated object, this simplifies the study of the object in question. For example, if G is finite, it is known that V above decomposes into irreducible parts (see Maschke's theorem). These parts, in turn, are much more easily manageable than the whole V (via Schur's lemma).

Given a group G, representation theory then asks what representations of G exist. There are several settings, and the employed methods and obtained results are rather different in every case: representation theory of finite groups and representations of Lie groups are two main subdomains of the theory. The totality of representations is governed by the group's characters. For example, Fourier polynomials can be interpreted as the characters of U(1), the group of complex numbers of absolute value 1, acting on the L2-space of periodic functions.

Lie theory

[edit]

A Lie group is a group that is also a differentiable manifold, with the property that the group operations are compatible with the smooth structure. Lie groups are named after Sophus Lie, who laid the foundations of the theory of continuous transformation groups. The term groupes de Lie first appeared in French in 1893 in the thesis of Lie's student Arthur Tresse, page 3.[5]

Lie groups represent the best-developed theory of continuous symmetry of mathematical objects and structures, which makes them indispensable tools for many parts of contemporary mathematics, as well as for modern theoretical physics. They provide a natural framework for analysing the continuous symmetries of differential equations (differential Galois theory), in much the same way as permutation groups are used in Galois theory for analysing the discrete symmetries of algebraic equations. An extension of Galois theory to the case of continuous symmetry groups was one of Lie's principal motivations.

Combinatorial and geometric group theory

[edit]

Groups can be described in different ways. Finite groups can be described by writing down the group table consisting of all possible multiplications gh. A more compact way of defining a group is by generators and relations, also called the presentation of a group. Given any set F of generators , the free group generated by F surjects onto the group G. The kernel of this map is called the subgroup of relations, generated by some subset D. The presentation is usually denoted by For example, the group presentation describes a group which is isomorphic to A string consisting of generator symbols and their inverses is called a word.

Combinatorial group theory studies groups from the perspective of generators and relations.[6] It is particularly useful where finiteness assumptions are satisfied, for example finitely generated groups, or finitely presented groups (i.e. in addition the relations are finite). The area makes use of the connection of graphs via their fundamental groups. A fundamental theorem of this area is that every subgroup of a free group is free.

There are several natural questions arising from giving a group by its presentation. The word problem asks whether two words are effectively the same group element. By relating the problem to Turing machines, one can show that there is in general no algorithm solving this task. Another, generally harder, algorithmically insoluble problem is the group isomorphism problem, which asks whether two groups given by different presentations are actually isomorphic. For example, the group with presentation is isomorphic to the additive group Z of integers, although this may not be immediately apparent. (Writing , one has )

The Cayley graph of ⟨ x, y ∣ ⟩, the free group of rank 2

Geometric group theory attacks these problems from a geometric viewpoint, either by viewing groups as geometric objects, or by finding suitable geometric objects a group acts on.[7] The first idea is made precise by means of the Cayley graph, whose vertices correspond to group elements and edges correspond to right multiplication in the group. Given two elements, one constructs the word metric given by the length of the minimal path between the elements. A theorem of Milnor and Svarc then says that given a group G acting in a reasonable manner on a metric space X, for example a compact manifold, then G is quasi-isometric (i.e. looks similar from a distance) to the space X.

Connection of groups and symmetry

[edit]

Given a structured object X of any sort, a symmetry is a mapping of the object onto itself which preserves the structure. This occurs in many cases, for example

  • If X is a set with no additional structure, a symmetry is a bijective map from the set to itself, giving rise to permutation groups.
  • If the object X is a set of points in the plane with its metric structure or any other metric space, a symmetry is a bijection of the set to itself which preserves the distance between each pair of points (an isometry). The corresponding group is called isometry group of X.
  • If instead angles are preserved, one speaks of conformal maps. Conformal maps give rise to Kleinian groups, for example.
  • Symmetries are not restricted to geometrical objects, but include algebraic objects as well. For instance, the equation has the two solutions and . In this case, the group that exchanges the two roots is the Galois group belonging to the equation. Every polynomial equation in one variable has a Galois group, that is a certain permutation group on its roots.

The axioms of a group formalize the essential aspects of symmetry. Symmetries form a group: they are closed because if you take a symmetry of an object, and then apply another symmetry, the result will still be a symmetry. The identity keeping the object fixed is always a symmetry of an object. Existence of inverses is guaranteed by undoing the symmetry and the associativity comes from the fact that symmetries are functions on a space, and composition of functions is associative.

Frucht's theorem says that every group is the symmetry group of some graph. So every abstract group is actually the symmetries of some explicit object.

The saying of "preserving the structure" of an object can be made precise by working in a category. Maps preserving the structure are then the morphisms, and the symmetry group is the automorphism group of the object in question.

Applications of group theory

[edit]

Applications of group theory abound. Almost all structures in abstract algebra are special cases of groups. Rings, for example, can be viewed as abelian groups (corresponding to addition) together with a second operation (corresponding to multiplication). Therefore, group theoretic arguments underlie large parts of the theory of those entities.

Galois theory

[edit]

Galois theory uses groups to describe the symmetries of the roots of a polynomial (or more precisely the automorphisms of the algebras generated by these roots). The fundamental theorem of Galois theory provides a link between algebraic field extensions and group theory. It gives an effective criterion for the solvability of polynomial equations in terms of the solvability of the corresponding Galois group. For example, S5, the symmetric group in 5 elements, is not solvable which implies that the general quintic equation cannot be solved by radicals in the way equations of lower degree can. The theory, being one of the historical roots of group theory, is still fruitfully applied to yield new results in areas such as class field theory.

Algebraic topology

[edit]

Algebraic topology is another domain which prominently associates groups to the objects the theory is interested in. There, groups are used to describe certain invariants of topological spaces. They are called "invariants" because they are defined in such a way that they do not change if the space is subjected to some deformation. For example, the fundamental group "counts" how many paths in the space are essentially different. The Poincaré conjecture, proved in 2002/2003 by Grigori Perelman, is a prominent application of this idea. The influence is not unidirectional, though. For example, algebraic topology makes use of Eilenberg–MacLane spaces which are spaces with prescribed homotopy groups. Similarly algebraic K-theory relies in a way on classifying spaces of groups. Finally, the name of the torsion subgroup of an infinite group shows the legacy of topology in group theory.

A torus. Its abelian group structure is induced from the map CC/(Z + τZ), where τ is a parameter living in the upper half plane.

Algebraic geometry

[edit]

Algebraic geometry likewise uses group theory in many ways. Abelian varieties have been introduced above. The presence of the group operation yields additional information which makes these varieties particularly accessible. They also often serve as a test for new conjectures. (For example the Hodge conjecture (in certain cases).) The one-dimensional case, namely elliptic curves is studied in particular detail. They are both theoretically and practically intriguing.[8] In another direction, toric varieties are algebraic varieties acted on by a torus. Toroidal embeddings have recently led to advances in algebraic geometry, in particular resolution of singularities.[9]

Algebraic number theory

[edit]

Algebraic number theory makes uses of groups for some important applications. For example, Euler's product formula,

captures the fact that any integer decomposes in a unique way into primes. The failure of this statement for more general rings gives rise to class groups and regular primes, which feature in Kummer's treatment of Fermat's Last Theorem.

Harmonic analysis

[edit]

Analysis on Lie groups and certain other groups is called harmonic analysis. Haar measures, that is, integrals invariant under the translation in a Lie group, are used for pattern recognition and other image processing techniques.[10]

Combinatorics

[edit]

In combinatorics, the notion of permutation group and the concept of group action are often used to simplify the counting of a set of objects; see in particular Burnside's lemma.

The circle of fifths may be endowed with a cyclic group structure.

Music

[edit]

The presence of the 12-periodicity in the circle of fifths yields applications of elementary group theory in musical set theory. Transformational theory models musical transformations as elements of a mathematical group.

Physics

[edit]

In physics, groups are important because they describe the symmetries which the laws of physics seem to obey. According to Noether's theorem, every continuous symmetry of a physical system corresponds to a conservation law of the system. Physicists are very interested in group representations, especially of Lie groups, since these representations often point the way to the "possible" physical theories. Examples of the use of groups in physics include the Standard Model, gauge theory, the Lorentz group, and the Poincaré group.

Group theory can be used to resolve the incompleteness of the statistical interpretations of mechanics developed by Willard Gibbs, relating to the summing of an infinite number of probabilities to yield a meaningful solution.[11]

Chemistry and materials science

[edit]

In chemistry and materials science, point groups are used to classify regular polyhedra, and the symmetries of molecules, and space groups to classify crystal structures. The assigned groups can then be used to determine physical properties (such as chemical polarity and chirality), spectroscopic properties (particularly useful for Raman spectroscopy, infrared spectroscopy, circular dichroism spectroscopy, magnetic circular dichroism spectroscopy, UV/Vis spectroscopy, and fluorescence spectroscopy), and to construct molecular orbitals.

Molecular symmetry is responsible for many physical and spectroscopic properties of compounds and provides relevant information about how chemical reactions occur. In order to assign a point group for any given molecule, it is necessary to find the set of symmetry operations present on it. The symmetry operation is an action, such as a rotation around an axis or a reflection through a mirror plane. In other words, it is an operation that moves the molecule such that it is indistinguishable from the original configuration. In group theory, the rotation axes and mirror planes are called "symmetry elements". These elements can be a point, line or plane with respect to which the symmetry operation is carried out. The symmetry operations of a molecule determine the specific point group for this molecule.

Water molecule with symmetry axis

In chemistry, there are five important symmetry operations. They are identity operation (E), rotation operation or proper rotation (Cn), reflection operation (σ), inversion (i) and rotation reflection operation or improper rotation (Sn). The identity operation (E) consists of leaving the molecule as it is. This is equivalent to any number of full rotations around any axis. This is a symmetry of all molecules, whereas the symmetry group of a chiral molecule consists of only the identity operation. An identity operation is a characteristic of every molecule even if it has no symmetry. Rotation around an axis (Cn) consists of rotating the molecule around a specific axis by a specific angle. It is rotation through the angle 360°/n, where n is an integer, about a rotation axis. For example, if a water molecule rotates 180° around the axis that passes through the oxygen atom and between the hydrogen atoms, it is in the same configuration as it started. In this case, n = 2, since applying it twice produces the identity operation. In molecules with more than one rotation axis, the Cn axis having the largest value of n is the highest order rotation axis or principal axis. For example in boron trifluoride (BF3), the highest order of rotation axis is C3, so the principal axis of rotation is C3.

In the reflection operation (σ) many molecules have mirror planes, although they may not be obvious. The reflection operation exchanges left and right, as if each point had moved perpendicularly through the plane to a position exactly as far from the plane as when it started. When the plane is perpendicular to the principal axis of rotation, it is called σh (horizontal). Other planes, which contain the principal axis of rotation, are labeled vertical (σv) or dihedral (σd).

Inversion (i ) is a more complex operation. Each point moves through the center of the molecule to a position opposite the original position and as far from the central point as where it started. Many molecules that seem at first glance to have an inversion center do not; for example, methane and other tetrahedral molecules lack inversion symmetry. To see this, hold a methane model with two hydrogen atoms in the vertical plane on the right and two hydrogen atoms in the horizontal plane on the left. Inversion results in two hydrogen atoms in the horizontal plane on the right and two hydrogen atoms in the vertical plane on the left. Inversion is therefore not a symmetry operation of methane, because the orientation of the molecule following the inversion operation differs from the original orientation. And the last operation is improper rotation or rotation reflection operation (Sn) requires rotation of  360°/n, followed by reflection through a plane perpendicular to the axis of rotation.

Cryptography

[edit]
The cyclic group Z26 underlies Caesar's cipher.

Very large groups of prime order constructed in elliptic curve cryptography serve for public-key cryptography. Cryptographical methods of this kind benefit from the flexibility of the geometric objects, hence their group structures, together with the complicated structure of these groups, which make the discrete logarithm very hard to calculate. One of the earliest encryption protocols, Caesar's cipher, may also be interpreted as a (very easy) group operation. Most cryptographic schemes use groups in some way. In particular Diffie–Hellman key exchange uses finite cyclic groups. So the term group-based cryptography refers mostly to cryptographic protocols that use infinite non-abelian groups such as a braid group.

See also

[edit]

Notes

[edit]

References

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
Group theory is a fundamental branch of in that studies algebraic structures known as groups, which consist of a nonempty set equipped with a satisfying four axioms: closure, associativity, the existence of an , and the existence of inverse elements for every element in the set. These structures capture the essence of symmetry and transformations, providing a unifying framework for analyzing patterns that repeat under certain operations. The origins of group theory trace back to the early 19th century, when mathematicians like and began investigating permutations and equations, laying the groundwork for the modern concept of a group as an abstract entity. By the mid-19th century, the work of formalized the definition of a group in 1854, shifting focus from specific examples like permutation groups to general algebraic properties. This development marked a pivotal expansion, enabling the study of diverse groups beyond permutations and abelian structures to include transformation groups and beyond. Key concepts in group theory include subgroups, homomorphisms, and , which classify groups and reveal their structural similarities. The theory's importance extends far beyond , with applications in physics for modeling particle symmetries, in chemistry for molecular vibrations, in for secure systems like , and in for error-correcting codes. Group theory thus serves as a cornerstone for understanding symmetry across scientific disciplines, influencing fields from to .

Fundamentals

Definition and axioms

In mathematics, group theory formalizes the concept of by modeling collections of reversible transformations that preserve some underlying structure, such as rotations or reflections of geometric objects. These symmetries form a group under composition, providing a unified way to analyze patterns of invariance across diverse fields like , physics, and . The of a group abstracts away specific realizations to focus on the algebraic properties shared by all such symmetric operations. A group is defined as a nonempty set GG together with a binary operation :G×GG* : G \times G \to G satisfying four fundamental axioms: closure, associativity, the existence of an identity element, and the existence of inverses. This definition, introduced in the 19th century and refined over time, captures the essence of reversible operations while excluding structures that fail to maintain these properties. The closure axiom requires that for all a,bGa, b \in G, the product aba * b is also an element of GG; this ensures the operation produces results within the set, preventing "leakage" that would undermine repeated applications. Without closure, the cannot consistently model transformations on the set. For instance, the natural numbers under fail closure, as 12=11 - 2 = -1 lies outside the natural numbers, disqualifying it as a for a group. Associativity states that for all a,b,cGa, b, c \in G, (ab)c=a(bc)(a * b) * c = a * (b * c); this property guarantees that the grouping of operations does not affect the outcome, enabling unambiguous computation of longer sequences without parentheses. It is logically essential for defining powers and iterates, as non-associative operations like vector cross products would lead to inconsistencies in extended compositions. The identity axiom posits the existence of an element eGe \in G such that for every aGa \in G, ae=ea=aa * e = e * a = a; this neutral element acts as a "do-nothing" transformation, serving as a reference point for all other operations. In symmetric contexts, it corresponds to the trivial transformation that leaves everything unchanged. Finally, the invertibility axiom requires that for each aGa \in G, there exists an inverse a1Ga^{-1} \in G satisfying aa1=a1a=ea * a^{-1} = a^{-1} * a = e; this ensures every transformation can be undone, embodying the reversibility central to symmetry. Structures lacking inverses, such as the natural numbers under addition (where no element inverts 1 to reach the identity 0), cannot qualify as groups. Groups are denoted by the ordered pair (G,)(G, *), emphasizing both the set and its operation. When the operation resembles multiplication, multiplicative notation is used (with aba * b written as abab); for addition-like operations, additive notation prevails (with ++ and inverses as negatives). Groups are classified as finite if the cardinality G|G|, or order, is a finite nonnegative integer, or infinite otherwise; the order quantifies the group's size and influences its possible subgroups and representations.

Basic examples and properties

The , often denoted as {e}\{e\}, consists solely of the ee and forms the simplest example of a group under the operation where ee=ee \cdot e = e. This structure satisfies all group axioms, with ee serving as its own inverse. A fundamental infinite example is the set of integers [Z](/page/Z)\mathbb{[Z](/page/Z)} under , which forms an with $0andtheinverseofeachand the inverse of eachn \in \mathbb{Z}givenbygiven by-n.Here,additioniscommutative,so. Here, addition is commutative, so m + n = n + mforallfor allm, n \in \mathbb{Z}, and the group is generated by $1 since every integer is a multiple of $1.Anotherkeyexampleofaninfinite[abeliangroup](/page/Abeliangroup)istherealnumbers. Another key example of an infinite [abelian group](/page/Abelian_group) is the real numbers \mathbb{R} under [addition](/page/Addition), with identity $0 and inverse x-x for each xRx \in \mathbb{R}; commutativity holds as x+y=y+xx + y = y + x for all x,yRx, y \in \mathbb{R}. Finite cyclic groups provide essential finite examples. A group GG is cyclic if there exists an element gGg \in G such that every element is a power of gg, i.e., G={gkkZ}G = \{g^k \mid k \in \mathbb{Z}\}. The integers modulo nn, denoted Zn={0,1,,n1}\mathbb{Z}_n = \{0, 1, \dots, n-1\} under modulo nn, form a of order nn generated by $1, with identity $0 and inverse of kk given by nkmodnn - k \mod n. This group is abelian since (a+b)modn=(b+a)modn(a + b) \mod n = (b + a) \mod n. The order of an element gg in a group GG, denoted ord(g)\operatorname{ord}(g), is the smallest positive integer kk such that gk=eg^k = e, where ee is the identity; if no such kk exists, the order is infinite. In the trivial group, ord(e)=1\operatorname{ord}(e) = 1. In Z\mathbb{Z} under addition, every nonzero element has infinite order, while in Zn\mathbb{Z}_n, the order of kk is n/gcd(k,n)n / \gcd(k, n). Several basic properties follow directly from the group axioms. The identity element is unique: if ee and ee' both satisfy ex=x=xee \cdot x = x = x \cdot e and ex=x=xee' \cdot x = x = x \cdot e' for all xx, then e=ee = e'. To see this, substitute x=ex = e' into the first to get ee=ee \cdot e' = e', then multiply on the right by ee to obtain e=ee=ee = e' \cdot e = e'. Each element has a unique inverse: if g1g^{-1} and hh both satisfy gg1=e=g1gg \cdot g^{-1} = e = g^{-1} \cdot g and gh=e=hgg \cdot h = e = h \cdot g, then h=g1h = g^{-1}. This follows by left-multiplying gh=eg \cdot h = e by g1g^{-1} to get h=g1h = g^{-1}. Cancellation laws also hold: if ga=gbg a = g b, then a=ba = b (left cancellation), proved by right-multiplying both sides by g1g^{-1}; similarly for right cancellation. These properties hold in any group, including the examples above. Lagrange's theorem relates subgroup orders to the group order. For a finite group GG and subgroup HGH \leq G, the order G|G| equals H|H| times the index [G:H][G : H], the number of distinct left cosets gH={ghhH}gH = \{gh \mid h \in H\}. Thus, H|H| divides G|G|. This result, originally from Lagrange's 1770 work on polynomial equations, is proved by noting that the left cosets of HH partition GG (since if (g1H)(g2H)(g_1 H) \cap (g_2 H) \neq \emptyset, then g1H=g2Hg_1 H = g_2 H, by the cancellation law), and each coset has exactly H|H| elements, so G=[G:H]H|G| = [G : H] \cdot |H|. For instance, in Zn\mathbb{Z}_n, the subgroup {0}\{0\} has order $1dividingdividingn, and the whole group has index $1.

Historical Development

Early origins and geometric roots

The roots of group theory lie in ancient geometric intuitions, particularly in around 300 BCE. Euclid's Elements explored congruences of plane figures, which implicitly relied on symmetries such as rotations and reflections that preserve distances, angles, and overall shape. These operations formed the basis for understanding isometries in the plane, allowing proofs of figure equivalence without explicit algebraic formalization. In the 18th century, Leonhard Euler advanced these geometric ideas through studies of polyhedral symmetries. Euler investigated the rotational symmetries of regular polyhedra like the and , discovering that the group of rotations for each has 60 elements, an early enumeration of symmetry operations without modern group terminology. Euler's 1779 work on Latin squares, prompted by the "36 officers problem," examined orthogonal arrangements of symbols that encode multiple s simultaneously, serving as prototypes for the combinatorial structure of permutation sets. Joseph-Louis Lagrange's reflections in the 1770s further bridged and via permutations. In his 1771 paper Réflexions sur la résolution algébrique des équations, Lagrange analyzed permutations of roots to simplify resolvent equations, noting how cycles and orders of these permutations influence solvability, which foreshadowed key results like the theorem bearing his name on subgroup indices. Early explorations of solvability by radicals involved figures like Jean le Rond d'Alembert and Paolo Ruffini. D'Alembert's 1746 memoir on equation roots emphasized distinctions between real and imaginary solutions, contributing to criteria for radical expressions in lower-degree polynomials. Ruffini, in his 1799 treatise Teoria generale delle equazioni, employed permutation analysis to argue that general quintic equations resist solution by radicals, marking a pivotal intuitive step toward structural obstructions in algebra. Évariste Galois's nascent ideas in the late 1820s and early 1830s built on these foundations by focusing on permutations of roots. In his 1830 bulletin note and subsequent memoir, Galois considered substitutable permutations that preserve algebraic relations among roots, introducing rudimentary notions of groups to classify solvability conditions without fully abstracting the group concept. Galois also coined the term "group" (groupe) around this time for sets of permutations.

19th-century formalization

In the early 1830s, pioneered the use of groups as sets of to analyze the solvability of equations by radicals, laying the groundwork for modern group theory. He conceptualized the associated with a , where the structure of this group determines whether the equation can be solved using radical expressions, and introduced the notion of normal subgroups as those invariant under conjugation, which are essential for constructing solvable series in groups. Galois's insights stemmed from his efforts to extend the work on quadratic, cubic, and quartic equations, revealing that the symmetry properties captured by these groups dictate solvability conditions. Tragically, Galois died in 1832 at age 20 following a , leaving his ideas unpublished during his lifetime. Galois's manuscript was rescued and published posthumously in 1846 by in the Journal de Mathématiques Pures et Appliquées, where Liouville edited and appended his own commentary to clarify and promote the revolutionary ideas. This publication highlighted how s could classify polynomials based on their resolubility, building on the Abel-Ruffini theorem, which proved in 1824 and had anticipated earlier, demonstrating that general quintic equations (degree 5) are not solvable by radicals. Galois's group-theoretic approach provided the precise mechanism: if the of a quintic is the S5S_5, which is not solvable, then no radical solution exists, thus formalizing the impossibility in terms of group structure rather than ad hoc . Augustin-Louis Cauchy advanced the formalization in the 1840s by treating permutation groups as an independent subject. In works from 1815 and 1844–1845, Cauchy established foundational results, including what is now known as Cauchy's theorem: in a finite group whose order is divisible by a prime pp, there exists an element of order pp. These contributions shifted focus from specific algebraic problems to the intrinsic properties of permutation sets, proving results like the existence of subgroups and Lagrange's theorem in this context. Arthur Cayley further abstracted the concept in 1854 with two papers in the Philosophical Magazine, providing the first definition of a group as an abstract set with a satisfying closure, associativity, identity, and inverses—detaching it entirely from permutations. This axiomatic approach enabled broader applications beyond algebra, emphasizing groups as algebraic structures in their own right. Meanwhile, in 1872, Felix Klein's , presented in his inaugural address at the University of , proposed a unified classification of geometries by the transitive transformation groups preserving their structures, such as under the group of rigid motions or under projective transformations. Klein's framework demonstrated group theory's power in organizing geometric knowledge, influencing the field's expansion.

20th-century expansions and modern contributions

In the late 19th and early 20th centuries, William Burnside and Ferdinand Georg Frobenius laid foundational work in the representation theory of finite groups, with Burnside developing key concepts in his 1897 treatise on groups of finite order, including early explorations of representations as linear transformations. Frobenius advanced this further by introducing the theory of characters and blocks in the 1890s and 1900s, providing tools to decompose representations into irreducible components and analyze their modular behavior, which became essential for understanding finite group structures. The 1920s and 1930s saw group theory integrate deeply into , driven by and , who emphasized axiomatic approaches and non-commutative structures, unifying disparate algebraic concepts through ideals and modules in their collaborative works during this period. Concurrently, Richard Brauer pioneered in the 1930s, extending Frobenius's ideas to characteristic-p representations and developing Brauer characters to classify blocks primes, which resolved key problems in decompositions. Post-World War II developments included Claude Chevalley's systematic treatment of Lie groups in his 1946 monograph, bridging algebraic and differential structures through Chevalley groups, which generalized s of Lie type. contributed to the topological aspects of Lie groups during this era, influencing classifications via homogeneous spaces. A landmark milestone was the 1963 Feit-Thompson theorem, proving that every of odd order is solvable, which provided a crucial reduction in the ongoing . This effort culminated in 2004 with Michael Aschbacher and others completing the classification, identifying all 26 sporadic simple groups alongside Lie-type and alternating groups. The 1970s and 1980s marked the discovery of the , the largest sporadic with over 8 × 10^53 elements, constructed by Robert Griess in and embedding 20 other sporadics as subquotients. Computational group theory emerged prominently with the GAP system, initiated in 1986 at , enabling algorithmic computations of group structures, presentations, and representations for practical research. Post-2000 contributions have extended group theory to interdisciplinary applications, including quantum groups in , where Drinfeld-Jimbo quantizations model braided categories for topological quantum field theories. In , symmetries underpin orbifold compactifications and phenomena, linking sporadic groups to modular forms and entropy calculations in recent models. The have seen advances in algorithmic group solving, such as improved algorithms in systems like GAP, enhancing solvability for large s.

Examples and Classes of Groups

Permutation groups

Permutation groups arise as subgroups of the on a , providing concrete realizations of abstract group structures through bijections that rearrange elements. These groups are fundamental in group theory, as they model symmetries and transformations on discrete objects, and serve as a bridge to more general algebraic concepts./05%3A_Permutation_Groups/5.01%3A_Definitions_and_Notation) The SnS_n consists of all bijections from a set of nn elements to itself, equipped with the group operation of composition. It has order n!n!, reflecting the number of possible rearrangements of nn distinct objects. The group SnS_n is generated by the set of all transpositions, which are permutations that swap two elements and leave the rest fixed. A key subgroup of SnS_n is the alternating group AnA_n, comprising all even permutations—those that can be expressed as a product of an even number of transpositions. The alternating group has index 2 in SnS_n, so its order is n!/2n!/2, and it is a normal subgroup. For n5n \geq 5, AnA_n is simple, meaning it has no nontrivial normal subgroups, a property that underscores its importance in the classification of finite simple groups./04%3A_Families_of_Groups/4.04%3A_Alternating_Groups) Permutations in SnS_n are often represented using cycle notation, which decomposes a permutation into disjoint cycles for clarity and computational efficiency. For instance, the permutation sending 1 to 2, 2 to 3, and 3 to 1 while fixing other elements is denoted (1 2 3)(1\ 2\ 3)./05%3A_Permutation_Groups/5.01%3A_Definitions_and_Notation) In this notation, the length of a cycle determines its order under composition, and two permutations are conjugate in SnS_n they have the same cycle type—that is, the same of cycle lengths. This classification partitions SnS_n into conjugacy classes, each corresponding to a partition of nn. Cayley's theorem establishes that every finite group GG of order mm is isomorphic to a subgroup of SmS_m via the regular action, where elements of GG act as permutations on the set GG itself by left multiplication./09%3A_Isomorphisms/9.01%3A_Definition_and_Examples) This embedding highlights the universality of permutation groups, as it shows that studying symmetries of sets suffices to understand all finite groups. Concrete examples illustrate the diversity of permutation groups. The , generated by face rotations, is a subgroup of S48S_{48}, where the 48 non-center facets are labeled and permuted, subject to parity and orientation constraints that prevent it from being the full symmetric group. Permutation groups are often analyzed through their actions on sets, particularly transitive and primitive ones. A permutation group acts transitively on a set if there is only one orbit, meaning any element can be mapped to any other by some group element. An action is primitive if it is transitive and admits no nontrivial blocks—subsets of the set that are permuted as units beyond singletons or the whole set—ensuring the action is "indecomposable" in a strong sense. Primitive groups form a foundational class in the study of permutation representations, with their structure tightly constrained by theorems like the Jordan-Hölder factorization.

Matrix groups

Matrix groups form a significant class of groups in group theory, consisting of sets of invertible matrices under matrix multiplication that preserve specific structures on vector spaces. These groups arise naturally in linear algebra and provide concrete realizations of abstract group properties, often serving as examples of Lie groups when defined over the real or complex numbers. The general linear group GL(n,F)\mathrm{GL}(n, F) is defined as the group of all n×nn \times n invertible matrices with entries in a field FF, where the group operation is matrix multiplication. A matrix belongs to GL(n,F)\mathrm{GL}(n, F) if and only if its determinant is nonzero, ensuring invertibility. This group captures all linear automorphisms of an nn-dimensional vector space over FF. The SL(n,F)\mathrm{SL}(n, F) is the kernel of the from GL(n,F)\mathrm{GL}(n, F) to the F×F^\times, consisting precisely of those matrices in GL(n,F)\mathrm{GL}(n, F) with equal to 1. It forms a of GL(n,F)\mathrm{GL}(n, F) and is generated by elementary matrices for n2n \geq 2. Classical matrix groups include the O(nO(n, which comprises n×nn \times n real matrices QQ satisfying QTQ=InQ^T Q = I_n, preserving the standard Euclidean inner product. The special orthogonal group SO(n)SO(n) is the subgroup of O(n)O(n) with determinant 1. Similarly, the U(n)U(n) consists of n×nn \times n complex matrices UU such that UU=InU^* U = I_n, where UU^* is the , preserving the Hermitian inner product. The SU(n)SU(n) requires 1. The Sp(2n,F)\mathrm{Sp}(2n, F) preserves a nondegenerate alternating , represented by 2n×2n2n \times 2n matrices MM over FF satisfying MTJM=JM^T J M = J, where JJ is the standard . Over the real or complex fields, these groups possess a Lie group structure, being closed subgroups of GL(n,R)\mathrm{GL}(n, \mathbb{R}) or GL(n,C)\mathrm{GL}(n, \mathbb{C}) that are smooth manifolds. For instance, SO(3)SO(3) is the Lie group of rotations in three-dimensional Euclidean space, diffeomorphic to the real projective space RP3\mathbb{RP}^3. An important example is the Heisenberg group, realized as the group of 3×33 \times 3 upper triangular matrices over R\mathbb{R} with ones on the diagonal: (1xz01y001),x,y,zR.\begin{pmatrix} 1 & x & z \\ 0 & 1 & y \\ 0 & 0 & 1 \end{pmatrix}, \quad x, y, z \in \mathbb{R}.
Add your contribution
Related Hubs
User Avatar
No comments yet.