1/39
Flashcards covering core group theory concepts including group definitions, subgroups, orders, standard group examples, and dihedral groups based on the lecture notes.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
Binary Operation
A function ā:XĆXāX mapping (a,b)ā¦aāb on a set X, requiring X to be closed under ā.
Group
A set G equipped with a binary operation ā , denoted (G,ā ), that satisfies associativity, contains an identity element e, and contains an inverse aā1 for every element aāG.
Abelian Group
A group (G,ā ) whose operation is commutative, satisfying ab=ba for all a,bāG.
Dihedral Group (Dnā)
The group of symmetries of a regular n-sided polygon, consisting of n rotations and n reflections, with a total of 2n elements.
Order of a Group
The total number of elements contained in a group G, denoted by ā£Gā£.
Order of an Element
The smallest positive integer n such that an=e for an element aāG, denoted by ā£aā£; if no such integer exists, the element has infinite order.
Subgroup
A subset H of a group (G,ā ) that itself forms a group under the same binary operation, denoted Hā¤G.
Proper Subgroup
A subgroup H of a group G such that Hī =G, denoted by H<G.
Trivial Subgroup
The subgroup of a group G consisting solely of the identity element, denoted {e}.
Subgroup Test Theorem
A theorem stating that a non-empty subset HāG is a subgroup of G if and only if abā1āH for all a,bāH.
General Linear Group (GLnā(R))
The set of all nĆn invertible matrices with real entries, which forms a non-abelian group under matrix multiplication.
Division Algorithm
The theorem stating that given integers a and n>0, there exist unique integers q and r such that a=nq+r with 0ā¤r<n.
Set of Integers Modulo n (Znā)
The set {0,1,2,ā¦,nā1} representing all possible remainders when dividing an integer by n, forming a group under addition modulo n.
Invertible Elements Modulo n (Unā)
The set of elements in Znā that are relatively prime to n, forming a group under multiplication modulo n.
Uniqueness of Identity
A group proposition stating that if e1ā and e2ā are both identity elements in a group G, then e1ā=e2ā.
Left and Right Cancellation Laws
Group properties where ab=ac implies b=c (left cancellation) and ac=bc implies a=b (right cancellation) for all a,b,cāG.
Dihedral Group Algebraic Rules
The governing relations for Dnā given by Rn=e, F2=e, and FRā1=RF, where R represents a rotation and F represents a reflection.
Product Subgroup (HK)
For an abelian group G with subgroups H and K, the set HK={hkā£hāH,kāK}, which is also a subgroup of G.
Binary Operation
A function ā:XĆXāX mapping (a,b)āaāb, requiring that the set X is closed under the operation.
Group
A set G equipped with a binary operation Ć, denoted (G,Ć), satisfying associativity ((ab)c=a(bc)), identity (ī =eĆG such that aĆe=a=eĆa), and inverses (for each aĆG, ī =bĆG such that ab=e=ba).
Abelian Group
A group (G,Ć) that satisfies the commutative property, where ab=ba for all a,bĆG.
Identity Uniqueness
The proposition stating that the identity element in a group G is unique, proved by showing that if e1ā and e2ā are both identity elements, then e1ā=e1āe2ā=e2ā.
Cancellation Laws
Properties in a group stating that left cancellation (ab=acāb=c) and right cancellation (ac=bcāa=b) hold for all a,b,cĆG.
Inverse Uniqueness
The proposition stating that for any element aĆG in a group, its inverse is unique, denoted aā1 (or āa in additive notation).
Division Algorithm
Given integers a and n>0, there exist unique integers q and r such that a=nq+r with 0Ćr<n, where r is the remainder when dividing a by n.
Congruence Modulo n
The relation aĆbĆmodĀ n, defined as n divides aāb, meaning a and b share the same remainder when divided by n.
The Group Ćnā
The set of possible remainders modulo n, Ćnā=Ć0,1,2,Ć,nā1Ć, which forms an abelian group under addition modulo n with identity 0 and inverse nāa for element a.
The Group Unā
The set of invertible elements in Ćnā under multiplication modulo n, consisting of elements in Ćnā that are relatively prime to n.
General Linear Group GLnā(Ć)
The non-abelian group under matrix multiplication consisting of all nĆn invertible matrices with real entries.
Composition of Functions
An associative binary operation on functions f,g,h:YāY, satisfying ((hĆg)Ćf)(x)=h(g(f(x)))=(hĆ(gĆf))(x).
Dihedral Group Dnā
The group of symmetries of a regular n-sided polygon, containing n rotations and n reflections for a total of 2n elements.
Algebraic Rules of Dnā
The defining relations for the dihedral group generated by rotation R and reflection F: Rn=e, F2=e, (RF)2=e, and FRā1=RF.
Order of a Group
The total number of elements in a group G, denoted ā£Gā£.
Order of an Element
The smallest positive integer n such that an=e for an element aĆG, denoted ā£aā£; if no such positive integer exists, a has infinite order.
Subgroup
A subset H of a group (G,Ć), denoted HĆG, that is itself a group under the binary operation Ć.
Proper Subgroup
A subgroup H of G, denoted H<G, such that HĆG and Hī =G.
Trivial Subgroup
The subgroup ĆeĆ of a group G, consisting solely of the identity element.
Subgroup Test
A theorem stating that a nonempty subset HĆG is a subgroup of G if and only if abā1ĆH for every a,bĆH.
Product of Subgroups HK
For an abelian group G with subgroups H and K, the set HK=ĆhkĆhĆH,kĆKĆ, which is also a subgroup of G.
Finite Order Subgroup
In an abelian group G, the set H=ĆaĆGĆā£aā£Ā isĀ finiteĆ consisting of all elements of finite order, which forms a subgroup of G.