Term
A non-empty subset H of a group G is said to be a subgroup of G if: |
|
Definition
H forms a group under the operation in G. |
|
|
Term
A non-empty subset H of the group G is a subgroup of G iff: |
|
Definition
1) a,b in H implies that ab in H
2) a in H implies that a^(-1) is in H. |
|
|
Term
If H is a non-empty finite subset of a group G and H is closed under multiplication, then |
|
Definition
|
|
Term
Let G be a roup, H a subgroup of G; for a, b in G we say a is congruent to b mod H, written as a≡b (mod H), if |
|
Definition
|
|
Term
The relation a≡b (mod H) is an |
|
Definition
|
|
Term
1. If H is a subgroup of G, a in G, then Ha = __
2. Ha is called a__ |
|
Definition
(1) {ha|h in H}
2) right coset of H in G |
|
|
Term
|
Definition
|
|
Term
There is a __ between any two right cosets of H in G. |
|
Definition
one-to-one correspondence |
|
|
Term
If G is a finite group and H is a subgroup of G, then o(H) is |
|
Definition
|
|
Term
If He is a subgroup of G, the index of H in G is___, given by___ |
|
Definition
the number of distinct right cosets in G
o(G)/o(H) |
|
|
Term
If G is a group and a in G, the order of a is the___ |
|
Definition
least positive integer such that a^m = e |
|
|
Term
If G is a finite group and a in G, then___ |
|
Definition
|
|
Term
If G is a finite group and a in G, then a^(o(G)) = |
|
Definition
|
|
Term
If n is a positive integer and a is relatively prime to n, then |
|
Definition
|
|
Term
If p is a prime number and a is any integer, then |
|
Definition
|
|
Term
If G is a finite group whose order is a prime number p, then |
|
Definition
|
|
Term
HK is a subgroup of G iff |
|
Definition
|
|
Term
If H, K are subgroups of the abelian group G, then |
|
Definition
|
|
Term
If H and K are finite subgroups of G of orders o(H) and o(K), respectively, then |
|
Definition
o(HK) = [o(H)*o(K)]/o(H∩K)
|
|
|
Term
If H and K are subgroups of G and o(H) > √o(G), o(K) > √o(G), then |
|
Definition
|
|
Term
If H and K are subgroups of a group G such that o(H) and o(K) are reltively prime, then |
|
Definition
|
|
Term
A subgroup n of G is said to be a normal subgroup of G if for every g in G and n in N, |
|
Definition
|
|
Term
If H is the only subgroup offinite G of order o(H), then |
|
Definition
|
|
Term
N is a normal subgroup in G iff |
|
Definition
gNg^(-1) = N for every g in G |
|
|
Term
The subgroup N of G is a normal subgroup of G iff (cosets) |
|
Definition
every left coset of N is a right coset of N in G |
|
|
Term
A subgroup N of G is a normal subgroup of G iff the product |
|
Definition
of two right cosets of N in G is again a right coset of N in G. |
|
|
Term
If G is a group, N a normal subgroup of G, then G/N is |
|
Definition
the quotien group of G by N |
|
|
Term
If G is a finite group and N is a normal subgroup of G, then o(G/N) = |
|
Definition
|
|
Term
A mapping Φ from a group G into a group G' is said to be a homomorphism if |
|
Definition
for all a,b in G Φ(ab) = Φ(a)Φ(b) |
|
|
Term
Suppose G a group, N a normal subgroup of G; define the mapping Φ from G to G/N by Φ(x) = Nx for all x in G. Then |
|
Definition
Φ is a homomorphism of G onto G/N |
|
|
Term
If Φ is a homomorphism of G into G', the kernal of Φ is defined by |
|
Definition
Ker(Φ) = {x in G | Φ(x) = e'} |
|
|
Term
If Φ is a homomorphism of G into G', then
1) Φ(e) =
2)Φ(x^(-1))= |
|
Definition
|
|
Term
If Φ is a homomorphism of G into G' with kernal K, then |
|
Definition
K is a normal subgroup of G. |
|
|
Term
If Φ is a homomorphism of G onto G' with kernal K, then the set |
|
Definition
of all inverse images of g' in G' under Φ in G is given by Kx, where x is any particular inverse image of g' in G. |
|
|
Term
A homomorphisn Φ from G onto G' is said to be an isomorphism if |
|
Definition
|
|
Term
Two groups G, G' are said to be isomorphic if there is an |
|
Definition
isomorphism of G onto G'. |
|
|
Term
A homomorphism Θ of G into G' with kernal K is an isomorphism of G into G' iff |
|
Definition
|
|
Term
Let Θ be a homomorphism of G onto G with kernal K. Then |
|
Definition
|
|
Term
Cauchy's for Abelian
Suppose G is a finite abelian group and p | o(G), where p prime. Then |
|
Definition
There is an element a ≠ e s.t. a^p = e. |
|
|
Term
Sylow's for Abelian
If G is an abelian group of order o(G), and if p is a prime s.t. p^a | o(G), P^(a+1) † o(G), then |
|
Definition
G has a subgroup of order p^a |
|
|
Term
Sylow Corollary
If G abelian of order o(G) and p^a | o(G), p^(a+1) † o(G), then |
|
Definition
there is a unique group of G of order p^a |
|
|
Term
Let Φ be a homomorphism of G onto G' with kernal K. For H' a subgroup of G' let H be defined by H= {x in G | Φ(x) in H'}. Then
1) H is
2) if H' is normal in G', then
3)This association |
|
Definition
1) a subgroup of G and H contains K
2) H is normal in G
3) sets up a one-to-one mapping from the set of all subgroups of G' onto the set of all subgroups of G which contain K. |
|
|
Term
|
Definition
an ismorphism of G onto itself. |
|
|
Term
If G is a group, then Aut(G) is |
|
Definition
|
|
Term
|
Definition
|
|
Term
The group Inn(G) is compsed of all |
|
Definition
Tg:G->G by xTg = g^(-1)xg for x in G. |
|
|
Term
(Cayley)
Every group is isomorphic |
|
Definition
to a subgroup of A(S) for some appropriate S. |
|
|
Term
If G is a group, H a subgroup of G, and S is the set of all right cosets of H in G, then
1) there is
2) and the kernal |
|
Definition
1) a homorphism Θ of G into A(S)
2) of θ is the largest normal subgroup of G which is contained in H. |
|
|
Term
If G is a finite group, and H ≠ G is a subgroup of G s.t. o(G) does not divide i(H)!, then |
|
Definition
H must contain a non-trivial normal subgroup of G. So G is not simple. |
|
|
Term
Every permutation is a product |
|
Definition
|
|
Term
Every permutation is a product of |
|
Definition
|
|
Term
Sn has as a normal subgroup of index 2 |
|
Definition
the alternating group, An consisting of all even permutations. |
|
|
Term
If a,b in G, then b is said to be conjugate of a in G if |
|
Definition
there exists an element c in G s.t. b = c^(-1)ac. |
|
|
Term
|
Definition
equivalence relation on G. |
|
|
Term
If a in G, then N(a), the normalizer of a in G, is the set |
|
Definition
|
|
Term
|
Definition
|
|
Term
If G is a finite group, then ca = (1)
2) in other words, the number of elements conjugate to a |
|
Definition
1) o(G)/o(N(A))
2) is the index of the normalizer of a in G. |
|
|
Term
a in Z iff N(a) = 1)
2) if G is finite, a in Z iff |
|
Definition
|
|
Term
If o(G) = pn, where p is a prime numberm then Z(G) |
|
Definition
|
|
Term
If o(G) = p2, where p is a prime, then |
|
Definition
|
|
Term
Cauchy
If p is a prime and p | o(G), then |
|
Definition
G has an element of order p. |
|
|
Term
The number of conjugacy classes in Sn is |
|
Definition
p(n), the number of partitions of n. |
|
|
Term
Sylow
If p is a prime number and pa|o(G), then |
|
Definition
G has a subgroup of order pa |
|
|
Term
If pm|o(G), pm+1 does not divide o(G), then |
|
Definition
G has a subgroup of order pm |
|
|
Term
|
Definition
|
|
Term
The number of p-Sylow subgroups in G equals |
|
Definition
o(G)/o(N(P)), where N(P) is the normalizer of P. |
|
|
Term
Every finite abelian group is the direct |
|
Definition
product of cyclic subgroups |
|
|
Term
If G and G' are isomorphic abelian groups, then for every integer s, |
|
Definition
G(s) and G'(s) are isomorphic |
|
|
Term
The number of non-isomorphic abelian groups of order pn, p a prime, equals |
|
Definition
the number of partitions of n. |
|
|
Term
A non-empty set R is said to be a ring if for all a,b in R:
1) (R,+) is
2) R is
3) multiplication |
|
Definition
1) an abelian group with identity 0 and additive inverse -a.
2) closed and associative under • (both directions)
3) distributes over addition (both directions) |
|
|
Term
If R is a commutative ring, then a ≠ 0 in R is said to be a zero divisor if |
|
Definition
there exists a, b in R s.t. ab = 0 |
|
|
Term
A commutative ring is an integral domain if |
|
Definition
|
|
Term
A ring is said to be a division ring if |
|
Definition
its non-zero elements are all units. |
|
|
Term
A finite integral domain is |
|
Definition
|
|
Term
If p is a prime number, then Jp, the ring of integers mod p, is |
|
Definition
|
|
Term
An integral domain is said to be of characteristic 0 if, for all a ≠ 0, |
|
Definition
|
|
Term
An integral domain D is said to be of finite characteristic if |
|
Definition
there exists a positive integer m s.t. ma=0 for all a in D. |
|
|
Term
A mapping φ: R-> R' is said to be a homomorphism of R if, for all a,b in R:
1) φ(a+b)
2) φ(ab) |
|
Definition
1) = φ(a) + φ(b)
2) = φ(a)φ(b) |
|
|
Term
If φ is a homomorphism of R into R', then for every a in R:
1) φ(0) =
2) φ(-a) = |
|
Definition
|
|
Term
If φ is a homomorphism of R into R', then Ker(φ) = |
|
Definition
|
|
Term
A non-empty subset U of R is said to be a (two-sided) ideal of R if:
1) (U,+) is
2) For every u in U and r in R, |
|
Definition
1) a subset of (R,+)
2) both ur and ru are in U |
|
|
Term
If U is an ideal of ring R, then R/U is |
|
Definition
a ring and is a homomorphic image of R |
|
|
Term
Let φ: R->R' surjective with kernal U, and ideal of R. Then
1) R' is isomorphic to
2) There is a 1-1 correspondence between
3) This correspondence is achieved by associating with an ideal I' in R'
4) With I so defined, R/I is |
|
Definition
1) R/U
2) the set of ideal of R' and the set of ideals of R which contain U
3) the ideal I in R defined by I = {x in R| φ(x) in W'}
4) isomorphic to R'/I' |
|
|
Term
Let R be a commutative ring with unit element whose only ideals are <0> and R. Then R is |
|
Definition
|
|
Term
An ideal M ≠ R is said to be a maximal ideal of R if whenever U is an ideal of R s.t. M is a subset of U, a subset of R, then |
|
Definition
|
|
Term
If R is a commutative ring with unit element and M is an ideal of R, then M is a maximal ideal of R iff |
|
Definition
|
|
Term
1) A ring R can be embedded in R' uf there is
2) If R and R' have unit elements, then
3) R' will be called an over-ring or extension of R if |
|
Definition
1) an isomorphism of R into R'.
2) this isomorphism takes 1 onto 1'.
3) R can be embedded in R'. |
|
|
Term
Every integral domain can be embedded in |
|
Definition
|
|
Term
If f(x), g(x) are non-zero elements in F[x], then deg((f(x)g(x)) = |
|
Definition
|
|
Term
If f(x), g(x) are non-zero elements in F[x], then deg(f(x)) |
|
Definition
|
|
Term
|
Definition
|
|
Term
Given two polynomials f(x) and g(x) ≠ 0 in F[x], then there exist two polynomials t(x) and r(x) in F[x] s.t. |
|
Definition
f(x) = t(x)g)x)+r(x), where r(x) = 0 or deg(r(x)) < deg(g(x)) |
|
|
Term
|
Definition
|
|
Term
Given two polynomials f(x), g(x) in F[x], they have a gcd d(x) which can be realized as |
|
Definition
d(x) = λ(x)f(x) + μ(x)g(x) |
|
|
Term
A polynomial p(x) in F[x] is said to be irreducible over F if whenever p(x) = a(x)b(x) with a(x), b(x) in F[x], then |
|
Definition
one of a(x) or b(x) has degree 0 |
|
|
Term
Any polynomials in F[x] can be written in a unique manner as a |
|
Definition
product of irreducible polynomials in F[x] |
|
|
Term
The ideal A = <p(x)> in F[x] is a maximal ideal iff |
|
Definition
p(x) is irreducible over F |
|
|
Term
The polynomials f(x) = a0+a1x+...+anxn where the a0, a1,...,an are integers is said to be primitive if |
|
Definition
the gcd of a0,a1,...,an is 1 |
|
|
Term
If f(x) and g(x) are primitive polynomials, then f(x)g(x) |
|
Definition
is a primitive polynomial |
|
|
Term
The content of the polynomial f(x) = a0+a1x+...+anxn where the ai's are integers, is the |
|
Definition
|
|
Term
(Gauss' Lemma)
If the primitive polynomial f(x) can be factored as the product of two polynomials have rational coefficients, it can be factored as the |
|
Definition
product of two polynomials having integer coefficients |
|
|
Term
A polynomial is said to be integer monic |
|
Definition
if all of its coefficients are integers and its leading coeffecient is 1 |
|
|
Term
If an integer monic polynomial factors as the product of two non-constant polynomials having rational coefficients, then it factors as |
|
Definition
the product of two integer monic polynomials |
|
|
Term
Eisenstein
Let f(x)=a0+a1x+...+anxn be a polynomial with INTEGER coefficients. Suppose that for some prime number p, p†an, p|a1, p|a2,..., p|a0, p2 †a0. Then f(x) is |
|
Definition
irreducible over the rationals |
|
|
Term
If R is an integral domain, then so is |
|
Definition
|
|