Lattice of subgroupsIn mathematics, the lattice of subgroups of a group is the lattice whose elements are the subgroups of , with the partial order relation being set inclusion. In this lattice, the join of two subgroups is the subgroup generated by their union, and the meet of two subgroups is their intersection. The dihedral group Dih4 has ten subgroups, counting itself and the trivial subgroup. Five of the eight group elements generate subgroups of order two, and the other two non-identity elements both generate the same cyclic subgroup of order four.
Congruence subgroupIn mathematics, a congruence subgroup of a matrix group with integer entries is a subgroup defined by congruence conditions on the entries. A very simple example would be invertible 2 × 2 integer matrices of determinant 1, in which the off-diagonal entries are even. More generally, the notion of congruence subgroup can be defined for arithmetic subgroups of algebraic groups; that is, those for which we have a notion of 'integral structure' and can define reduction maps modulo an integer.
Profinite groupIn mathematics, a profinite group is a topological group that is in a certain sense assembled from a system of finite groups. The idea of using a profinite group is to provide a "uniform", or "synoptic", view of an entire system of finite groups. Properties of the profinite group are generally speaking uniform properties of the system. For example, the profinite group is finitely generated (as a topological group) if and only if there exists such that every group in the system can be generated by elements.
Lattice (discrete subgroup)In Lie theory and related areas of mathematics, a lattice in a locally compact group is a discrete subgroup with the property that the quotient space has finite invariant measure. In the special case of subgroups of Rn, this amounts to the usual geometric notion of a lattice as a periodic subset of points, and both the algebraic structure of lattices and the geometry of the space of all lattices are relatively well understood. The theory is particularly rich for lattices in semisimple Lie groups or more generally in semisimple algebraic groups over local fields.
Commutator subgroupIn mathematics, more specifically in abstract algebra, the commutator subgroup or derived subgroup of a group is the subgroup generated by all the commutators of the group. The commutator subgroup is important because it is the smallest normal subgroup such that the quotient group of the original group by this subgroup is abelian. In other words, is abelian if and only if contains the commutator subgroup of . So in some sense it provides a measure of how far the group is from being abelian; the larger the commutator subgroup is, the "less abelian" the group is.
Normal subgroupIn abstract algebra, a normal subgroup (also known as an invariant subgroup or self-conjugate subgroup) is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup of the group is normal in if and only if for all and The usual notation for this relation is Normal subgroups are important because they (and only they) can be used to construct quotient groups of the given group.
Finitely generated groupIn algebra, a finitely generated group is a group G that has some finite generating set S so that every element of G can be written as the combination (under the group operation) of finitely many elements of S and of inverses of such elements. By definition, every finite group is finitely generated, since S can be taken to be G itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated.
Free groupIn mathematics, the free group FS 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−1t, but s ≠ t−1 for s,t,u ∈ S). The members of S are called generators of FS, and the number of generators is the rank of the free group. An arbitrary group G is called free if it is isomorphic to FS for some subset S of G, that is, if there is a subset S of G such that every element of G can be written in exactly one way as a product of finitely many elements of S and their inverses (disregarding trivial variations such as st = suu−1t).
Arithmetic groupIn mathematics, an arithmetic group is a group obtained as the integer points of an algebraic group, for example They arise naturally in the study of arithmetic properties of quadratic forms and other classical topics in number theory. They also give rise to very interesting examples of Riemannian manifolds and hence are objects of interest in differential geometry and topology. Finally, these two topics join in the theory of automorphic forms which is fundamental in modern number theory.
Free productIn mathematics, specifically group theory, the free product is an operation that takes two groups G and H and constructs a new group G ∗ H. The result contains both G and H as subgroups, is generated by the elements of these subgroups, and is the “universal” group having these properties, in the sense that any two homomorphisms from G and H into a group K factor uniquely through a homomorphism from G ∗ H to K. Unless one of the groups G and H is trivial, the free product is always infinite.
Abelian groupIn 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 commutative. With addition as an operation, the integers and the real numbers form abelian groups, and the concept of an abelian group may be viewed as a generalization of these examples. Abelian groups are named after early 19th century mathematician Niels Henrik Abel.
Word (group theory)In group theory, a word is any written product of group elements and their inverses. For example, if x, y and z are elements of a group G, then xy, z−1xzz and y−1zxx−1yz−1 are words in the set {x, y, z}. Two different words may evaluate to the same value in G, or even in every group. Words play an important role in the theory of free groups and presentations, and are central objects of study in combinatorial group theory. Let G be a group, and let S be a subset of G. A word in S is any expression of the form where s1,.
Core (group theory)In group theory, a branch of mathematics, a core is any of certain special normal subgroups of a group. The two most common types are the normal core of a subgroup and the p-core of a group. For a group G, the normal core or normal interior of a subgroup H is the largest normal subgroup of G that is contained in H (or equivalently, the intersection of the conjugates of H). More generally, the core of H with respect to a subset S ⊆ G is the intersection of the conjugates of H under S, i.e.
Free abelian groupIn mathematics, a free abelian group is an abelian group with a basis. Being an abelian group means that it is a set with an addition operation that is associative, commutative, and invertible. A basis, also called an integral basis, is a subset such that every element of the group can be uniquely expressed as an integer combination of finitely many basis elements. For instance the two-dimensional integer lattice forms a free abelian group, with coordinatewise addition as its operation, and with the two points (1,0) and (0,1) as its basis.
Homogeneous polynomialIn mathematics, a homogeneous polynomial, sometimes called quantic in older texts, is a polynomial whose nonzero terms all have the same degree. For example, is a homogeneous polynomial of degree 5, in two variables; the sum of the exponents in each term is always 5. The polynomial is not homogeneous, because the sum of exponents does not match from term to term. The function defined by a homogeneous polynomial is always a homogeneous function. An algebraic form, or simply form, is a function defined by a homogeneous polynomial.
Complete latticeIn mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a conditionally complete lattice. Specifically, every non-empty finite lattice is complete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra.
SemigroupIn mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively (just notation, not necessarily the elementary arithmetic multiplication): x·y, or simply xy, denotes the result of applying the semigroup operation to the ordered pair (x, y). Associativity is formally expressed as that (x·y)·z = x·(y·z) for all x, y and z in the semigroup.
Modular groupIn mathematics, the modular group is the projective special linear group of 2 × 2 matrices with integer coefficients and determinant 1. The matrices A and −A are identified. The modular group acts on the upper-half of the complex plane by fractional linear transformations, and the name "modular group" comes from the relation to moduli spaces and not from modular arithmetic. The modular group Γ is the group of linear fractional transformations of the upper half of the complex plane, which have the form where a, b, c, d are integers, and ad − bc = 1.
Quotient groupA quotient group or factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure (the rest of the structure is "factored" out). For example, the cyclic group of addition modulo n can be obtained from the group of integers under addition by identifying elements that differ by a multiple of and defining a group structure that operates on each such class (known as a congruence class) as a single entity.
Homogeneous spaceIn mathematics, a homogeneous space is, very informally, a space that looks the same everywhere, as you move through it, with movement given by the action of a group. Homogeneous spaces occur in the theories of Lie groups, algebraic groups and topological groups. More precisely, a homogeneous space for a group G is a non-empty manifold or topological space X on which G acts transitively. The elements of G are called the symmetries of X.
