MATH 415 Lecture 22

From Notes
Jump to navigation Jump to search

« previous | Thursday, November 14, 2013 | next »

Begin Exam 3 content


Irreducibility

Example

f(x)=x4−2x2+8x+1∈ℚ[x]

If f(x)=(x−a)g(x), where deg⁡g=3, we must have a∣1, so a=±1. However, f(±1)≠0

If f(x)=(x2+ax+b)(x2+cx+d), then we must have f(x)=x4+(a+c)x3+(b+d+ac)x2+(ad+bc)x+bd. In particular,

{bd=1ad+bc=8b+d+ac=−2a+c=0

However, this system is inconsistent.


Theorem 23.5: Eisenstein Criterion

Let p∈ℤ be a prime. Suppose that the polynomial f(x)=anxn+…+a1x+a0 is in ℤ[x], and an≢0(modp), but ai≡0(modp) for all i<n, with a0≢0(modp2). Then f(x) is irreducible over rationals.

Proof. Assume f(x)=g(x)h(x) with deg⁡g,deg⁡h≥1 and g(x),h(x)∈ℚ[x]. Let deg⁡g=r and deg⁡h=s with coefficients br≠0 in g(x) and cs≠0 in h(x):

g(x)=brxr+…+b0h(x)=crxr+…+c0

If a0≢0(modp2), then neither b0 nor c0 are congruent to 0 (mod p). We must have a0=b0⋅c0 and an=br⋅cs.

Let m be the smallest k such that ck≢0(modp). We have

am=b0cm+b1cm−1+…+{bmc0r≥mbrcm−r⏟≡0(modp)r<m

This implies am≢0(modp), so m=n.

s=n

implies

r=0

, which means

g(x)

is a constant function. Contradiction!

quod erat demonstrandum


Example 1

Show that x2−2 is irreducible in ℚ[x].

  1. 2∉ℚ
  2. x2−2=(x−a)(x−b) for a,b∈ℤ, then a=±1,±2
  3. p=2, p∤1, p∣0, p∣(−2)
    • 1≢0(mod2), 0≡0(mod2), −2≡0(mod2), and −2≢0(mod22)

Therefore this function is irreducible by Eisenstein Criterion.

Example 2

Show that 25x5−9x4−3x2−12 is irreducible over ℚ.

  • p=3.
  • p2∤12.

Irreducible



Let ϕp(x)=xp−1x−1=xp−1+xp−2+…+x+1. This is called the pth cyclotonic polynomial.

ϕp(x) is irreducible over ℚ.

To prove this, we will need a well-defined homomorphism φx+1:ℚ[x]→ℚ[x] (Take a look at the Remark after 22.5).

Since φ maps ℚ[x] to itself, it is an automorphism.

Proof. Seeking a contradiction, assume ϕp(x)=g(x)h(x), where deg⁡g,deg⁡h≥1. Because φx+1 is a homomorphism, we have

φx+1(ϕp(x))=φx+1(g(x)h(x))=φx+1(g(x))φx+1(h(x))

Hence

ϕ~p(x)=ϕp(x+1)=g(x+1)h(x+1)=g~(x)h~(x)=(x+1)p−1(x+1)−1=xp+(p1)+…+(pi)xp−i+…+(pp)x+1−1x

Since p is prime, we have (pi)≡0(modp) for i≢0(modp). Thus Eisenstein Criteroin applies, so the original function is irreducible.


Section 24: Noncommutative Rings

Rings of Endomorphisms

Let (A,+) be an abelian group. A homomorphism f:A→A is called an endomorphism.

Note: An automorphism is an isomorphisom of a group onto itself, but an endomorphism is a homomorphism of a group onto itself.

Let End(A) be the set of endomorphisms of A.

We define the addition operation (φ+ψ)(a)=φ(a)+ψ(a), and we get ⟨End(A),+⟩ is an abelian group with σ:A→A given by the trivial homomorphism σ(a)=0.

We construct the product (φ∘ψ)(a)=ϕ(ψ(a)). This satisfies the left and right distributive laws, so ⟨End(A),+,∘⟩ is a ring.