Abstract Algebra

integer

natural number

well-ordering axiom

s.t.

division algorithm

, s.t.

divisibility

, or divide , s.t.

  • , or do not divide

greatest common divisor

, s.t.

or

Euclidean algorithm

  1. let

  2. apply division algorithm on until

Bézout’s identity

s.t.

  • find : substitute from the last equation in Euclidean algorithm up

relatively prime

are relatively prime

prime number

, then is prime , the only divisor of are

  • composite number: not prime

Euclid’s lemma

prime, or

  • , then prime if , then or
  • prime,

fundamental theorem of arithmetic

can be factored uniquely into product of primes

relation

relation on is a subset

or is related to

  • or is not related to

partition of set

is a non-empty set, partition of

s.t.

  • is equivalence relation

equivalence relation

  1. reflexive:
  2. symmetric:
  3. transitive:

equivalence class

equivalence class of representative

  • are either disjoint or identical

  • quotient set of by

    is partition of

modular arithmetic

, then

or (mod ) or is congruent to modulo

congruence module

( mod ) or quotient set of by

  • is equivalence relation on

congruence class

equivalence class of modulo

  • there are distinct congruence classes

addition and multiplication in modular arithmetic

  • addition and multiplication are well-defined
  • additive inverse
  • either has unique multiplicative inverse or it has not

unit

  • is unit

zero divisor

  • , then

    is prime

    , is unit

    or , or no zero divisor

group

ordered pair

  • set
  • binary operation

axiom group satisfy:

  1. is associative
  2. identity:
  3. inverse:

property

  1. is unique
  2. , has unique inverse
  3. and has unique solution, cancellation law work
  • value of is independent of the bracketing

abelian group (commutative group)

is commutative

  • under
  • under

nonabelian group

  • dihedral group of order ,

general linear group of degree over

special linear group of degree over

binary operation

associative binary operation

commutative binary operation

order of group

, or order of , is the number of distinct elements in

order of element in group

, or order of , is the smallest s.t.

or if DNE

  • are distinct

Torsion group

is a Torsion group, then is finite

  • Torsion-free group:

  • Torsion subgroup of : for abelian group ,

  • is abelian Torsion group, then has largest order

dihedral group

rotation () and reflection () of n-gon

  • order
  • degree

permutation of set

permutation of : bijection

symmetric group on set

set

, the set of permutation of

, symmetric group on

  • , symmetric group of degree
  • nonabelian

array notation of permutation

is permutation on

cycle notation of permutation

cyclically permute and fix the rest

  • -cycle (or cycle of length )

transposition

-cycle

  • can be expressed as product of transposition
    • not unique
    • even permutation: length of such transposition is even
    • odd permutation

disjoint cycle

no common number

  • disjoint
  • can be uniquely expressed as product of disjoint cycle of length at least 2

subgroup

, or is a subgroup of

  • , or is a proper subgroup of

subgroup test

centralizer of group

  • if

center of group

normalizer of group

where

for group and subset

  • abelian

cyclic group

  • generator
  • cyclic group are abelian

fundamental theorem of cyclic group

homomorphism

are group

well-defined map is homomorphism

property

  • monomorphism: injective
  • epimorphism: surjective
  • , or isomorphism: bijective

well-defined map

is well-defined

automorphism

isomorphism from to

  • inner automorphism of ,

isomorphism

property

  1. abelian abelian
  2. have same number of elements of order
  • prime

equivalence relation from isomorphism

is set of groups

is equivalence relation on

cyclic isomorphism

Cayley’s theorem

group , permutation , s.t.

kernel and image of homomorphism

is homomorphism

  1. kernel of

    • measure how much is not injective
    • is injective
  2. image of

    • is injective
  3. fiber of under

    • is surjective

coset

,

  1. left coset of in

    • bijection between and
    • or
  2. right coset of in

    • bijection between and
    • or
  3. is representative

  • left and right coset are not necessarily equal

set of coset

  1. set of left coset

  2. set of right coset

  • bijection between and

index of subgroup in group

index of in

is number of distinct left (right) coset

Lagrange’s theorem

for finite

normal subgroup

, or is normal in

normal subgroup test

  1. if , then

quotient subgroup

is the quotient group of by

under operation :

natural projection

natural projection of onto

homomorphism

  • is epimorphism

isomorphism theorem

first isomorphism theorem

homomorphism

  • under

second isomorphism theorem (diamond theorem)

diagram of diamond isomorphism theorem

third isomorphism theorem

    • under

forth isomorphism theorem

, natural projection

bijection

property of

ring

a triple s.t.

  1. is abelian group

  2. is associative

  3. distributive

commutative ring

ring with identity

  • is unique

division ring

is ring with identity and

field

commutative division ring

zero divisor of ring

is zero divisor

  • is not zero divisor, or

integral domain

commutative ring

is integral domain no zero divisor:

  • or
  • is finite is field

unit of ring

is ring with identity,

is unit

  • group of units of ,
  • zero divisor cannot be unit

subring

is subring of

  1. is a subgroup of
  2. is closed under multiplication

relationship between identity

  • , unit in are unit in

subring test

is subring of

is finite subring of

center of ring

is ring with

  • is subring with
  • is division ring is field

characteristic of ring

if s.t.

then , else

  • is integral domain is or prime
  • finite

nilpotent of commutative ring with identity

commutative ring with

is nilpotent

  • is or zero divisor
  • is nilpotent
  • is unit
  • unit is unit

polynomial ring

is commutative ring with identity, is indeterminate

ring of polynomial in with coefficient in

  • commutative
  • identity
  • is subring of
  • is subring of is subring of
  • is integral domain,
    1. is integral domain

polynomial in with coefficient in

  • degree

matrix ring

is ring,

matrix ring of degree over

  • has identity

  • is not commutative
  • has zero divisor
  • set of scalar matrix in is a subring
  • is subring of is subring of

scalar matrix

ring homomorphism

are ring

well-defined map is ring homomorphism

  • monomorphism, epimorphism, isomorphism, kernel, image
  • is subring
  • is subring
  • they have the same property (commutative, identity, inverse)

ideal of ring

subring is ideal of

  • proper ideal: proper subset that is ideal

ideal test

subset of ring

is ideal

maximal ideal

ideal of is maximal ideal

  1. is ideal of , or
  • easily seen in lattice
  • not necessarily exist
  • every proper ideal is contained in a maximal ideal
  • is commutative, is field

prime ideal

ideal of is prime ideal

  1. or
  • is commutative,
    • is prime ideal is integral domain
    • is integral domain is prime ideal
    • every maximal ideal is prime ideal

quotient ring

is ideal of

is quotient ring of by

  • commutative commutative

  • natural projection

isomorphism theorem for ring

first isomorphism theorem for ring

is ring homomorphism

  1. is ideal of

second isomorphism theorem for ring

are subring of , is ideal

  1. is subring of
  2. is ideal of
  3. is ideal of

third isomorphism theorem for ring

are ideal of ,

  1. is ideal of

forth isomorphism theorem for ring

is ideal of , natural projection

bijection

are subring of ,

  1. is ideal of is ideal of