Abstract Algebra

4.5(2)
studied byStudied by 46 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/100

flashcard set

Earn XP

Description and Tags

Vocabulary, Concepts, & Definitions

Algebra

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

101 Terms

1
New cards
Group
Set with a binary operation that is associative, contains a neutral element, and every element in the set has an inverse element in the set under the binary operation. The set is closed under its binary operation.
2
New cards
Ring
Set with two binary operations, denoted by addition and multiplication. Both are associative. The set forms a commutative group under addition. The distributive property must hold between addition and multiplication. The set must be closed under both operations.
3
New cards
Unity
In a ring, unity refers to the multiplicative neutral. It is denoted 1R. A ring that contains a unity is known as a ring with unity.
4
New cards
Commutative Ring
A ring in which the multiplicative operation is commutative. Thus, both the operations are commutative.
5
New cards
Bijection
A function or map that is both injective and surjective.
6
New cards
Injective
1-1; every output has a unique input so that none of the inputs share outputs. Thus if f(a)=f(b), then a=b.
7
New cards
Surjective
onto; every element in the codomain is also in the range, for every element in the codomain has at lease one element in the domain that maps to it.
8
New cards

Group Homomorphism

A map between two groups (designated phi) that respects the group operation by fulfilling the following property

<p>A map between two groups (designated phi) that respects the group operation by fulfilling the following property</p>
9
New cards

Group Isomorphism

A bijective group homomorphism. Every element in one group can be assigned to an unique element in the other group and the structure of the two groups are the same. The Cayley diagram of one group should match the Cayley diagram of the other group so that the points are just relabeled.

10
New cards

Cosets

A set that can be computed by composing every element of a subgroup by an element in the group. Right cosets are found by composing the new element on the right of the subgroup and left cosets are found by composing the new element on the left of the subgroup.

11
New cards

Subgroup

A subset of another group that also forms a group. All elements in the subset must also be elements of the group, the subset must contain the neutral element, every element in the subset must have its inverse in the subset, composing two elements in the subset produces another element in the subset (closure).

12
New cards

Normal Subgroup

A subgroup whose left and right cosets are equivalent.

13
New cards

Center

Z(G); The set of elements in a group that commute with all elements in a group.

<p>Z(G); The set of elements in a group that commute with all elements in a group. </p>
14
New cards

Automorphism

An isomorphism from a group to itself. Can be found by mapping generators of the group to all other generators of the group.

15
New cards

Abelian

Another term for commutative

16
New cards

Commutative

a*b=b*a

17
New cards

Associative

a*(b*c)=(a*b)*c

18
New cards

Kernel

The preimage of e2 in G1. All the elements in G1 that map to the identity in G2. The kernel always forms a subgroup in G1. It is often denoted by the letter K.

<p>The preimage of e<sub>2 </sub>in G<sub>1</sub>. All the elements in G<sub>1</sub> that map to the identity in G<sub>2</sub>. The kernel always forms a subgroup in G<sub>1</sub>. It is often denoted by the letter K. </p>
19
New cards

Conjugated

Two elements, a and b in G, are conjugated if there exists an element c in G, such that ac=cb or a=cbc-1. Conjugation defines an equivalence relation: x~y iff x=zyz-1 for some z in G.

20
New cards

Cyclic

A group is considered to be cyclic if all the elements in the group can be generated by a single element. All subgroups of a cyclic group are cyclic. All cyclic groups are isomorphic to Zn where n is the number of elements in, or the order of, the cyclic group in question.

21
New cards

Equivalence Relation

An equivalence relations relates two elements in a set, a and b, written as a~b, and fulfills the following properties: Reflexivity, Symmetry, and Transitivity. Every equivalence relation determines a partition of a set.

22
New cards

Partition

All elements of a set are included in a single grouping and no elements can appear in multiple groupings. A partition is also known as a disjoint union of a set.

23
New cards

Reflexivity

a~a (or a=a depending on notation)

24
New cards

Transitivity

If a~b and b~c, then a~c

25
New cards

Equivalence Class

In a group, a subset of elements that are all equivalent to each other based on a given equivalence relation.

26
New cards

Group Action

A group homomorphism from a group G on a set X. It is generally denoted rah. Every element in the set is mapped to another element in X. Essentially the group maps the set X to permutations of X.

<p>A group homomorphism from a group G on a set X. It is generally denoted rah. Every element in the set is mapped to another element in X. Essentially the group maps the set X to permutations of X. </p>
27
New cards

Orbit

The orbit (x) is all of the elements that x can be mapped to in the set using the group operation. All of the potential images of x in the set. A subset of X.

<p>The orbit (<em>x</em>) is all of the elements that <em>x</em> can be mapped to in the set using the group operation. All of the potential images of <em>x</em> in the set. A subset of X.</p>
28
New cards

Stabilizer

The stabilizer of x is all of the elements in G that map x to itself using the group operation (or group action). The stabilizer is a subgroup of G.

<p>The stabilizer of <em>x</em> is all of the elements in G that map <em>x</em> to itself using the group operation (or group action). The stabilizer is a subgroup of G.</p>
29
New cards

Orbit-Stabilizer Theorem

For any group action, the Order of G is equal to the order of the stabilizer of a particular element multiplied by the order of the orbit for that same element.

<p>For any group action, the Order of G is equal to the order of the stabilizer of a particular element multiplied by the order of the orbit for that same element. </p>
30
New cards

Innerautomorphisms

A special type of automorphism that is given by the conjugation action. Innerautomorphisms map elements within their conjugacy classes.

31
New cards

Cayley Table

Describes the structure of a finite group by arranging all possible products of all the group’s elements in a table similar to that of an addition or multiplication table. A Cayley table is able to tell us if the group is abelian, the inverses of each element, and the center.

<p>Describes the structure of a finite group by arranging all possible products of all the group’s elements in a table similar to that of an addition or multiplication table. A Cayley table is able to tell us if the group is abelian, the inverses of each element, and the center. </p>
32
New cards

Cayley Diagram

Also known as a Cayley graph. It encodes the abstract structure of a group. It uses a specified set of generators for the group.

<p>Also known as a Cayley graph. It encodes the abstract structure of a group. It uses a specified set of generators for the group. </p>
33
New cards

Unit

In a ring, a unit is an element with a multiplicative inverse

34
New cards

Lattice of Subgroups

A vertical diagram of all subgroups of a group that shows the structure of the subgroups, i.e. which subgroups are a subgroup of other subgroups.

<p>A vertical diagram of all subgroups of a group that shows the structure of the subgroups, i.e. which subgroups are a subgroup of other subgroups. </p>
35
New cards

Lagrange’s Theorem

For any finite group, G, the order of a subgroup of G, H, divides the order of G

<p>For any finite group, G, the order of a subgroup of G, H, divides the order of G</p>
36
New cards

Permutation

Let X be a set. A permutation of X is a bijection f: X → X. All of the ways to arrange the set.

37
New cards

Order of Permutations

The least common multiple of the order of each disjoint cycles.

<p>The least common multiple of the order of each disjoint cycles. </p>
38
New cards

Even Permutations

If the permutation can be written as an even number of transitions, it is an even permutation.

39
New cards

Odd Permutations

If the permutation can be written as an odd number of transpositions, it is an odd permutation.

40
New cards

Transposition

Also known as a disorder. A 2 cycle. A permutation of only two elements. Every permutation can be written as a product of transpositions.

41
New cards
<p>Prove the following implication. </p>

Prove the following implication.

knowt flashcard image
42
New cards
<p>Prove the following implication.</p>

Prove the following implication.

knowt flashcard image
43
New cards

Quotient Group

Also known as a factor group. A group whose elements are equivalence classes that is found by moding out by a normal subgroup. It is the set of cosets of the subgroup that you mod out by.

44
New cards

Symmetry

If a~b, then b~a

45
New cards

Well Defined

When working with an operation of equivalence classes, the operation is “well-defined” if it does not matter which representative that we choose from the equivalence class. I.e., when adding fractions, it is well defined because we can replace ½ with 3/6 and the result is equivalent.


46
New cards

Centralizer

The set of elements in a group which commute with all elements in the group. It is a subgroup of G.

<p>The set of elements in a group which commute with all elements in the group. It is a subgroup of G. </p>
47
New cards

Normalizer

The set of elements in a group that permute with a particular subset.

<p>The set of elements in a group that permute with a particular subset. </p>
48
New cards

Subring

A subset of a ring with the same two binary operations that fulfills all of the requirements to be a ring.

49
New cards

Ideal

A subring, I, of a ring, R, where multiplying any element in the subring by an element in the ring produces an element in the subring. When multiplication is commutative, it is a two-sided ideal. Otherwise, you have right ideals and left ideals.

50
New cards

Distributive Property

a(b+c) =ab+ac

51
New cards

Field

A commutative ring with unity in which there are no non-zero zero divisors. This means that every element, excluding zero, has a multiplicative inverse.

52
New cards

Integral Domain

A commutative ring in which there are no non-zero zero divisors.

53
New cards

Quotient Ring

Similar to a quotient group, it is a ring whose elements are equivalence classes that is found by moding out by an ideal.

54
New cards

Linear Comination

An expression constructed from a set of terms by multiplying each term by a constant and adding the results. An example is a1v1+a2v2+…+anvn

55
New cards

Ring Homomorphism

Similar to a group homomorphism but working with rings.

<p>Similar to a group homomorphism but working with rings. </p>
56
New cards

Kernel of Ring

Similar to the kernel of a group. All the elements in R1 that map to the additive identify in R2

<p>Similar to the kernel of a group. All the elements in R<sub>1</sub> that map to the additive identify in R<sub>2</sub></p>
57
New cards

Principal Ideal

An ideal that can be generated by a single element

58
New cards

Irreducible

An element q is irreducible if it is non-zero and not a unit and fulfills the following property: if q=a * b, then either a is a unit or b is a unit

<p>An element q is irreducible if it is non-zero and not a unit and fulfills the following property: if q=a * b, then either a is a unit or b is a unit</p>
59
New cards

Prime

An element p is prime if p is non-zero and not a unit and fulfills the following property: if p divides ab, then p divides a or p divides b

<p>An element p is prime if p is non-zero and not a unit and fulfills the following property: if p divides ab, then p divides a or p divides b</p>
60
New cards

Euclidean Domain

A ring in which the Euclidean algorithm holds. A subset of integral domains in which we can do long division. There must exist a “size” function to determine if one element is “smaller” than another (absolute value in integers, order of polynomials)

61
New cards

Euclidean Algorithm

The process to determine the GCD of two elements.

62
New cards

Maximal Ideal

An ideal in which there is no other ideals that can be squeezed between the ideal and the ring. Maximal ideals are generated by an irreducible element.

<p>An ideal in which there is no other ideals that can be squeezed between the ideal and the ring. Maximal ideals are generated by an irreducible element.</p>
63
New cards

Prime Ideal

An ideal in which every element of the ideal is prime.

<p>An ideal in which every element of the ideal is prime. </p>
64
New cards

Characteristic of a Ring

In a ring with unity, the characteristic of the ring is the number of times that the multiplicative identity is added to itself to produce the additive neutral.

<p>In a ring with unity, the characteristic of the ring is the number of times that the multiplicative identity is added to itself to produce the additive neutral. </p>
65
New cards

Rational Root Theorem

For any polynomial p(x) with integer coefficients, p(x)=akxk+…a1x+a0 and q=n/m is a rational number and a root of p(x), then m divides ak and n divides a0

66
New cards

Field Expansion

Adding additional values to a field by solving a polynomial equation that does not have a rational root by moding out by an irreducible polynomial.

67
New cards
term image

“is an element of”

<p>“is an element of”</p>
68
New cards
<p>When related to subgroups</p>

When related to subgroups

“is a normal subgroup of”

<p>“is a normal subgroup of”</p>
69
New cards
<p>When related to rings</p>

When related to rings

“is a two-sided ideal of”

70
New cards
<p>When related to groups</p>

When related to groups

“is a subgroup of”

<p>“is a subgroup of”</p>
71
New cards
<p>When related to rings</p>

When related to rings

“is a subring of”

72
New cards
term image

“is a subset of”

<p>“is a subset of”</p>
73
New cards
term image

The set of all integers; {…,-2, -1, 0, 1, 2, …}

74
New cards
term image

The set of all rational numbers; the set of all elements that can be written as the ratio of two integers, a set of equivalence classes

75
New cards
term image

The set of all natural numbers; normally {1, 2, 3, …} but Anton includes 0

76
New cards
term image

The set of all complex numbers; any real number can be written as a complex number with the “i” term having a coefficient of 0

77
New cards
term image

“for any”/”for all”/”for every”

78
New cards
term image

“there exists”

79
New cards

s.t.

“such that”

80
New cards

w.r.t.

“with respect to”

81
New cards
term image

The group of integers under addition mod n

82
New cards
term image

The set of all possible permutations of n elements

83
New cards
term image

The set of symmetries of an equilateral 2D figure with n sides; D4 is the group of symmetries of a square

84
New cards
term image

Quotient group found by moding out by H in G; the set of all cosets of H (where H must be a subgroup of G

85
New cards
term image

The equivalence class of a; the set of all elements equivalent to a under the given equivalence relation

86
New cards
term image

A way to differentiate from a variable name we already used

87
New cards
term image

Phi; used to denote a group homomorphism

88
New cards
term image

The preimage of Phi(a); All of the elements in G1 that map to a in G2

89
New cards
term image

Rha; used to denote a group action

90
New cards
term image

Order of G; the number of elements in G

91
New cards
term image

The index of H in G; the number of distinct cosets of H in G

92
New cards
term image

The order of H divides the order of G; the order of H is a factor of the order of G

93
New cards
term image

Disjoint union; combine two sets but do not repeat shared elements

94
New cards
term image

(set, operation); In this case, the set of integers under addition

95
New cards
term image

The set generated by a

96
New cards
term image

Action; denotes a group acting on a set

97
New cards
term image

Permutations of a set X

98
New cards
term image

Orbit of x in G

99
New cards
term image

Stabilizer of x in G

100
New cards
term image

Symmetries of automorphisms; the set of innerautomorphisms of G