• Keine Ergebnisse gefunden

Furthermore, all modules considered are assumed to beleftmodules and finitely generated

N/A
N/A
Protected

Academic year: 2021

Aktie "Furthermore, all modules considered are assumed to beleftmodules and finitely generated"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

RepresentationTheory— ExerciseSheet6 TU Kaiserslautern

Jun.-Prof. Dr. CarolineLassueur FB Mathematik

BernhardB ¨ohmler

Due date:Wednesday, 3rd of February 2021, 10 a.m. WS 2020/21

Throughout,Gdenotes a finite group. Furthermore, all modules considered are assumed to beleftmodules and finitely generated.

A. Exercises for the tutorial.

Exercise1.

Let (F,O,k) be ap-modular system and writep:= J(O). LetLbe anOG-module. Verify that

· settingLF:=F⊗OLdefines anFG-module, and

· reduction modulopofL, that isL:=L/pLk⊗OLdefines akG-module.

Exercise2.

LetObe a complete discrete valuation ring and letF :=Frac(O) be the fraction field ofO. LetVbe a finitely generatedFG-module and let{v1, . . . ,vn}be anF-basis ofV. Prove that L:=OGv1+· · ·+OGvn⊆Vis anO-form ofV.

Exercise3.

LetObe a commutative ring. LetAbe a finitely-generatedO-algebra of finiteO-rank and lete∈Abe an idempotent element. LetVbe anA-module. Prove that

HomA(Ae,V)eV as EndA(V)-modules.

(2)

B. Exercises to hand in.

Exercise4.

LetObe a local commutative ring with unique maximal idealp:= J(O) and residue field k:=O/J(O).

(a) LetM,Nbe finitely generated freeO-modules.

(i) Let f : M −→ N is anO-linear map and f : M −→ N its reduction modulo p.

Prove that if f is surjective (resp. an isomorphism), then fis surjective (resp. an isomorphism).

(ii) Prove that if elements x1, . . . ,xn ∈ M (n ∈ Z1) are such that their images x1, . . .x2∈Mform ak-basis ofM, then{x1, . . . ,xn}is anO-basis ofM.

In particular, dimk(M)=rkO(M).

Deduce that any direct summand of a finitely generated freeO-module is free.

(b) Prove that ifM is a finitely generatedO-module, then the following conditions are equivalent:

(i) Mis projective;

(ii) Mis free.

[Hint: Use Nakayama’s Lemma.]

Exercise5.

LetObe a complete discrete valuation ring. LetAandBbe a finitely generatedO-algebras of finiteO-rank and let f :ABbe a surjectiveO-algebra homomorphism. Prove that:

(a) f mapsJ(A) ontoJ(B); and (b) f mapsA×ontoB×.

Exercise6.

LetObe a complete discrete valuation ring and writep:=J(O). LetAbe a finitely generated O-algebra of finiteO-rank. SetA:=A/pAand fora∈Awritea:=a+pA. Prove that:

(a) For every idempotentx∈A, there exists an idempotente∈Asuch thate=x.

(b) A×={a∈A|a∈A×}.

(c) Ife1,e2 ∈ Aare idempotents such thate1 = e2 then there is a unit u ∈ A× such that e1=ue2u1.

(d) The quotient morphismA→Ainduces a bijection between the central idempotents ofAand the central idempotents ofA.

Referenzen

ÄHNLICHE DOKUMENTE

R will always denote an associative and commutative ring with unit 1. For module theory over associative rings we mainly refer to [40]. If A has such an element we call A an

In particular it turns out that, for a faithful P -self-static self-tilting R-module P , the ring R is dense in the biendomorphism ring of P , and P S has P -dcc in the sense

The collection of all hereditary pretorsion classes of R-Mod is a set [9, Proposition VI.4.2, p. , or by σ[M] if we wish to refer to a specific subgenerator. Every pretorsion

A main theorem demonstrates that if M is a finitely generated product closed module such that M is projective in σ[M ] and every hereditary pretorsion class in σ[M] is M

The logic schematic pages in these volumes are updated when the LS page of the en- gineering document (number at top of each logic schematic) is changed by

New feautres, as well as changes, deletions, and additions to information in this manual, are indicated by bars in the margins or by a dot near the page number

If all nonzero finite dimensional rational representations of G are semisimple, i.e., every subrepresentation has a G-stable linear complement, then the ring of invariants R G

The high-reliability keyboard is also integrated with main logic, and can generate all 128 ASCII characters (upper and lower case, numerics, punc- tuation, and control)..