In mathematics, a topological group G is called a discrete group if there is no limit point in it (i.e., for each element in G, there is a neighborhood which only contains that element). Equivalently, the group G is discrete if and only if its identity is isolated. A subgroup H of a topological group G is a discrete subgroup if H is discrete when endowed with the subspace topology from G. In other words there is a neighbourhood of the identity in G containing no other element of H. For example, the integers, Z, form a discrete subgroup of the reals, R (with the standard metric topology), but the rational numbers, Q, do not. Any group can be endowed with the discrete topology, making it a discrete topological group. Since every map from a discrete space is continuous, the topological homomorphisms between discrete groups are exactly the group homomorphisms between the underlying groups. Hence, there is an isomorphism between the and the category of discrete groups. Discrete groups can therefore be identified with their underlying (non-topological) groups. There are some occasions when a topological group or Lie group is usefully endowed with the discrete topology, 'against nature'. This happens for example in the theory of the Bohr compactification, and in group cohomology theory of Lie groups. A discrete isometry group is an isometry group such that for every point of the metric space the set of images of the point under the isometries is a discrete set. A discrete symmetry group is a symmetry group that is a discrete isometry group. Since topological groups are homogeneous, one need only look at a single point to determine if the topological group is discrete. In particular, a topological group is discrete only if the singleton containing the identity is an open set. A discrete group is the same thing as a zero-dimensional Lie group (uncountable discrete groups are not second-countable, so authors who require Lie groups to satisfy this axiom do not regard these groups as Lie groups).

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 courses (6)
MATH-410: Riemann surfaces
This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex
ME-372: Finite element method
L'étudiant acquiert une initiation théorique à la méthode des éléments finis qui constitue la technique la plus courante pour la résolution de problèmes elliptiques en mécanique. Il apprend à applique
COM-406: Foundations of Data Science
We discuss a set of topics that are important for the understanding of modern data science but that are typically not taught in an introductory ML course. In particular we discuss fundamental ideas an
Show more
Related lectures (35)
Monster Group: Representation
Explores the Monster group, a sporadic simple group with a unique representation theory.
Open Mapping Theorem
Explains the Open Mapping Theorem for holomorphic maps between Riemann surfaces.
Generalization Error
Discusses mutual information, data processing inequality, and properties related to leakage in discrete systems.
Show more
Related publications (41)

A type I conjecture and boundary representations of hyperbolic groups

Nicolas Monod

We establish new results on the weak containment of quasi-regular and Koopman representations of a second countable locally compact group GGG associated with nonsingular GGG-spaces. We deduce that any two boundary representations of a hyperbolic locally ...
WILEY2023

Multiplicative chaos of the Brownian loop soup

Antoine Pierre François Jego, Titus Lupu

We construct a measure on the thick points of a Brownian loop soup in a bounded domain DDD of the plane with given intensity theta>0θ>0\theta >0, which is formally obtained by exponentiating the square root of its occupation field. The measure is construct ...
WILEY2023

An adaptive space-time algorithm for the incompressible Navier-Stokes equations

Marco Picasso, Samuel Dubuis

A space-time adaptive algorithm is presented to solve the incompressible Navier-Stokes equations. Time discretization is performed with the BDF2 method while continuous, piecewise linear anisotropic finite elements are used for the space discretization. Th ...
San Diego2023
Show more
Related people (1)
Related concepts (22)
Fuchsian group
In mathematics, a Fuchsian group is a discrete subgroup of PSL(2,R). The group PSL(2,R) can be regarded equivalently as a group of orientation-preserving isometries of the hyperbolic plane, or conformal transformations of the unit disc, or conformal transformations of the upper half plane, so a Fuchsian group can be regarded as a group acting on any of these spaces.
Locally compact group
In mathematics, a locally compact group is a topological group G for which the underlying topology is locally compact and Hausdorff. Locally compact groups are important because many examples of groups that arise throughout mathematics are locally compact and such groups have a natural measure called the Haar measure. This allows one to define integrals of Borel measurable functions on G so that standard analysis notions such as the Fourier transform and spaces can be generalized.
Hyperbolic space
In mathematics, hyperbolic space of dimension n is the unique simply connected, n-dimensional Riemannian manifold of constant sectional curvature equal to -1. It is homogeneous, and satisfies the stronger property of being a symmetric space. There are many ways to construct it as an open subset of with an explicitly written Riemannian metric; such constructions are referred to as models. Hyperbolic 2-space, H2, which was the first instance studied, is also called the hyperbolic plane.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.