Quotient group | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

A 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. It is part of the mathematical field known as group theory. For a congruence relation on a group, the equivalence class of the identity element is always a normal subgroup of the original group, and the other equivalence classes are precisely the cosets of that normal subgroup. The resulting quotient is written , where is the original group and is the normal subgroup. (This is pronounced , where is short for modulo.) Much of the importance of quotient groups is derived from their relation to homomorphisms. The first isomorphism theorem states that the of any group G under a homomorphism is always isomorphic to a quotient of . Specifically, the image of under a homomorphism is isomorphic to where denotes the kernel of . The dual notion of a quotient group is a subgroup, these being the two primary ways of forming a smaller group from a larger one. Any normal subgroup has a corresponding quotient group, formed from the larger group by eliminating the distinction between elements of the subgroup. In , quotient groups are examples of quotient objects, which are to subobjects. Given a group and a subgroup , and a fixed element , one can consider the corresponding left coset: . Cosets are a natural class of subsets of a group; for example consider the abelian group G of integers, with operation defined by the usual addition, and the subgroup of even integers. Then there are exactly two cosets: , which are the even integers, and , which are the odd integers (here we are using additive notation for the binary operation instead of multiplicative notation).

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (30)

Related people (28)

Related units (9)

Related concepts (17)

Related courses (14)

MATH-225: Topology

On étudie des notions de topologie générale: unions et quotients d'espaces topologiques; on approfondit les notions de revêtements et de groupe fondamental,et d'attachements de cellules et on démontre

MATH-310: Algebra

This is an introduction to modern algebra: groups, rings and fields.

COM-102: Advanced information, computation, communication II

Text, sound, and images are examples of information sources stored in our computers and/or communicated over the Internet. How do we measure, compress, and protect the informatin they contain?

Related lectures (62)

Related MOOCs (1)

MATH-225: Topology

MATH-310: Algebra

This is an introduction to modern algebra: groups, rings and fields.

COM-102: Advanced information, computation, communication II

Text, sound, and images are examples of information sources stored in our computers and/or communicated over the Internet. How do we measure, compress, and protect the informatin they contain?

Introduction to optimization on smooth manifolds: first order methods

Learn to optimize on smooth, nonlinear spaces: Join us to build your foundations (starting at "what is a manifold?") and confidently implement your first algorithm (Riemannian gradient descent).

Group (mathematics)

In mathematics, a group is a non-empty set with an operation that satisfies the following constraints: the operation is associative, has an identity element, and every element of the set has an inverse element. Many mathematical structures are groups endowed with other properties. For example, the integers with the addition operation is an infinite group, which is generated by a single element called 1 (these properties characterize the integers in a unique way).

Normal subgroup

In 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.

Equivalence class

In mathematics, when the elements of some set have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set into equivalence classes. These equivalence classes are constructed so that elements and belong to the same equivalence class if, and only if, they are equivalent. Formally, given a set and an equivalence relation on the of an element in denoted by is the set of elements which are equivalent to It may be proven, from the defining properties of equivalence relations, that the equivalence classes form a partition of This partition—the set of equivalence classes—is sometimes called the quotient set or the quotient space of by and is denoted by .

Group Theory: Quotients of Group MATH-211: Group Theory

Covers normal subgroups, quotient groups, homomorphisms, and the categorical viewpoint in group theory.

Group Homomorphisms: Kernels, Images, and Normal Subgroups MATH-310: Algebra

Explores group homomorphisms, kernels, images, and normal subgroups, using the dihedral group D_n as an example.

Applications of Lagrange's Theorem MATH-310: Algebra

Explores the applications of Lagrange's theorem in algebra, covering corollaries, cyclic groups, and quotient groups.

A new elementary proof of the Prime Number Theorem

Florian Karl Richter

Let

\Omega(n)

denote the number of prime factors of

n

. We show that for any bounded

f\colon\mathbb{N}\to\mathbb{C}

one has [ \frac{1}{N}\sum_{n=1}^N, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1). ] This yields a ...

2021

Multiple ergodic averages along functions from a Hardy field: convergence, recurrence and combinatorial applications

Florian Karl Richter

We obtain new results pertaining to convergence and recurrence of multiple ergodic averages along functions from a Hardy field. Among other things, we confirm some of the conjectures posed by Frantzikinakis in [Fra10; Fra16] and obtain combinatorial applic ...

2020

Multiplicative combinatorial properties of return time sets in minimal dynamical systems

Florian Karl Richter

We investigate the relationship between the dynamical properties of minimal topological dynamical systems and the multiplicative combinatorial properties of return time sets arising from those systems. In particular, we prove t ...

2019