• Keine Ergebnisse gefunden

Martin Finn-Sell

N/A
N/A
Protected

Academic year: 2022

Aktie "Martin Finn-Sell"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Representation Theory of Groups - Blatt 7

11:30-12:15, Seminarraum 9, Oskar-Morgenstern-Platz 1, 2.Stock

http://www.mat.univie.ac.at/~gagt/rep_theory2017

Goulnara Arzhantseva

goulnara.arzhantseva@univie.ac.at

Martin Finn-Sell

martin.finn-sell@univie.ac.at

On this exercise sheet we will consider the (left) Haar measureµon a locally compact group G. This exists, and has the property that it is left invariant and unique up to a scalar function (we will not prove existence or uniqueness, but you can use them).

Question 1. (Constructing the modular function) Use the properties of the left Haar measure µ onG to show that there is a functionc : G → R such thatµ(Eg) = c(g)µ(E) for every measurable subsetE⊂G.

Remark: the modular function is continuous - look a proof of this up.

A groupGis called unimodular if the functioncis identically equal to1(i.ec(g) = 1for allg∈G).

Question 2. Let G be a compact group and letµ be the left Haar measure. Show that G is unimodular and thatµ(G)<∞.

Question 3. (A non-unimodular group) LetGbe the group generated by matrices of the form:

a b

0 1

wherea∈R>0andb∈R. Show thata−2dadbis a left Haar measure anda−1dadbis a right Haar measure forG.

Question 4. Outline an argument that might show thatSL(2,R)is unimodular.

1

Referenzen

ÄHNLICHE DOKUMENTE

What is the length (=number of intermediate hash values) of a verification path in the Merkle tree having n transations. What is it for a k-ary tree with

What if in the argument showing that the Existential forgery is always pos- sible we first choose an arbitrary x and then compute the corresponding signature y.. Assume that the

What is the length (=number of intermediate hash values) of a verification path in the Merkle tree having n transations.. What is it for a k-ary tree with

Show that the matrix obtained from the linear equations of the Linear Feedback Shift register is invertible mod 2.

The operator ∆ encodes what happens to neighbours - if we feed into this the charac- teristic functions of subsets of vertices with size less than | V (X)/2 |, we can connect

What is the length (=number of intermediate hash values) of a verification path in the Merkle tree having n transations? What is it for a k-ary tree with n leaves?. Question 18. Why

Representation Theory of Groups - Blatt 6. 11:30-12:15, Seminarraum 9, Oskar-Morgenstern-Platz

It is known that weak containment of the trivial representation in π is related to the spectrum of π(µ). We will consider an example that shows negative behaviour in