• Tidak ada hasil yang ditemukan

Introduction to Commutative Algebra Assignment - 4 1. Is +

N/A
N/A
Protected

Academic year: 2024

Membagikan "Introduction to Commutative Algebra Assignment - 4 1. Is +"

Copied!
2
0
0

Teks penuh

(1)

NPTEL COURSE - Introduction to Commutative Algebra

Assignment - 4

1. Is⊕i=1Zni, whereni ∈Na free Z module ?

Solution: Suppose ⊕i=1Zni is a free Z module, i.e., there exists a Z-module isomorphism φ : ⊕i=1Zni → ⊕i∈IZ. Let e1 ∈ ⊕i=1Zni be the vector with ¯1 at the first coordinate and ¯0 everywhere else. Then e1 is an element of order n1 and hence the order of φ(e1) divides n1. Hence φ(e1) = 0. This is a contradiction to the assumption that φ is an isomorphism. Therefore, φ can not be an isomorphism, i.e., ⊕i=1Zni is not a free module.

2. Let M be a finitely generated A module and φ : M → An be a surjective homomorphism.

(a) Ifφ(mi) = ei for i= 1, . . . , n, then prove thatM =hm1, . . . , mni ⊕kerφ.

(b) Deduce that kerφ is a finitely A-submodule of M.

Solution: (a) Sincehm1, . . . , mniand kerφare submodule ofM,hm1, . . . , mni⊕

kerφ is submodule of M. Let m∈M. Therefore φ(m)∈An. We have φ(m) =λ1e1+· · ·+λnen, where λi ∈A

1φ(m1) +· · ·+λnφ(mn)

=φ(λ1m1+· · ·+λnmn).

and φ(m −λ1m1 +· · · +λnmn) = 0. Therefore m ∈ hm1, . . . , mni+ kerφ.

We can observe that hm1, . . . , mni ∩kerφ = 0. Hence M is a submodule of hm1, . . . , mni ⊕kerφ.

(b) We have an isomorphism

kerφ+hm1, . . . , mni

hm1, . . . , mni ∼= kerφ

hm1, . . . , mni ∩kerφ Note that kerhmφ+hm1,...,mni

1,...,mni is finitely generated and hm1, . . . , mni ∩kerφ = 0.

Therefore kerφ is finitely generated.

1

(2)

3. Let R = k[x2, xy, xy2, xy3, . . .] be polynomial ring over a field k. Prove that I =hx2, xy, xy2, xy3, . . .i is not finitely generated ideal overR.

Solution: Suppose I is finitely generated, say generated by {f1, . . . , fr}.

It is clear that there exist a positive integer n > 0 such that each fi ∈ k[x2, xy, xy2, xy3, . . . , xyn], for all i = 1, . . . , r. Since xyn+1 ∈I, we can write xyn+1 =Pr1

j=1αjfij for someαj ∈R and {fi1, . . . , fir

1} ⊆ {f1, . . . , fr}.

Let S =k[x, y]. Considering the above expression for xyn+1 inS, and setting fij =xgij for somegij ∈S, we get

yn+1 =

r1

X

j=1

αjgij.

Now putting x= 0, we get that yn+1 =

r1

X

j=1

βjg0i

j,

where βj’s are either 0 or in k (since each monomial in αj is a multiple of x, except constant term) and g0i

j contains only powers of y. Note also that the maximum power of yappearing in the terms offij’s isn. Therefore, the above equation contradicts the linear independence of the set {1, y, . . . , yn+1} over k. This contradiction says that our assumption that I is finitely generated is wrong. Therefore I is not finitely generated ideal in R.

2

Referensi

Dokumen terkait

This research paper organization of Wrong Education Accepted By Raizo In James Mcteigue ’s Ninja Assassin Movie (2009) by An Individual Psychology Approach is as follows: Chapter

A remarkable and well known result is that the harmonic measure of a transient nearest neighbor random walk on a finitely generated free group is Markovian [6, 19, 25].. This can

Grim as this may sound, some pain is necessary ˘ it´s a signal from our brain that something is wrong in our body, something we need to address to protect our health and well-being..

The underlying premise of capacity control model is that the travel time on any service related with the volume of traffic on this route.

Symptoms are the way our bodies tell us that there are health problems. Symptoms can help tell us what is wrong in our body. Symptoms tell you that there are changes in how your body

Based on the limitation of the problem above, I formulate the research problem as follows, is it true that the theme of this movie script is a reflection of the concepts

True speed 𝑉𝑇 of an aircraft at an altitude h meters above sea level in terms of Equivalent speed 𝑉𝐸 is given as where 𝜌 is density a.. In the experiment to estimate the drag polar the

Score: 0 Accepted Answers: Deep Blue As discussed in the “Artificial Intelligence: Search Methods for Problem Solving - Prologue”, this course is about Problem solving Model Based