Group Theory and Symmetries

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/39

flashcard set

Earn XP

Description and Tags

Flashcards covering core group theory concepts including group definitions, subgroups, orders, standard group examples, and dihedral groups based on the lecture notes.

Last updated 5:22 AM on 10/2/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

40 Terms

1
New cards

Binary Operation

A function āˆ—:XƗX→X*: X \times X \rightarrow X mapping (a,b)↦aāˆ—b(a, b) \mapsto a * b on a set XX, requiring XX to be closed under āˆ—*.

2
New cards

Group

A set GG equipped with a binary operation ā‹…\cdot, denoted (G,ā‹…)(G, \cdot), that satisfies associativity, contains an identity element ee, and contains an inverse aāˆ’1a^{-1} for every element a∈Ga \in G.

3
New cards

Abelian Group

A group (G,ā‹…)(G, \cdot) whose operation is commutative, satisfying ab=baa b = b a for all a,b∈Ga, b \in G.

4
New cards

Dihedral Group (DnD_n)

The group of symmetries of a regular nn-sided polygon, consisting of nn rotations and nn reflections, with a total of 2n2n elements.

5
New cards

Order of a Group

The total number of elements contained in a group GG, denoted by ∣G∣|G|.

6
New cards

Order of an Element

The smallest positive integer nn such that an=ea^n = e for an element a∈Ga \in G, denoted by ∣a∣|a|; if no such integer exists, the element has infinite order.

7
New cards

Subgroup

A subset HH of a group (G,ā‹…)(G, \cdot) that itself forms a group under the same binary operation, denoted H≤GH \le G.

8
New cards

Proper Subgroup

A subgroup HH of a group GG such that H≠GH \neq G, denoted by H<GH < G.

9
New cards

Trivial Subgroup

The subgroup of a group GG consisting solely of the identity element, denoted {e}\{e\}.

10
New cards

Subgroup Test Theorem

A theorem stating that a non-empty subset HāŠ†GH \subseteq G is a subgroup of GG if and only if abāˆ’1∈Ha b^{-1} \in H for all a,b∈Ha, b \in H.

11
New cards

General Linear Group (GLn(R)GL_n(\mathbb{R}))

The set of all nƗnn \times n invertible matrices with real entries, which forms a non-abelian group under matrix multiplication.

12
New cards

Division Algorithm

The theorem stating that given integers aa and n>0n > 0, there exist unique integers qq and rr such that a=nq+ra = n q + r with 0≤r<n0 \le r < n.

13
New cards

Set of Integers Modulo nn (Zn\mathbb{Z}_n)

The set {0,1,2,…,nāˆ’1}\{0, 1, 2, \dots, n-1\} representing all possible remainders when dividing an integer by nn, forming a group under addition modulo nn.

14
New cards

Invertible Elements Modulo nn (UnU_n)

The set of elements in Zn\mathbb{Z}_n that are relatively prime to nn, forming a group under multiplication modulo nn.

15
New cards

Uniqueness of Identity

A group proposition stating that if e1e_1 and e2e_2 are both identity elements in a group GG, then e1=e2e_1 = e_2.

16
New cards

Left and Right Cancellation Laws

Group properties where ab=aca b = a c implies b=cb = c (left cancellation) and ac=bca c = b c implies a=ba = b (right cancellation) for all a,b,c∈Ga, b, c \in G.

17
New cards

Dihedral Group Algebraic Rules

The governing relations for DnD_n given by Rn=eR^n = e, F2=eF^2 = e, and FRāˆ’1=RFF R^{-1} = R F, where RR represents a rotation and FF represents a reflection.

18
New cards

Product Subgroup (HKHK)

For an abelian group GG with subgroups HH and KK, the set HK={hk∣h∈H,k∈K}HK = \{h k \mid h \in H, k \in K\}, which is also a subgroup of GG.

19
New cards

Binary Operation

A function āˆ—:XƗX→X*: X \times X \rightarrow X mapping (a,b)→aāˆ—b(a, b) \rightarrow a * b, requiring that the set XX is closed under the operation.

20
New cards

Group

A set GG equipped with a binary operation Ɨ\times, denoted (G,Ɨ)(G, \times), satisfying associativity ((ab)c=a(bc)(ab)c = a(bc)), identity (≠eƗG\neq e \times G such that aƗe=a=eƗaa \times e = a = e \times a), and inverses (for each aƗGa \times G, ≠bƗG\neq b \times G such that ab=e=baab = e = ba).

21
New cards

Abelian Group

A group (G,Ɨ)(G, \times) that satisfies the commutative property, where ab=baab = ba for all a,bƗGa, b \times G.

22
New cards

Identity Uniqueness

The proposition stating that the identity element in a group GG is unique, proved by showing that if e1e_1 and e2e_2 are both identity elements, then e1=e1e2=e2e_1 = e_1 e_2 = e_2.

23
New cards

Cancellation Laws

Properties in a group stating that left cancellation (ab=ac→b=cab = ac \rightarrow b = c) and right cancellation (ac=bc→a=bac = bc \rightarrow a = b) hold for all a,b,cƗGa, b, c \times G.

24
New cards

Inverse Uniqueness

The proposition stating that for any element aƗGa \times G in a group, its inverse is unique, denoted aāˆ’1a^{-1} (or āˆ’a-a in additive notation).

25
New cards

Division Algorithm

Given integers aa and n>0n > 0, there exist unique integers qq and rr such that a=nq+ra = nq + r with 0Ɨr<n0 \times r < n, where rr is the remainder when dividing aa by nn.

26
New cards

Congruence Modulo nn

The relation aƗbƗmodĀ na \times b \times \text{mod } n, defined as nn divides aāˆ’ba - b, meaning aa and bb share the same remainder when divided by nn.

27
New cards

The Group Ɨn\times_n

The set of possible remainders modulo nn, Ɨn=Ɨ0,1,2,Ɨ,nāˆ’1Ɨ\times_n = \times 0, 1, 2, \times, n-1 \times, which forms an abelian group under addition modulo nn with identity 00 and inverse nāˆ’an - a for element aa.

28
New cards

The Group UnU_n

The set of invertible elements in Ɨn\times_n under multiplication modulo nn, consisting of elements in Ɨn\times_n that are relatively prime to nn.

29
New cards

General Linear Group GLn(Ɨ)GL_n(\times)

The non-abelian group under matrix multiplication consisting of all nƗnn \times n invertible matrices with real entries.

30
New cards

Composition of Functions

An associative binary operation on functions f,g,h:Y→Yf, g, h: Y \rightarrow Y, satisfying ((hƗg)Ɨf)(x)=h(g(f(x)))=(hƗ(gƗf))(x)((h \times g) \times f)(x) = h(g(f(x))) = (h \times (g \times f))(x).

31
New cards

Dihedral Group DnD_n

The group of symmetries of a regular nn-sided polygon, containing nn rotations and nn reflections for a total of 2n2n elements.

32
New cards

Algebraic Rules of DnD_n

The defining relations for the dihedral group generated by rotation RR and reflection FF: Rn=eR^n = e, F2=eF^2 = e, (RF)2=e(RF)^2 = e, and FRāˆ’1=RFFR^{-1} = RF.

33
New cards

Order of a Group

The total number of elements in a group GG, denoted ∣G∣|G|.

34
New cards

Order of an Element

The smallest positive integer nn such that an=ea^n = e for an element aƗGa \times G, denoted ∣a∣|a|; if no such positive integer exists, aa has infinite order.

35
New cards

Subgroup

A subset HH of a group (G,Ɨ)(G, \times), denoted HƗGH \times G, that is itself a group under the binary operation Ɨ\times.

36
New cards

Proper Subgroup

A subgroup HH of GG, denoted H<GH < G, such that HƗGH \times G and H≠GH \neq G.

37
New cards

Trivial Subgroup

The subgroup ƗeƗ\times e \times of a group GG, consisting solely of the identity element.

38
New cards

Subgroup Test

A theorem stating that a nonempty subset HƗGH \times G is a subgroup of GG if and only if abāˆ’1ƗHab^{-1} \times H for every a,bƗHa, b \times H.

39
New cards

Product of Subgroups HKHK

For an abelian group GG with subgroups HH and KK, the set HK=ƗhkƗhƗH,kƗKƗHK = \times hk \times h \times H, k \times K \times, which is also a subgroup of GG.

40
New cards

Finite Order Subgroup

In an abelian group GG, the set H=ƗaƗGĆ—āˆ£a∣ isĀ finiteƗH = \times a \times G \times |a| \text{ is finite} \times consisting of all elements of finite order, which forms a subgroup of GG.