MHB Theorem on the Lengths of Modules - Cohn, Theorem 2.5

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Modules Theorem
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading "Introduction to Ring Theory" by P. M. Cohn (Springer Undergraduate Mathematics Series)

In Chapter 2: Linear Algebras and Artinian Rings, on Page 61, Cohn presents Theorem 2,5 concerning the lengths of modules.

Cohn indicates that the proof of this theorem is obvious/trivial ... BUT ... I am having trouble even getting started in formulating an explicit and formal proof ... can someone please help ...

The text of Theorem 2.5 is as follows:
View attachment 3325 Help will be appreciated,

Peter
 
Physics news on Phys.org
Peter said:
I am reading "Introduction to Ring Theory" by P. M. Cohn (Springer Undergraduate Mathematics Series)

In Chapter 2: Linear Algebras and Artinian Rings, on Page 61, Cohn presents Theorem 2,5 concerning the lengths of modules.

Cohn indicates that the proof of this theorem is obvious/trivial ... BUT ... I am having trouble even getting started in formulating an explicit and formal proof ... can someone please help ...

The text of Theorem 2.5 is as follows:
View attachment 3325 Help will be appreciated,

Peter

Hi Peter,

Recall the equation

$$\ell(M) - \ell(\text{ker }f) = \ell(N) - \ell(\text{coker}f) \quad (*)$$

If $f$ is injective, then $\text{ker }f = 0$ and thus $\ell(\text{ker }f) = 0$. So $(*)$ becomes $\ell(M) = \ell(N) - \ell(\text{coker }f)$, which shows that $\ell(M) \le \ell(N)$. If $f$ is surjective, then $\text{coker }f = 0$ and thus $\ell(\text{coker }f) = 0$. The equation $(*)$ reduces to $\ell(M) - \ell(\text{ker }f) = \ell(N)$, which shows that $\ell(M) \ge \ell(N)$.

Finally, suppose $f$ is an isomorphism. Then $f$ is both injective and surjective, so by the previous results, $\ell(M) \le \ell(N)$ and $\ell(M) \ge \ell(N)$. Consequently, $\ell(M) = \ell(N)$. Try proving the converse.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top