Blog Archive

Wednesday, May 8, 2024

Essential preliminary for algebraic number theory (1)

Untitled

undefined

Zhan Ziqian, Stroll About in Spring (游春图).

In this essay, R is always an UFD. F is the fraction field of R​.

It is a preparation for algebraic number theory, reveal the connections between R[T] and F[T]​​.

Let us consider a integral domain S. We could define a preorder on S{0} as a|bb=sa(a)(b)​.

Act the posetalization functor on S{0} we get a poset P=S{0}/S.

Definition. For s0S, if d|s(d)=(s), then we say s is irreducible.

If every element in P can be uniquely written as product of irreducible elements p1s1...pnsn, then we say S is UFD.

Some basic observation.

. Prime is irreducible. Since if p=ab, suppose p|a, then p|aa|p. Hence (p)=(a).

. Let P be the poset of principle ideal in R, then (P,|)(P,).

rP is irreducible iff (r) is a maximal element in (P,)​​.

. (P,) satisfies ACC. That is, (a1)(a2)... must become stable. Since a1 only have finite many factors.

Conversely, if (P,) satiefies ACC, then every aP can be factor to product of irreducible elements.

Since (a1)(a2)a2|a1a1=r1a2...

. If all the irreducible elements are prime, for aP then if a=p1e1...pes, then it is the unique way.

Since if a=p1e1...pnes=q1i1...qmim, then p1|qj for 1jm. But both p1 and qj are irreducible, p1=qj...

Collorary. For an integral domain R, R is UFD iff (P,) satisfies ACC and all the irreducible elements are prime.

Definition.

Definition. A content of a polynomial f=anTn+...+a0R[T] is c(f)gcd(an,...,a0)​. The notation here means equal but up to unit. For example, gcd(3,4)11. If c(f) is a unit, then we say that f is primitive.

Lemma. Product of two primitive polynomial is primitive as well. Further, c(fg)c(f)c(g).

Proof.

Let f=i=0naiTi,g=j=0mbjTj. Suppose fg is not primitive, then there exists a p,p|c(fg). Since f,g is primitive, p does not divide c(f) and c(g). Hence p does not dived all the ai and bj. Let m,k be the smallest number that p does not dived am and bk. Then let us consider the coefficient of Tm+k, i.e. i+j=m+kaibj=...+am1bk+1+ambk+am+1bk1.

Notice that p|amibk+j since p|bk+j. Similarly, p|am+ibkj. By assumption, p|c(fg), hence p|i+j=m+kaibj, hence p|ambk. But p is prime, hence p|am or p|bk. That is a contradiction. Hence fg is also primitive.

For c(fg)c(f)c(g), let f=c(f)f0,g=c(g)g0. Then f0,g0 will be primitive and fg=c(f)c(g)f0g0. Since c(f0g0) is unit and gcd(ban,...,ba1)=bgcd(an,...,a1), c(fg)c(f)c(g).

Corollary. If pR is prime, then pR[T]​ is prime as well. Hence p is primitivr in R[T1,...,Tn] by induction.

Proof. Since R is integral domain, R×=R[T]×, so p is not a unit. Let fR[T], p|fp|c(f).

Lemma. Let f,gR[T] and g is primitive. Then if g|fF[T], then g|fR[T].

Proof. Let f=hg where hF[T]. Let a be the lcm of the denominator of the coefficients of h, then ahR[T].

Hence ah=c(ah)h0,af=c(ah)h0g. Since both h0 and g are primitive, h0g is primitive. Take the content both side, we get that ac(f)c(ah)a|c(ah)=gcd(as1s1,...,asnsn). Hence hR[T].

Corollary. Let gR[T] be primitive. If g is prime in F[T], then g is prime in R[T]. We will use this to prove that If R is UFD, then R[T] is UFD as well.

Lemma. Gauss Lemma.

Let fR[T] be primitive. f is irreducible in R[T], if and only if f is irreducible in F[T].

Proof. Suppose f is reducible in F[T], then f=gh. Let g=g/d1,h=h/d2R[T], where d1,d2R{0}.

We have f=gh/d1d2, hence d1d2f=gh. Act content both sides we get d1d2c(f)c(g)c(h).

Oberve that f is primitive, c(f)=1, hence d1d2c(g)c(h). f=(g/c(g))(h/c(h)), where g/c(g),h/c(h)R[T].

That is a contradiction to f is irreducible in R[T]. is obviously.

Proposition. R is UFD implies R[T] is UFD.

Proof. Let fR[T], then f=c(f)f0. Since R is UFD, c(f) is product of irreducible elements in R. Hence product of irreducible elements in R[T]. So we only need to deal with primitive polynomial. Let f0=gh. Here ghR[T] are primitive as well. By induction on the degree, we can factor f0 to primitive irreducible.

Now we need to show uniqueness of factorization. i.e. All the irreducible elements are prime.

Let f be irreducible,in R[T] hence f is irreducible in F[T]. Hence f is prime in F[T]. By the previous corollary, i.e.

Corollary. Let gR[T] be primitive. If g is prime in F[T], then g is prime in R[T]. We will use this to prove that If R is UFD, then R[T] is UFD as well.

f is prime. Hence R[T] is UFD as well.

Eisenstein's criterion.

Let R be a commutative ring, f(T)=a0+a1T+...+anTnR[T]. Let p be a prime ideal.

If anp,a0,...,an1p,a0p2. Then f is irreducible.

Proof. Consider R[T]/p, wchich is an integral domian. Suppose f(T)=h(T)g(T), and degh=α,degg=β.

Then f(T)hαTαgβTβmodp. Hence h0g0=a0p. That is a contradiction.

Example. For R[T], define f(p(T))=p(T+r),rR. Easy to see this is a ring isomorphism.

Consider p(T)=Tp1+Tp2+...+T+1=Tp1T1. Then

(1)f(p(T))=(T+1)p1T=Tp1+(p1)Tp2+...+(pp2)T+(pp1)

By Eisenstein's criterion, f(p(T)) is irreducible. Since f is isomorphism, p(T) is irreducible.

No comments:

Post a Comment

Popular Posts