• Keine Ergebnisse gefunden

K n the set of row vectors, B Q K the set ofcolumnvectors

N/A
N/A
Protected

Academic year: 2021

Aktie "K n the set of row vectors, B Q K the set ofcolumnvectors"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

der Universitat Munchen Set 11

Prof. Dr. B. Pareigis

Problem set for

Advanced Algebra

(41) LetK beaeld. Showthat(KK)-Modisnot equivalentto

K-Mod.

(42) Show that R-Mod6

=

C-Mod (not equivalent).

(43) Let K be a eld, B := M

n (K),

K P

B

:= K n

the set of row

vectors,

B Q

K

the set ofcolumnvectors. Findf :P

B

Q !K

and g : Q

K

P ! B, such that (K;B;P;Q;f;g) is a Morita

context. Is this a strict Morita context? Determine the center

of B and the set of twosided ideals of B.

(44) Determine the image of the maps f and g in the canonical

Morita context (A;B;P;Q;f;g) for

(a) A :=Z=(6)and P :=Z=(2),

(b) A :=Z=(4)and P :=Z=(4)Z=(2),

(c) A :=Z=(6)and P :=Z=(6)Z=(2).

Referenzen

ÄHNLICHE DOKUMENTE

For problems without p˚q, you do not need to write up your solutions, but it is highly recommended that you think through them before the next

For each edge, the first number is the capacity, the second number is

Zavershynskyi, “On the complexity of higher order abstract Voronoi dia- grams,” Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP’13),

The Influence of Various Basis Sets in Ab-initio Crystal Orbital Studies is Reported for Hydrogen Fluoride Chain.. The ab-initio SCF method [1] seems to be a now well

on the view being proposed here, the revisions of corpora expressible in L** [language with conditionals] are parasitic on the revisions of corpora expressible in L

22 The examples of orthogonal maps from the ancient and classical world (Neolithic rock art, Babylonian clay tablets, the Forma Urbis Romae [203 – 208 a.d. ]) or from the Middle

Cohomology Constructivism Relativization by internalization Internalizing higher direct images Flabby objects In the effective topos.. How not to

The idea behind the core algorithm is the hope that the optimal solution for the fractional knapsack problem as computed by the greedy algorithm on page 105, ¯ x, typically differs