Diving into Group Theory: Foundations for Equivariant Neural Networks

Diving into Group Theory: Foundations for Equivariant Neural Networks

What is a Group?

A group is an algebraic structure consisting of a set of elements and a binary operation that combines any two elements to form a third element. Let's say we have a set of elements GG and a binary operation "..", then we can say that (G,.)(G, .) is a group if the following properties are satisfied:

  1. Closure: The closure property states that for any two elements g1,g2Gg_1, g_2 \in G, the result of the binary operation g1.g2g_1 . g_2 is also an element of GG. In other words, the binary operation ".." is closed under the set GG. Mathematically, we can write this as:
g1,g2G,g1.g2=g3G\forall g_1, g_2 \in G, g_1 . g_2 = g_3 \in G
  1. Associativity: The binary operation ".." is associative if for any three elements g1,g2,g3Gg_1, g_2, g_3 \in G, the following holds true:
(g1.g2).g3=g1.(g2.g3)(g_1 . g_2) . g_3 = g_1 . (g_2 . g_3)
  1. Identity: There exists an element eGe \in G such that for any element gGg \in G, the following holds true:
e.g=g.e=ge . g = g . e = g
  1. Inverse: For any element gGg \in G, there exists an unique element g1Gg^{-1} \in G such that the following holds true:
g.g1=g1.g=eg . g^{-1} = g^{-1} . g = e

A group is said to be abelian if the binary operation ".." is commutative. In other words, for any two elements g1,g2Gg_1, g_2 \in G, the following holds true:

g1.g2=g2.g1g_1 . g_2 = g_2 . g_1

Now, as we have a basic understanding of what a group is, let's look at some examples of groups.

Examples of Groups

  1. Integers under addition: The set of integers Z\mathbb{Z} under addition is a group. The closure property is satisfied as the sum of any two integers is also an integer. The associativity property is also satisfied as the addition of integers is associative. The identity element is 00 as 0+n=n+0=n0 + n = n + 0 = n for any integer nn. The inverse of an integer nn is n-n as n+(n)=(n)+n=0n + (-n) = (-n) + n = 0.

  2. Integers modulo nn under addition (Z/nZ,+)(\mathbb{Z}/n\mathbb{Z}, +): The set of integers modulo nn under addition is a group. The closure property is satisfied as the sum of any two integers modulo nn is also an integer modulo nn. The associativity property is also satisfied as the addition of integers modulo nn is associative. The identity element is 00 as 0+n=n+0=n0 + n = n + 0 = n for any integer modulo nn. The inverse of an integer modulo nn is n-n as n+(n)=(n)+n=0n + (-n) = (-n) + n = 0.

  3. Vectors under addition (Rn,+)(\mathbb{R}^n, +): Every vector space is a group under addition. The closure property is satisfied as the sum of any two vectors is also a vector. The associativity property is also satisfied as the addition of vectors is associative. The identity element is the zero vector as 0+v=v+0=v\mathbf{0} + \mathbf{v} = \mathbf{v} + \mathbf{0} = \mathbf{v} for any vector v\mathbf{v}. The inverse of a vector v\mathbf{v} is v-\mathbf{v} as v+(v)=(v)+v=0\mathbf{v} + (-\mathbf{v}) = (-\mathbf{v}) + \mathbf{v} = \mathbf{0}.

Order of a Group

The order of a group is the number of elements in the group. The order of a group GG is denoted by G|G|. For example, the order of the group (Z/nZ,+)(\mathbb{Z}/n\mathbb{Z}, +) is nn.

Order of an Element

The order of an element gg of a group GG is the smallest positive integer nn such that gn=eg^n = e, where ee is the identity element of the group GG. The order of an element gg is denoted by g|g|. For example, the order of the element 11 in the group (Z/nZ,+)(\mathbb{Z}/n\mathbb{Z}, +) is nn. Confused? Let's break it down.

Let's say we have the set {0, 1, 2, \dots, n-1} and we want to find the order of the element 1. We know that the identity element of the group (Z/nZ,+)(\mathbb{Z}/n\mathbb{Z}, +) is 0. So, we need to find the smallest positive integer nn such that 1n=01^n = 0. Let's try to find the order of the element 1 for n=5n = 5.



Mir Sazzat Hossain is a Research Assistant at the Independent University of Bangladesh's Center for Computation and Data Science (CCDS).

Comments

Do you have a problem, want to share feedback, or discuss further ideas? Feel free to leave a comment here! Please stick to English. This comment thread directly maps to a discussion on GitHub, so you can also comment there if you prefer.

Instead of authenticating the giscus application, you can also comment directly on GitHub.

Related Articles

The Poisson Distribution: Your Key to Predicting the Unforeseeable

The blog post explores the Poisson distribution, a statistical distribution commonly used in various fields, including astronomy, to model random events. It explains the properties of the distribution, its real-world applications, and provides a step-by-step guide on how to visualize the Poisson distribution using Python. The post also discusses the issue of Poisson noise in astronomical observations and presents a practical example of how to calculate and deal with it using Python.