PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Medium Entry average rating: No information on entry rating
[parent] proof of Nakayama's lemma (Proof)

Let $ X = \{x_1, x_2, \dots, x_n\}$ be a minimal set of generators for $ M$, in the sense that $ M$ is not generated by any proper subset of $ X$.

Elements of $ \mathfrak{a}M$ can be written as linear combinations $ \sum a_i x_i$, where $ a_i \in \mathfrak{a}$.

Suppose that $ \vert X\vert > 0$. Since $ M = \mathfrak{a}M$, we can express $ x_1$ as a such a linear combination:

$\displaystyle x_1 = \sum a_i x_i.$
Moving the term involving $ a_1$ to the left, we have
$\displaystyle (1 - a_1)x_1 = \sum_{i > 1} a_i x_i.$
But $ a_1 \in J(R)$, so $ 1-a_1$ is invertible, say with inverse $ b$. Therefore,
$\displaystyle x_1 = \sum_{i > 1} b a_i x_i.$
But this means that $ x_1$ is redundant as a generator of $ M$, and so $ M$ is generated by the subset $ \{x_2, x_3, \dots, x_n\}$. This contradicts the minimality of $ X$.

We conclude that $ \vert X\vert = 0$ and therefore $ M = 0$.



"proof of Nakayama's lemma" is owned by mclase.
(view preamble)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: subset, inverse, invertible, term, linear combinations, proper subset, generated by, generators, minimal

This is version 2 of proof of Nakayama's lemma, born on 2002-11-03, modified 2002-11-03.
Object id is 3564, canonical name is ProofOfNakayamasLemma.
Accessed 3110 times total.

Classification:
AMS MSC13C99 (Commutative rings and algebras :: Theory of modules and ideals :: Miscellaneous)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)