Groups Flashcards

1
Q

What properties does a group need to have?

A
  1. Closure
  2. Associativity
  3. Identity
  4. Inverses
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Define Closure:

A

∀g,h ∈ G, g * h ∈ G
(* signifies the group operation, not multiplication)

For example, the set of even integers is closed under addition because the sum of any two even integers is always even.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Define Associative:

A

∀g,h,k ∈ G, (g * h) * k = g * (h * k)
(* signifies the group operation, not multiplication)

For example, addition is associative because for any real numbers g,h,k:
(g + h) + k = g + (h + k)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Define Identities:

A

∃e ∈ G | ∀g ∈ G, e * g = g* e = g
(* signifies the group operation, not multiplication. e = Identity)

An identity for an operation is an element that, when combined with any other element using that operation, leaves the other element unchanged.

’+’ Identity is 0 as a + 0 = a
‘x’ Identity is 1 as a x 1 = a

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Define Inverses:

A

∀a ∈ G, ∃b ∈ G | a * b = b* a = identity
(* signifies the group operation, not multiplication)

x * x’ = e

For a given operation and its identity element, the inverse of an element a is another element b such that when a and b are combined using the operation, the result is the identity element.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Let (G, *) be a group.

is the empty set a subgroup of G?

A

No. The empty set is a subset of G, but it is NOT a subgroup

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What defines a Subgroup.

A

Given a group G with an operation ∘, a subset H of G is a subgroup if:

H is non-empty.
H is closed under the operation ∘. (∀g,h ∈ H, g ∘ h ∈ H)
If e is the identity for (G, ∘), the e ∈ H.
For every element a ∈ H, its inverse a^(−1) ∈ H.

A subgroup retains the group structure but might have fewer elements than the original group.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

If the trivial subgroup of G is {e}, what does that tell us?

A

e is the identity of group G

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How does Raising the Powers of Elements work (mechanically)?

A

In the context of groups, given an element a and an integer n:

  1. a^n denotes the product of a with itself n times.
  2. If n > 0, a^n = a ∘ a ∘ … ∘ a (n times).
  3. a^0 is the identity element of the group.
  4. a^(-n) is the inverse of a^n.

It must be noted the operation ∘ will be whatever the operation on the group is. It is not simply a multiple.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Why Raise the Powers of Elements in Group Theory?

A
  1. Cyclic Groups: Powers help determine if a group is cyclic. If an element’s powers can generate all group members, the group is cyclic.
  2. Order of Elements: The smallest positive power that gives the identity element is the element’s order. It’s a key property in group studies.
  3. Group Structure: Powers can reveal patterns and symmetries, helping understand the group’s structure and properties.

Raising powers is a fundamental operation that provides insights into the behavior and properties of groups.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Determine < 3 > in the group (ℤ₁₁ - {0}, x)

A
  1. 3^0 = 1 (Identity)
  2. 3^1 = 3
  3. 3^2 = 9
  4. 3^3 = 27 = 5
  5. 3^4 = 81 = 4
  6. 3^5 = 243 = 1
    (At this point, we’ve reached the identity element, and will repeat)

< 3 > in the group (ℤ₁₁ - {0}, x) = {1,3,9,5,4}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Two groups (G,*) and (H,∘) are isomorphic if and only if ..?

A

Two groups (G,*) and (H,∘) are isomorphic if and only if there exists a bijection f: G ➔ H such that for all x, y ∈ G, f (x * y) = f (x) ∘ f (y).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What can be an easier way to find an isomorphism/bijection?

A

The Schröder-Bernstein theorem:

  1. Find an Injective Function from A to B:
    Define a function f: A → B and show it’s injective.
  2. Find an Injective Function from ( B ) to ( A ):
    Define a function g: B → A and show it’s injective.
  3. Apply Schröder-Bernstein:
    If you’ve successfully shown the two injective functions as described, then by the Schröder-Bernstein theorem, a bijection h: A → B exists.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

A group is Abelian iff..?

A

The groups binary operation is commutative.

A binary operation * on S is commutative if a * b = b * a, ∀a,b ∈ S

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

A binary operation * on S is commutative if..?

A

A binary operation * on S is commutative if:
a * b = b * a, ∀a,b ∈ S

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Why map a generator to a generator?

A

This concept emphasizes that in an isomorphism, not only are elements mapped bijectively, but the fundamental structures of the groups are preserved, as evidenced by the mapping of generators.