Skip to main content

Normal Subgroup {Algebra} (B.Sc. Mathematics NEP Notes)

 NNormal Subgroup


Normal Subgroup

    Let G be a group, and H be a subgroup of G. Then subgroup H is set to be normal subgroup of G if for any element g in & h in H s.t.

 ghg−1 Є H

 

Simple Group

    A simple group is a type of group in abstract algebra that has no non-trivial normal subgroups. In other words, a group G is simple if the only normal subgroups of G are the trivial subgroup {e} and the whole group G itself.

 

Hamiltonian Group

A non-abelian group in which each sub-Group is normal.


Conjugate Element

    In group theory, given a group G and elements a, b in G the element b is said to be conjugate to "a" if there exists an element g in G such that, b=gag −1

The process of finding such a g is called conjugation.


Normalizer of an element

    The normalizer of an element a in a group G, denoted as N(a), is defined as the set of all elements in G that, which commutes with a. The normalizer is given by:

N​(a)={gG ga=ag}

 

Centralizer

Let A be a non-empty subset of a group G. The centralizer C(A) of A, in G is defined as:

C(A) = {xєG: ax=xa  a є A}


Conjugate Class

    In group theory, elements that are conjugate to each other form a conjugacy class. Given a group G and an element a in G, the conjugacy class of a, denoted as Cl(a), is the set of all elements in G that are conjugate to a.

Cl(a)={gag−1gG}.

 

Self-Conjugate

    An element a in a group is said to be self-conjugate if gag−1=a for all g in the group. In other words, the conjugacy class of a consists only of a itself. 

a is self-conjugate if {gag−1∣∈G} ={a}.


Conjugate Subgroup

    Let H be a subgroup of a group G. A subgroup K of G is said to be conjugate to H if there exists an element g in G such that K=gHg−1. In other words, K is conjugate to H if K is obtained by conjugating H by an element of G. K is conjugate to H if K={ghg−1∣ℎ∈H} for some g in G.

Quotient Group (Factor Group)

    Suppose N is a normal subgroup of G. The quotient group, denoted as G/N, is formed by partitioning the elements of G into cosets of N and defining a group operation on these cosets.

The elements of G/N are the left cosets of N in G, denoted as gN, where g is any element in G. The group operation is defined by (g1​N) (g2​N) =(g1​g2​) N.

Mathematically, the quotient group G/N is defined as follows:

G/N={gN  g G}

 

Popular posts from this blog

Group {Algebra} (B.Sc. Mathematics NEP Notes)

Group Semi group A semigroup is an algebraic structure consisting of a non-empty set equipped with a binary operation (an operation that takes two elements from the set and produces another element in the set) that is associative. In other words, for all elements a, b, and c in the set, the operation satisfies the associative property: (a * b) * c = a * (b * c) In a semigroup, there is no requirement for an identity element or inverses, as is the case in groups. Quasi group Let G be any non-empty set and * is a binary operation than the structure is called Groupoid or quasi group if the binary operation in the set G satisfy the commutative property. a*b = b*a A groupoid with identity element is called Loop. Monoid A monoid is an algebraic structure that consists of a non-empty set, a binary operation A monoid is defined by the following Properties: Associativity:  The binary operation is associative, meaning that for all elements a, b, and c in the set M, the...

Set, relation and function {Algebra} (B.Sc. Mathematics NEP Notes)

Sets, Relation and Functions Sets   A  set  is a well-defined collection of distinct objects or elements. These objects  can be anything: numbers, letters, symbols, or even other sets. The key characteristics of a set are: Distinct Elements: Each element in a set is unique, meaning that no two elements in the set are the same. If an element appears more than once, it is still counted only once in the set. Well-Defined: A set must have clear and unambiguous criteria for determining whether an element belongs to it or not. This means you should be able to determine whether any given object is a member of the set or not without any ambiguity. Unordered: Sets are generally considered unordered collections, which means that the elements in a set do not have a specific order. The order in which you list the elements of a set does not affect the set itself. Sets are typically represented using curly braces {} and a list of their elements. For example , here is a set cont...

Direct and indirect speech tricks and shortcuts.

  Hello, today i will give you some shortcut and tricks about the direct and indirect speed so lets start. STEP 1: Direct speech and its part: STEP 2: Learn by using some examples:  STEP 3: Some general rules:   STEP 4: Some important word transformation:  STEP 5: Explanation by examples:  STEP 6: Some important key points: STEP 7: Examples with some words transformation:     STEP 8: Special case: STEP 9: Transformation of different kinds of sentence: STEP 10: Some final examples: 😄