• Keine Ergebnisse gefunden

Pareigis Problem set for Quantum Groups and Noncommutative Geometry (9) Consider the followingsubset H of the set of complex22-matrices: H

N/A
N/A
Protected

Academic year: 2021

Aktie "Pareigis Problem set for Quantum Groups and Noncommutative Geometry (9) Consider the followingsubset H of the set of complex22-matrices: H"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

der Universitat Munchen Set 3

Prof. Dr. B. Pareigis

Problem set for

Quantum Groups and Noncommutative Geometry

(9) Consider the followingsubset H of the set of complex22-matrices:

H :=

x y

y x

2M

C

(22)jx;y2C

We callH the set of Hamiltonian quaternions. For

h =

x y

y x

wedene:

h:=

x y

y x

Show:

(a) h

h =(jxj 2

+jyj 2

)E (E the unit matrix),

(b) H is a real subalgebra of the complex algebraof 22-matrices.

(c) H isadivisionalgebra,i.e.eachelementdierentfromzerohasaninverseunder

the multiplication.

(d) Let

I :=

i 0

0 i

J :=

0 1

1 0

K :=

0 i

i 0

Then E;I;J;K isanR-basis ofH anwehavethe followingmultiplicationtable:

I 2

=J 2

=K 2

= 1

IJ = JI =K JK = KJ =I KI = IK =J:

(10) Compute the H-points A 2j0

(H) of the quantum plane.

(11) Denition: LetX beangeometricspacewithaÆnealgebraA. LetDbeanalgebra.

Anaturaltransformation :DX !A iscalledanalgebraaction if (B)(-;p):D

!A(B) =B is analgebra homomorphismfor allB and all p2X(B).

Give proofsfor:

(2)

Theorem: LetDbeanalgebraand:DX(-) !A(-)beanalgebraaction. Then

there exists a unique algebrahomomorphismf :D !A such that the diagram

AX(B) B -

(B) (B)

@

@

@

@

@ R DX(B)

? f1

commutes.

(12) Determine explicitly the dual coalgebra A

of the algebra A := Khxi=(x 2

). (Hint:

Finda basis for A.)

Referenzen

ÄHNLICHE DOKUMENTE

We want to have a collection with exactly one (arbitrary) picture of each person and use the following randomized algorithm: We keep choosing a picture uniformly at random

Suppose that we roll a standard fair dice seventeen times (independently).. What is the probability that the sum is divisible

Remember that it is possible to solve the integer version of the knapsack problem in time O(nP ), where P is the sum of all profits..

It also starts with an arbitrary initial tour, but instead of selecting only two edges of the current tour, k-Opt selects at most k edges of the current tour and replaces them by

In a quiz show three participants can win a trip to Hawaii if they win the following game: Each participant gets independently and uniformly at random either a red or a green hat;

Show that if one cluster gains or loses a total of at least 2kd points within a single iteration, then the potential drops by at least 4ε 2 /n..

We will now derive some properties of the von Neumann entropy that will be useful in

You may use the ‘master theorem’ (this theorem is explained in many books and lecture notes, see for example the notes from Avrim/Manuel Blum’s course at