• 沒有找到結果。

Advanced Algebra II Jun. 1, 2007

N/A
N/A
Protected

Academic year: 2022

Share "Advanced Algebra II Jun. 1, 2007"

Copied!
45
0
0

加載中.... (立即查看全文)

全文

(1)

Advanced Algebra II Jun. 1, 2007

(2)

Definition

An integral domain D is a Dedekind domain if 1. D is a Noetherian ring;

2. D is integrally closed;

3. all non-zero prime ideals are maximal ideals.

That is, it’s an 1-dimensional Noetherian integrally closed domain.

Let K be its field of quotients.

(3)

Example

Z is a Dedekind domain.

Let Q(√

d )/Q be a quadratic extension. And let O be the algebraic integers in Q(√

d ). Then O is a Dedekind domain.

(4)

Definition

Let a C D be an ideal. A fractional ideal b is a finitely generated D-submodule of K , that is

b= ca := {x ∈ K |x = ca, c ∈ K, a ∈ a}.

(5)

In fact, every finitely generated D-module M in K can be

generated by elements {ab1, ...,abn} for some b. Let a := (a1, ..., an) and c = b−1, then M = ca.

We can define the product on the set of fractional ideals in a natural way. There is an identity element, D in the set of fractional ideals. And in particular, if a C D, then ab ⊂ b. For a ∈ K, we write

(a) = aD

and any fractional ideal of this form is called principal. Clearly (a)(b) = (ab).

(6)

In fact, every finitely generated D-module M in K can be

generated by elements {ab1, ...,abn} for some b. Let a := (a1, ..., an) and c = b−1, then M = ca.

We can define the product on the set of fractional ideals in a natural way. There is an identity element, D in the set of fractional ideals. And in particular, if a C D, then ab ⊂ b.

For a ∈ K, we write

(a) = aD

and any fractional ideal of this form is called principal. Clearly (a)(b) = (ab).

(7)

In fact, every finitely generated D-module M in K can be

generated by elements {ab1, ...,abn} for some b. Let a := (a1, ..., an) and c = b−1, then M = ca.

We can define the product on the set of fractional ideals in a natural way. There is an identity element, D in the set of fractional ideals. And in particular, if a C D, then ab ⊂ b.

For a ∈ K, we write

(a) = aD

and any fractional ideal of this form is called principal. Clearly (a)(b) = (ab).

(8)

Theorem

Every non-zero ideal a C D can be written as a product of prime ideals of D,

a= p1· · · pn.

Moreover, this representation is unique up to the order of prime ideals.

Theorem

Every fractional ideal of a Dedekind domain is invertible.

(9)

A fractional ideal a is said to be invertible if there is a fractional ideal b such that ab = D We need the following Lemmas.

For a fractional ideal a, we consider Ra:= {x ∈ K |x a ⊂ a} and a−1:= {x ∈ K |x a ⊂ D}.

(10)

A fractional ideal a is said to be invertible if there is a fractional ideal b such that ab = D We need the following Lemmas.

For a fractional ideal a, we consider Ra:= {x ∈ K |x a ⊂ a} and a−1:= {x ∈ K |x a ⊂ D}.

(11)

Lemma

If D is Noetherian and integrally closed, then Ra = D.

Now let S := {a|Ra ( a−1}. S is non-empty if D is not a field and let a = (a) for some a ∈ D − D.

Since D is Noetherian, we have a maximal element m in S . We claim that m is prime and invertible.

Given a ∈ D − m and b ∈ D such that ab ∈ m. Note that there is x ∈ K − D such that x m ⊂ D. We first consider m + (a) C D. Then x (m + (a)) ⊂ D + x (a). Since m is maximal, we must have x (a) = (xa) 6⊂ D.

(12)

Lemma

If D is Noetherian and integrally closed, then Ra = D.

Now let S := {a|Ra ( a−1}. S is non-empty if D is not a field and let a = (a) for some a ∈ D − D.

Since D is Noetherian, we have a maximal element m in S . We claim that m is prime and invertible.

Given a ∈ D − m and b ∈ D such that ab ∈ m. Note that there is x ∈ K − D such that x m ⊂ D. We first consider m + (a) C D. Then x (m + (a)) ⊂ D + x (a). Since m is maximal, we must have x (a) = (xa) 6⊂ D.

(13)

Lemma

If D is Noetherian and integrally closed, then Ra = D.

Now let S := {a|Ra ( a−1}. S is non-empty if D is not a field and let a = (a) for some a ∈ D − D.

Since D is Noetherian, we have a maximal element m in S . We claim that m is prime and invertible.

Given a ∈ D − m and b ∈ D such that ab ∈ m. Note that there is x ∈ K − D such that x m ⊂ D. We first consider m + (a) C D. Then x (m + (a)) ⊂ D + x (a). Since m is maximal, we must have x (a) = (xa) 6⊂ D.

(14)

Lemma

If D is Noetherian and integrally closed, then Ra = D.

Now let S := {a|Ra ( a−1}. S is non-empty if D is not a field and let a = (a) for some a ∈ D − D.

Since D is Noetherian, we have a maximal element m in S . We claim that m is prime and invertible.

Given a ∈ D − m and b ∈ D such that ab ∈ m. Note that there is x ∈ K − D such that x m ⊂ D. We first consider m + (a) C D.

Then x (m + (a)) ⊂ D + x (a). Since m is maximal, we must have x (a) = (xa) 6⊂ D.

(15)

Next we consider m + (b). Now ax (m + (b)) ⊂ ax m + (abx ) ⊂ D.

Hence m + (b) ∈ S and m + (B) = m by maximality. We thus have b ∈ m.

Suppose now that D is Dedekind, hence prime ideal is maximal. So we have m ⊂ mm−1⊂ D. But m 6= mm−1, otherwise

,m−1⊂ Rm= D which is absurd. It follows that m−1m= D.

(16)

Next we consider m + (b). Now ax (m + (b)) ⊂ ax m + (abx ) ⊂ D.

Hence m + (b) ∈ S and m + (B) = m by maximality. We thus have b ∈ m.

Suppose now that D is Dedekind, hence prime ideal is maximal.

So we have m ⊂ mm−1⊂ D. But m 6= mm−1, otherwise ,m−1⊂ Rm= D which is absurd. It follows that m−1m= D.

(17)

Lemma

Every prime ideal of a Dedekind domain is invertible.

(18)

[Proof of theorems]

We have seen that if m is a mximal element in S , then m is invertible and prime.

We claim that a non-zero ideal a C D is invertible if and only if a= m1· · · mr, with mi being maximal elements in S .

One direction is clear. So that a is proper invertible, then

D ( a−1. Hence a ∈ S and there is maximal m1 ∈ S containing a.

(19)

[Proof of theorems]

We have seen that if m is a mximal element in S , then m is invertible and prime.

We claim that a non-zero ideal a C D is invertible if and only if a= m1· · · mr, with mi being maximal elements in S .

One direction is clear. So that a is proper invertible, then

D ( a−1. Hence a ∈ S and there is maximal m1 ∈ S containing a.

(20)

[Proof of theorems]

We have seen that if m is a mximal element in S , then m is invertible and prime.

We claim that a non-zero ideal a C D is invertible if and only if a= m1· · · mr, with mi being maximal elements in S .

One direction is clear. So that a is proper invertible, then

D ( a−1. Hence a ∈ S and there is maximal m1 ∈ S containing a.

(21)

Clearly, we have a ⊂ am−11 ⊂ D. Notice that a 6= am−11 , otherwise m−11 ⊂ Ra = D.

If am−11 = D, then a = am−11 m1 = Dm1= m1, we are done. If am−11 ( D, then am−11 is again invertible ( with inverse a−1m1). Proceed this process, and by Noetherian condition, we end up with D= am−11 m−12 ...m−1r and this proves the claim.

(22)

Clearly, we have a ⊂ am−11 ⊂ D. Notice that a 6= am−11 , otherwise m−11 ⊂ Ra = D.

If am−11 = D, then a = am−11 m1 = Dm1= m1, we are done.

If am−11 ( D, then am−11 is again invertible ( with inverse a−1m1). Proceed this process, and by Noetherian condition, we end up with D= am−11 m−12 ...m−1r and this proves the claim.

(23)

Clearly, we have a ⊂ am−11 ⊂ D. Notice that a 6= am−11 , otherwise m−11 ⊂ Ra = D.

If am−11 = D, then a = am−11 m1 = Dm1= m1, we are done.

If am−11 ( D, then am−11 is again invertible ( with inverse a−1m1).

Proceed this process, and by Noetherian condition, we end up with D= am−11 m−12 ...m−1r and this proves the claim.

(24)

Clearly, we have a ⊂ am−11 ⊂ D. Notice that a 6= am−11 , otherwise m−11 ⊂ Ra = D.

If am−11 = D, then a = am−11 m1 = Dm1= m1, we are done.

If am−11 ( D, then am−11 is again invertible ( with inverse a−1m1).

Proceed this process, and by Noetherian condition, we end up with D= am−11 m−12 ...m−1r and this proves the claim.

(25)

For any prime ideal p C D, pick any a ∈ p, we consider (a) which is invertible.

Hence we have m1m2...mr = (a) ⊂ p. Thus mj ⊂ p for some j . Since every prime is maximal, we have mj = p. It follows that p is invertible.

Finally, for any a C D, a ⊂ p1 for some prime ideal. Since prime is invertible, we have a ⊂ ap−11 ⊂ D. Clearly a 6= ap−11 , otherwise p−1⊂ Ra = D. By Noetherian condition, we will end up with ap−11 p−12 ...p−1r = D. It follows that a = p1· · · pr.

It remains to show the uniqueness. If p1· · · pr = q1· · · qs. Then p1⊃ q1· · · qs. It follows that p1 ⊃ qj for some j . Since prime is maximal, we have p1= qj. By multiplying p−11 and prove by induction, we are done.

(26)

For any prime ideal p C D, pick any a ∈ p, we consider (a) which is invertible. Hence we have m1m2...mr = (a) ⊂ p. Thus mj ⊂ p for some j . Since every prime is maximal, we have mj = p. It follows that p is invertible.

Finally, for any a C D, a ⊂ p1 for some prime ideal. Since prime is invertible, we have a ⊂ ap−11 ⊂ D. Clearly a 6= ap−11 , otherwise p−1⊂ Ra = D. By Noetherian condition, we will end up with ap−11 p−12 ...p−1r = D. It follows that a = p1· · · pr.

It remains to show the uniqueness. If p1· · · pr = q1· · · qs. Then p1⊃ q1· · · qs. It follows that p1 ⊃ qj for some j . Since prime is maximal, we have p1= qj. By multiplying p−11 and prove by induction, we are done.

(27)

For any prime ideal p C D, pick any a ∈ p, we consider (a) which is invertible. Hence we have m1m2...mr = (a) ⊂ p. Thus mj ⊂ p for some j . Since every prime is maximal, we have mj = p. It follows that p is invertible.

Finally, for any a C D, a ⊂ p1 for some prime ideal. Since prime is invertible, we have a ⊂ ap−11 ⊂ D.

Clearly a 6= ap−11 , otherwise p−1⊂ Ra = D. By Noetherian condition, we will end up with ap−11 p−12 ...p−1r = D. It follows that a = p1· · · pr.

It remains to show the uniqueness. If p1· · · pr = q1· · · qs. Then p1⊃ q1· · · qs. It follows that p1 ⊃ qj for some j . Since prime is maximal, we have p1= qj. By multiplying p−11 and prove by induction, we are done.

(28)

For any prime ideal p C D, pick any a ∈ p, we consider (a) which is invertible. Hence we have m1m2...mr = (a) ⊂ p. Thus mj ⊂ p for some j . Since every prime is maximal, we have mj = p. It follows that p is invertible.

Finally, for any a C D, a ⊂ p1 for some prime ideal. Since prime is invertible, we have a ⊂ ap−11 ⊂ D. Clearly a 6= ap−11 , otherwise p−1⊂ Ra = D.

By Noetherian condition, we will end up with ap−11 p−12 ...p−1r = D. It follows that a = p1· · · pr.

It remains to show the uniqueness. If p1· · · pr = q1· · · qs. Then p1⊃ q1· · · qs. It follows that p1 ⊃ qj for some j . Since prime is maximal, we have p1= qj. By multiplying p−11 and prove by induction, we are done.

(29)

For any prime ideal p C D, pick any a ∈ p, we consider (a) which is invertible. Hence we have m1m2...mr = (a) ⊂ p. Thus mj ⊂ p for some j . Since every prime is maximal, we have mj = p. It follows that p is invertible.

Finally, for any a C D, a ⊂ p1 for some prime ideal. Since prime is invertible, we have a ⊂ ap−11 ⊂ D. Clearly a 6= ap−11 , otherwise p−1⊂ Ra = D. By Noetherian condition, we will end up with ap−11 p−12 ...p−1r = D. It follows that a = p1· · · pr.

It remains to show the uniqueness. If p1· · · pr = q1· · · qs. Then p1⊃ q1· · · qs. It follows that p1 ⊃ qj for some j . Since prime is maximal, we have p1= qj. By multiplying p−11 and prove by induction, we are done.

(30)

For any prime ideal p C D, pick any a ∈ p, we consider (a) which is invertible. Hence we have m1m2...mr = (a) ⊂ p. Thus mj ⊂ p for some j . Since every prime is maximal, we have mj = p. It follows that p is invertible.

Finally, for any a C D, a ⊂ p1 for some prime ideal. Since prime is invertible, we have a ⊂ ap−11 ⊂ D. Clearly a 6= ap−11 , otherwise p−1⊂ Ra = D. By Noetherian condition, we will end up with ap−11 p−12 ...p−1r = D. It follows that a = p1· · · pr.

It remains to show the uniqueness. If p1· · · pr = q1· · · qs. Then p1⊃ q1· · · qs. It follows that p1 ⊃ qj for some j . Since prime is maximal, we have p1= qj. By multiplying p−11 and prove by induction, we are done.

(31)

For a fractional ideal b, it’s of the form ca for some a C D.

Suppose that a = p1· · · pr, then c−1p−11 · · · p−1r b= D. So b is invertible.

(32)

Exercise

c−1p−11 · · · p−1r = b−1.

(33)

Let ID be the set of fractional ideals. It’s naturally an abelian group via the multiplication of fractional ideals. There is a group homomorphism ϕ : K → ID by ϕ(x ) = (x ), the fractional ideal generated by x . Let Cl (D) be the cokernel, which is called the ideal classes of D.

Proposition

Dis PID if and only if Cl (D) = 1.

(34)

Proof.

If Cl (D) = 1, then every ideal a C D is a fractional ideal, i.e.

a= cD for some c ∈ K . We may write c = ba and c ∈ a ⊂ D implies that b = at for some t ∈ D. It follows that c ∈ D and thus a= (c) is a principal ideal.

On the other hand, if D is PID, then every primes ideal p is principal, hence so is every fractional ideal.

(35)

It’s easy to see that for all prime ideal p C D, we can define vP : ID → Z in a natural way. This gives rise to:

Corollary

ID is a free abelian group. In fact, ID ∼= ⊕pZ.

(36)

Let us consider the kernel of ϕ. For x ∈ K, ϕ(x ) = 1 means that (x ) = D. In other words, x ∈ D and indeed x is a unit in D.

Hence we have kernel equals to D. By abuse the language, we call D the ”group of unit of K ” and denoted UK usually. It’s thus essential to study units and classgroups.

We close this section by considering extensions. Let L/K be a finite separable extension and let O be the integral closure of D in L.

(37)

Theorem

Let L/K be a finite separable extension of fields and keep the notation as above. Then

1. O is a finitely generated D-module which span L over K . 2. O is a Dedekind domain.

3. Every prime ideal P C O lies above a primes ideal p of D. For every prime ideal p C D, there exists at least one, and at most [L : K ], primes lying over p.

(38)

Proof.

For any D-module X of L, we consider

XD:= {x ∈ L|tr (xy ) ∈ D, ∀y ∈ X }.

It’s easy to see that O ⊂ OD.

Pick X a free-module with a basis {x1, ..., xn} so that this is also a basis of L/K . We may assume that xi ∈ O by eliminating the enumerators.

Since trace is non-singular, one has dual basis {y1, ..., yn} for XD. Summarize, we have D-modules.

X ⊂ O ⊂ OD ⊂ XD.

Since D is Noetherian and XD is finitely generated, so is O. This proves (1).

For (2), it’s easy.

Now consider p C D a prime ideal. It’s clear that pO ( O. So O/pO is a finite dimensional algebra over D/p. Hence there are finitely many maximal ideals. These maximal ideals corresponds to maximal ideals lying over p.

(39)

Use this theorem to the case of algebraic number fields L/Q with algebraic numbers O. There is a free Z-basis ω1, ..., ωnof O. so that it spans L over Q.

We define the discriminant

det(trL/Aiωj)) = det(ωσi )2.

Note that this is a rational algebraic integer, hence an integer. One can also prove that this is independent of choice of basis. Thus we call it dL.

Proposition dL≡ 0, 1 mod 4.

(40)

Use this theorem to the case of algebraic number fields L/Q with algebraic numbers O. There is a free Z-basis ω1, ..., ωnof O. so that it spans L over Q.

We define the discriminant

det(trL/qiωj)) = det(ωσi )2. This follows from

tr (ω1ω1) tr (ω1ω2) . . . tr (ω1ωn)

... ...

tr (ωnω1) tr (ωnω2) . . . tr (ωnωn)

=

ω1σ1 ω1σ2 . . . ωσ1n

... ...

ωnσ1 ωnσ2 . . . ωσ1n

ωσ11 ω2σ1 . . . ωσn1

... ...

ωσ1n ω2σn . . . ωσnn

. Note that this is a rational algebraic integer, hence an integer. One can also prove that this is independent of choice of basis. Thus we call it dL.

(41)

Proposition dL≡ 0, 1 mod 4.

Let t be the number of real embeddings, then there are n − t imaginary embeddings. It’s clear that n − t = 2s since there is complex conjugation. Then one sees that

Exercise

sgn(dL) = (−1)s.

(42)

Let D be a Dedekind domain and let a be a non-zero ideal.

Suppose that D/a has finite element. We define Na := |D/a|.

Proposition Nab = NaNb.

(43)

In fact, if K is an algebraic number field, then N(aD) = |NK /Qa|

for all a ∈ K. Proposition

Every ideal class contains an D-ideal. And two D-ideals are equivalent if and only a1a1 = a2a2 for some non-zero a1, a2 ∈ D.

(44)

Theorem

For a number field K , the ideal class group CK is bounded by κ :=Qn

j =1(Pn

i =1|viσj|), hence finite.

Example

Let K = Q(ω). dK = −3. {1, ω} is a basis. κ = 4. We look for ideals with norm ≤ 4. They are principal, hence e get a PID.

(45)

Let D be a Dedekind domain and K be its field of quotients. Let p be a prime ideal. Then we have vp : K → Z such that:

vp(xy ) = vp(x )vp(y ). and vp(x + y ) ≥ inf (vp(x ), vp(y )).

Also this is surjective. We may extend the definition to K by assign vp(0) = ∞.

It follows that v (1) = 0.

For a given K with a function v : K → Z ∪ {∞} with above property is called a valuation. For a valuation, let

R := {x ∈ K |v (x ) ≥ 0} and m := {x ∈ K |v (x ) ≥ 1}. Then R is called the valuation ring. It’s easy to check that m is a maximal ideal, called the valuation ideal.

We can show that R is a local PID.

參考文獻

相關文件

– It is not hard to show that calculating Euler’s phi function a is “harder than” breaking the RSAa. – Factorization is “harder than” calculating Euler’s phi function

• Hence it may surprise you that most of the complexity classes that we have seen so far have maximal elements. a Cook (1971) and

When we know that a relation R is a partial order on a set A, we can eliminate the loops at the vertices of its digraph .Since R is also transitive , having the edges (1, 2) and (2,

An n×n square is called an m–binary latin square if each row and column of it filled with exactly m “1”s and (n–m) “0”s. We are going to study the following question: Find

More precisely, it is the problem of partitioning a positive integer m into n positive integers such that any of the numbers is less than the sum of the remaining n − 1

The underlying idea was to use the power of sampling, in a fashion similar to the way it is used in empirical samples from large universes of data, in order to approximate the

In part II (“Invariance of quan- tum rings under ordinary flops II”, Algebraic Geometry, 2016), we develop a quantum Leray–Hirsch theorem and use it to show that the big

To proceed, we construct a t-motive M S for this purpose, so that it has the GP property and its “periods”Ψ S (θ) from rigid analytic trivialization generate also the field K S ,