Definition. A linear transformation σ:R2→R2 is called orthogonal if it is distance preserving; that is, if ∣U−V∣ denotes the distance between points U and V, then
∣σ(U)−σ(V)∣=∣U−V∣
The set O(2,R) of all orthogonal transformations is a group under composition, called the real orthogonal group.
Definition.: Given a figure F in the plane, its symmetry groupΣ(F) is the family of all orthogonal transformations σ:R2→R2 for which
σ(F)=F
The elements of Σ(F) are called symmetries.
The wonderful idea of Galois was to associate to each polynomial f(x) a group, nowadays called its Galois group, whose properties reflect the behavior of f(x). Our aim in this section is to set up an analogy between the symmetry group of a polygon and the Galois group of a polynomial.
Definition. A cummutative ring with 1 is a set R equipped with two binary operations, addtion: (r,r′)→r+r′ and multiplication: (r,r′)→rr′ such that:
R is an abelian group under addition.
multiplication is commutative and associative.
there is an element 1∈R with 1=0 and
∀r∈R,1r=r
the distributive law holds:
∀r,s,t∈R,r(s+t)=rs+rt
From now on, we will write ring instead of “commutative ring with 1.”
Definition. A ring R is a domain (or integral domain) if the product of any two nonzero elements in R is itself nonzero.
Theorem: A ring R is a domain if and only if it satisifies the cancellation law:
∀r,a,b,ra=rb∧r=0⇒a=b
Theorem.Zn is a domain if and only if n is prime.
Proof: [a][b]=0⇒[ab]=0⇒ab≡0modp。
Definition. An element u∈R is a unit if there exists v∈R with uv=1. (乘法可逆)
Definition. A field is a ring R in which every nonzero r∈R is a unit.
If p is prime, then Zp is a field.
Theorem: For every domain R, there is a field Frac(R) containing R as a subring. Moreover, every element q∈Frac(R) has a factorization:
q=ab−1
with a,b∈R,b=0.
Proof: Just like Frac(Z)=Q, define:
Frac(R)={a/b∣a,b∈R,b=0}
Addition: a/b+c/d=(ad+bc)/bd.
Multiplication: (a/b)(c/d)=ac/bd.
where a/b=ab−1.
We call Frac(R) is R's fraction field. And we denote R[x] the ring of polynomials over R, and Frac(R[x]) the field of rational functions over R, whose elements are of the form f(x)/g(x).
Definition. If R and S are rings, then a function φ:R→S is a ring homomorphism if for all r,r′∈R:
φ(r+r′)=φ(r)+φ(r′)φ(rr′)=φ(r)φ(r′)φ(1)=1
A ring homomorphism is an isomorphism if it is a bijection, we writes R≅S.
We can derive φ(0)=0 immediately:
∵φ(a)=φ(a+0)=φ(a)+φ(0)∴0=φ(0)
Definition. The kernel of a ring map is:
kerφ={r∈R:φ(r)=0}
Definition. An ideal in a ring R is a subset I containing 0 such that:
a,b∈I⇒a−b∈I.
a∈I,r∈R⇒ra∈I.
An ideal I in a ring R is a proper ideal if I=R.
An ideal is a sub additive group of the ring.
If a∈R, {ra:r∈R} is the ideal generated by a, which is called the principal ideal generated bya, denoted by (a).
Theorem. If φ:R→S is a ring homomorphism, then kerφ is a proper ideal in R. Moreover, φ is an injection if and only if kerφ={0}.
Proof: kerφ contains 0 is self-evident, and:
∀a∈kerφ,r∈R,φ(ra)=φ(r)φ(a)=φ(r)0=0
so ra∈kerφ. and φ(a−b)=φ(a)−φ(b)=0−0=0, so φ(a−b)∈kerφ.
If φ is an injection, then for r=0,φ(r)=φ(0)=0, so kerφ={0}. Conversely, if kerφ={0}, and exists r=r′,φ(r)=φ(r′), then φ(r−r′)=φ(r)−φ(r′)=0, so 0=r−r′∈kerφ, contradicts.
Theorem: Let I be a proper ideal in a ring R. Then the additive abelian group R/I can be equipped with a multiplication which makes it a ring and which makes the natural map π:R→R/I a surjective ring homomorphism:
π(r)=r+I
Proof:
R/I={r+I∣r∈R}
Addition: [r1]+[r2]=[r1+r2].
Multiplitcation: [r1][r2]=[r1][r2].
where [r]={r′∣r+I=r′+I}.
Theorem: (First Isomorphism Theorem) If φ:R→S is a ring homomorphism with kerφ=I, then there is an isomorphism R/I→imφ given by [r]→φ(r).
Theorem: If F is a field, then every ideal in F[x] is a principal ideal.
Proof: If I={0}, then I=(0). Otherwise, let m(x)∈I be the polynomial of least degree in I, then we prove I=(m(x)).
(m(x))⊆I is obvious since m(x)∈I. For the other direction, for f(x)∈I, we have:
f(x)=q(x)m(x)+r(x)
by polynomial modulo, where r(x)=0 or degr(x)<degm(x). Now r(x)=f(x)−q(x)m(x)∈I, if r(x)=0 then we have contradicted m(x) having the smallest degree. So f(x)=q(x)m(x)∈(m(x)).
Definition. A ring R is called a principal ideal domain if every ideal in R is principal.
Definition. Let F be a field. A nonzero polynomial p(x)∈F[x] is irreducible overF if ∂(p)≥1 and there is no factorization p(x)=f(x)g(x) in F[x] with ∂(f)<∂(p) and ∂(g)<∂(p).
where ∂(f) means the degree of f.
Definition. An ideal I in a ring R is called a prime ideal if it is a proper ideal and ab∈I⇒a∈I or b∈I.
Example: for p≥2, then the ideal (p) in Z is a prime ideal if and only if p is prime.
If ab∈(p), then p∣ab, so p∣a or p∣b.
Otherwise, if p=ab is a factorization, then a,b∈/pZ.
Theorem: If F is a field, then a nonzero polynomial p(x)∈F[x] is irreducible if and only if (p(x)) is a prime ideal.
Proof:
Assume p(x) is a prime ideal. If p(x) is not irreducible, i.e. there is a factorization p(x)=a(x)b(x) and ∂(a),∂(b)<∂(p). Since every non-zero element in (p(x)) should have degree ≥∂(p), so contradicts.
On the other direction, If p(x) is irreducible and ab∈(p), then p∣ab, then p∣a or p∣b, thus a∈(p) or b∈(p). And we need to prove (p) is a proper ideal. If R=(p), then 1∈R=(p), so we have 1=p(x)f(x), which is impossible.
Theorem: A proper ideal I in R is a prime ideal if and only if R/I is a domain.
Definition: An ideal I in a ring R is a maximal ideal if it is a proper ideal and there is no ideal J with I⊊J⊊R.
Theorem: A proper ideal I in a ring R is a maximal ideal if and only if R/I is a field.
Theorem: If R is a principal ideal domain, then every nonzero prime ideal I is a maximal ideal.
Definition. A polynomial f(x)∈F[x]splits overF if it is a product of linear factors in F[x]. Of course, f(x) splits over F if and only if F contains all the roots of f(x), i.e.:
f(x)=(x−a1)(x−a2)...(x−an),ai∈F
Theorem: If F is a field and p(x)∈F[x] is irreducible, then the quotient ring F[x]/(p(x)) is a field containing (an isomorphism copy of) F and a root of p.
Where the isomorphism is: a→a+I. And the root is θ(x)→t(x)+I, t(x)=x.
Since I=(p(x)), so p(θ(x))=I=0+I. So in F[x]/(p(x)), we have a root: t(x)+I.
Notice, F≅F′⊆F[x]/(p(x)) is the isomorphism from “numbers” to “a set of polynomials”. And once we have a root of p(x) in F[x]/(p(x)), it doesn’t mean that there exists a root for p(x) in F. If and only if there exists a∈F such that t−t′∈I, t(x)=x,t′(x)=a, then a is root for p(x) in F.
Example: Q[x]/(x2+1)≅C. Where Q[x]/(x2+1) contains a root for f(x)=x2+1.
Theorem(Kronecker) Let f(x)∈F[x] where F is a field. There exists a field E containing F over which f(x) splits.
Proof:
If ∂(f)=1, then we choose E=F and f(x)=f(x)∈E[x] which is linear.
If ∂(f)>1, without loss of generality, we write f(x)=p(x)g(x) where p(x) is irreducible. Let E=F[x]/(p(x)), then there exists a root θ(x) for p(x) in E. So in E, we have:
f(x)=(x−θ(x))h(x)g(x)+I
So by induction, we can split h(x)g(x).
Example: f(x)=x2+1, then we compute the splitting field of f(x) over Z2.
We factorize f(x) into irreducible ones, f(x)=x2+1.
Compute Z2[x]/(x2+1). Here is a trick, let I=(x2+1), given f(x),g(x)∈Z2[x], then f+I=g+I if and only if f−g∈I, i.e. x2+1∣f−g.
So in Z2[x]/(x2+1), there exists no polynomials with degree ≥3. Because:
x3=x3+2x=x(x2+1)+x≡x
So the potential items in Z2[x]/(x2+1) are:
0,1,x,x+1,x2,x2+1,x2+x,x2+x+1
And we have:
0+I=(x2+1)+I1+I=x2+Ix+I=x2+x+1+Ix+1+I=x2+x+I
So Z2[x]/(x2+1)={0+I,1+I,x+I,x+1+I}={[0],[1],[x],[x+1]}. And
where t=[x] is a root for f(t) in Z2[x]/(x2+1) and satisfies t2+[1]=0. f(t) splits over Z2/(x2+1).
Definition. A field has character 0 if its prime field is isomorphic to Q, it has character p if it’s isomorphic to Zp.
Theorem(Galois): For every prime p and every positive integer n, there exists a field having exactly pn elements.
Proof: let g(x)=xpn−x, Then by Kronecker theorem, there exists a field E containing Zp over which g(x) splits, let’s construct F={α∈E∣g(α)=0}. Since g(x) splits, so it has ∂(g)=pn roots. And we need to prove that it has no repeat roots. We have:
So there are four roots: [0],[1],[x],[x+1] the field containing 4 elements is Z2[x]/(x2+x+1). When q=3 the case is more complicated since Z3[x]/(x2+1)≅Z9, and the coefficients would be ugly as [[[1]x2+[2]x]x] something.
Definition. If E is a field, then an automorphism of E is an isomorphism of E with itself. If E/F is a field extension, then an automorphism σ of EfixesFpointwise if ∀c∈F,σ(c)=c.
And we define the Galois Group as:
Gal(E/F)={automorphisms σ of E fixing F pointwise}
Theorem. If f(x)∈F[x] has n distinct roots in its splitting field E, then Gal(E/F) is isomorphic to a subgroup of the symmetric group Sn.