• Aucun résultat trouvé

Path cocycles in quantum Cayley trees and L2-cohomology

N/A
N/A
Protected

Academic year: 2021

Partager "Path cocycles in quantum Cayley trees and L2-cohomology"

Copied!
39
0
0

Texte intégral

(1)

Roland Vergnioux

Universit´e de Caen Basse-Normandie

Wien, april 12th, 2011

(2)

1 Introduction

Universal discrete quantum groups The main result

The strategy

2 Quantum Cayley trees The classical picture Quantum Cayley graphs Quantum path cocycles

(3)

Consider the unital∗-algebras defined by generators and relations:

Au(n) =huij |(uij) and (uij) unitaryi, Ao(n) =huij |uij =uij, (uij) unitaryi, with 1≤i,j ≤n. They become Hopf ∗-algebras with

∆(uij) =P

uik⊗ukj, S(uij) =uji, (uij) =δij. Moreover there exists a unique positive Haar integral h:A →C. We can consider the GNS construction:

H=L2(A,h), λ:A →B(H), M =λ(A)00⊂B(H).

Classical counterpart: A =CG,H =`2(G), withG a discrete group.

Heuristically : Au(n) =CFUn,Ao(n) =CFOn, whereFOn,FUn are

(4)

there are natural mapsAu(n)CFn,Ao(n)C(Z/2Z)∗n ;

we have Au(n)B for anyB associated with a unimodular discrete quantum group and some n ;

FUn,FOn have the Property of Rapid Decay ;

theC-algebras Au(n)red,Ao(n)red are simple, non-nuclear, exact ; M =λ(Ao(n))00, λ(Au(n))00 are solid II1 factors ;

FOn is K-amenable ;

FOn,FUn satisfy Haagerup’s Approximation Property.

[Banica, V., Vaes, Vander Vennet, Voigt, Brannan]

The case n= 2 behaves differently, e.g. Ao(I2) =C(SU−1(2)) has polynomial growth, and will be excluded in this talk.

(5)

For an ICC group G, we can take A = CG and consider the Hochschild cohomology groupsH1(A,λH) andH1(A,λM).

These groups are moreover right M-modules and we have β1(2)(G) = dimMH1(A,H) = dimMH1(A,M).

Recall thatβ1(2)(Fn) =n−1. In the case of the orthogonal universal discrete quantum groups we have the strongly contrasting result:

Theorem

For n≥3we have H1(Ao(n),H) =H1(Ao(n),M) = 0.

In particular β1(2)(Ao(n)) = 0. On the other handβ1(2)(Au(n))6= 0.

(6)

Consider a representation π :A →L(X) on a vector space X. A π-cocycle is a mapc :A →X such that

∀x,y ∈A c(xy) =π(x)c(y) +c(x)(y).

It is trivial ifc(x) =π(x)ξ−ξ(x) for some ξ∈X and all x∈A. H1(A,X) is the space of π-cocycles modulo trivial cocycles.

Theorem

For n≥3we have H1(Ao(n),H) =H1(Ao(n),M) = 0.

In particular β1(2)(Ao(n)) = 0. On the other handβ1(2)(Au(n))6= 0.

(7)

Theorem

For n≥3we have H1(Ao(n),H) =H1(Ao(n),M) = 0.

In particular β1(2)(Ao(n)) = 0. On the other handβ1(2)(Au(n))6= 0.

Remarks:

Collins-H¨artel-Thom: βk(2)(Ao(n)) = 0 fork ≥4,

βk(2)(Ao(n)) =β4−k(2) (Ao(n)), and Kyed: β0(2)(Ao(n)) = 0.

Corollary : δ(Ao)≤1, by [Connes-Shlyakhtenko].

δ(Ao) =δ(Ao) = 1 ifM is embeddable into Rω.

History : Leuven 11/2008, ArXiv v1 05/2009, ArXiv v2 03/2010

(8)

Theorem

For n≥3we have H1(Ao(n),H) =H1(Ao(n),M) = 0.

In particular β1(2)(Ao(n)) = 0. On the other handβ1(2)(Au(n))6= 0.

Strategy (for Ao):

Show that one particular cocycle vanishes: the path cocycle cg :A →Kg with values in the quantum Cayley tree

Prove that this cocycle is “sufficiently universal” and vanishes

“sufficiently strongly” (and use Property RD)

(9)

Algebraic version

X

A

cO 66

c

::t

tt tt tt tt t

A⊗A

T

ddIIIII IIIII T =m−(id⊗) is the usual boundary map, c0=id−1is “the” trivial cocycle on A. Fix a cocycle c :A →X.

(10)

Algebraic version

X

A

cO 66

c

::t

tt tt tt tt t

A⊗A

T

ddIIIII IIIII

mc

OO

Fix a cocycle c :A →X.

Observe that the cocycle relation for c :A →X reads

π(x)c(y) =c((m−id⊗)(x⊗y)) = (c◦T)(x⊗y) Definemc :A⊗A →X by puttingmc(x⊗y) =π(x)c(y).

(11)

Algebraic version

X

A

cO 66

c

::t

tt tt tt tt t

cg

$$I

II II II II I

A⊗A

T

ddIIIII IIIII

mc

OO

Fix a cocycle c :A → X.

Definemc :A⊗A →X by puttingmc(x⊗y) =π(x)c(y).

Assume we can “lift” c0 to a cocyclecg :A → A⊗A, ie T ◦cg =c0. We obtainc =mc◦cg.

(12)

Algebraic version

X

A

cO 66

c

::t

tt tt tt tt t

cg

$$I

II II II II I

A⊗A

T

ddIIIII IIIII

mc

OO

Fix a cocycle c :A → X.

Definemc :A⊗A →X by puttingmc(x⊗y) =π(x)c(y).

Assume we can “lift” c0 to a cocyclecg :A → A⊗A, ie T ◦cg =c0. We obtainc =mc ◦cg. Hence ifcg is trivial with fixed vectorξg ∈A⊗A, all cocyclesc are trivial with fixed vectorξ=mcg).

(13)

Hilbertian version

M

A

cO 66

c

::u

uu uu uu uu u

cg

$$I

II II II II

H⊗H1

T

ddIIIIIIIII

mc

OO

Fix a cocycle c :A → M.

Definemc :H⊗H1 →X by puttingmc(x⊗y) =π(x)c(y).

Assume we can “lift” c0 to a cocyclecg :A → H⊗H1, ie T ◦cg =c0. We obtainc =mc◦cg. Hence ifcg is trivial with fixed vectorξg ∈H⊗H1, all cocyclesc are trivial with fixed vectorξ=mcg).

With H1 ⊂H finite-dimensional...

(14)

The correct version

M

A

cO 66

c

::u

uu uu uu uu u

cg

$$I

II II II II

H⊗H1

T

ddIIIIIIIII

mc

OO

Fix a cocycle c :A → M.

Definemc :H⊗H1 →X by puttingmc(x⊗y) =π(x)c(y).

Assume we can “lift” c0 to a cocyclecg :A → Kg0, ie T ◦cg =c0. We obtainc =mc ◦cg. Hence ifcg is trivial with fixed vectorξg ∈M⊗H1, all cocyclesc are trivial with fixed vectorξ=mcg).

With Kg0⊂(A⊗A1)⊕KerT...

(15)

1 Introduction

Universal discrete quantum groups The main result

The strategy

2 Quantum Cayley trees The classical picture Quantum Cayley graphs Quantum path cocycles

(16)

In the case of the free group Fn=hSi, consider:

the Cayley graph of (Fn,S),

the`2-spaceKg of antisymmetric edges, for w ∈Fn, the sumcg(w)∈Kg of edges along the path from e to w: “path cocycle”

e

w

(17)

In the case of the free group Fn=hSi, consider:

the Cayley graph of (Fn,S),

the`2-spaceKg of antisymmetric edges, for w ∈Fn, the sumcg(w)∈Kg of edges along the path from e to w: “path cocycle”

e

w

This cocycle is non-trivial, even proper =⇒ a-T-menability.

A

(18)

Fix the following data:

a discrete groupG,

a finite subsetS ⊂G such that S−1 =S,e∈/ S.

The Cayley graph associated with (G,S) is given by:

the set of verticesG, the set of edges G×S,

the target map t: (α, γ)→αγ, the reversing map θ(α, γ) = (αγ, γ−1).

(19)

Fix the following data:

a discrete groupG,

a finite subsetS ⊂G such that S−1 =S,e∈/ S.

The HilbertianCayley graph associated with (G,S) is given by:

the set of verticesG, the set of edges G×S,

the target map t: (α, γ)→αγ, the reversing map θ(α, γ) = (αγ, γ−1).

(20)

Fix the following data:

a discrete groupG,

a finite subsetS ⊂G such that S−1 =S,e∈/ S.

The Hilbertian Cayley graph associated with (G,S) is given by:

the space of vertices H=`2(G), the set of edges G×S,

the target map t: (α, γ)→αγ, the reversing map θ(α, γ) = (αγ, γ−1).

(21)

Fix the following data:

a discrete groupG,

a finite subsetS ⊂G such that S−1 =S,e∈/ S.

The Hilbertian Cayley graph associated with (G,S) is given by:

the space of vertices H=`2(G),

the space of edgesK =H⊗H1, whereH1=`2(S), the target map t: (α, γ)→αγ,

the reversing map θ(α, γ) = (αγ, γ−1).

(22)

Fix the following data:

a discrete groupG,

a finite subsetS ⊂G such that S−1 =S,e∈/ S.

The Hilbertian Cayley graph associated with (G,S) is given by:

the space of vertices H=`2(G),

the space of edgesK =H⊗H1, whereH1=`2(S), the target operatorT :δα⊗δβ 7→δαβ,

the reversing map θ(α, γ) = (αγ, γ−1).

(23)

Fix the following data:

a discrete groupG,

a finite subsetS ⊂G such that S−1 =S,e∈/ S.

The Hilbertian Cayley graph associated with (G,S) is given by:

the space of vertices H=`2(G),

the space of edgesK =H⊗H1, whereH1=`2(S), the target operatorT :δα⊗δβ 7→δαβ,

the reversing operator Θ :δα⊗δγ7→δαγ⊗δγ−1.

(24)

Fix the following data:

a discrete groupG,

a finite subsetS ⊂G such that S−1 =S,e∈/ S.

The Hilbertian Cayley graph associated with (G,S) is given by:

the space of vertices H=`2(G),

the space of edgesK =H⊗H1, whereH1=`2(S), the target operatorT :δα⊗δβ 7→δαβ,

the reversing operator Θ :δα⊗δγ7→δαγ⊗δγ−1. Cred (G) acts on H and on the first factor ofH⊗p1H.

T and Θ are intertwining operators.

(25)

Fix the following data:

a discrete quantum group,

a finite subsetS ⊂G such that S−1 =S,e∈/ S.

The Hilbertian Cayley graph associated with (G,S) is given by:

the space of vertices H=`2(G),

the space of edgesK =H⊗H1, whereH1=`2(S), the target operatorT :δα⊗δβ 7→δαβ,

the reversing operator Θ :δα⊗δγ7→δαγ⊗δγ−1. Cred (G) acts on H and on the first factor ofH⊗p1H.

T and Θ are intertwining operators.

(26)

Fix the following data:

a discrete quantum group,

a finite subsetS ⊂IrrC such that ¯S =S and ˆ /∈S. The Hilbertian Cayley graph associated with (G,S) is given by:

the space of vertices H=`2(G),

the space of edgesK =H⊗H1, whereH1=`2(S), the target operatorT :δα⊗δβ 7→δαβ,

the reversing operator Θ :δα⊗δγ7→δαγ⊗δγ−1. Cred (G) acts on H and on the first factor ofH⊗p1H.

T and Θ are intertwining operators.

(27)

Fix the following data:

a discrete quantum group,

a finite subsetS ⊂IrrC such that ¯S =S and ˆ /∈S. The quantumCayley graph associated with (C,S) is given by:

the space of vertices H,

the space of edgesK =H⊗H1, whereH1=pSH, the target operatorT :δα⊗δβ 7→δαβ,

the reversing operator Θ :δα⊗δγ7→δαγ⊗δγ−1. Cred (G) acts on H and on the first factor ofH⊗p1H.

T and Θ are intertwining operators.

(28)

Fix the following data:

a discrete quantum group,

a finite subsetS ⊂IrrC such that ¯S =S and ˆ /∈S. The quantum Cayley graph associated with (C,S) is given by:

the space of vertices H,

the space of edgesK =H⊗H1, whereH1=pSH, the target operatorT =m:K →H,

the reversing operator Θ =· · ·, such thatTΘ =id⊗.

Cred (G) acts on H and on the first factor ofH⊗p1H.

T and Θ are intertwining operators.

(29)

Fix the following data:

a discrete quantum group,

a finite subsetS ⊂IrrC such that ¯S =S and ˆ /∈S. The quantum Cayley graph associated with (C,S) is given by:

the space of vertices H,

the space of edgesK =H⊗H1, whereH1=pSH, the target operatorT =m:K →H,

the reversing operator Θ =· · ·, such thatTΘ =id⊗.

Ared acts on H and on the first factor of H⊗p1H.

T and Θ are intertwining operators.

(30)

Quasi-classicalsubgraph Q0K ⊂K: maximal subspace on which Θ2=id.

Classical subgraphq0K ⊂Q0K: fixed points for the adjoint repr. of ˆA.

q0K,Q0K are not stable under the action ofA ! WhenA =CG,q0K =Q0K =K.

WhenA =Ao(n), q0K =Q0K 6=K. WhenA =Au(n), q0K 6=Q0K 6=K.

(31)

Quasi-classicalsubgraph Q0K ⊂K: maximal subspace on which Θ2=id.

Classical subgraphq0K ⊂Q0K: fixed points for the adjoint repr. of ˆA.

Case of Au(n) : q0K ⊂ Q0K ⊂ K.

edge α in the “real” graph I normed vector ξα∈q0K vertex v in the “real” graph I normed vectorζv ∈q0H operators T, Θ induced by the classical operations

(32)

Quasi-classicalsubgraph Q0K ⊂K: maximal subspace on which Θ2=id.

Classical subgraphq0K ⊂Q0K: fixed points for the adjoint repr. of ˆA.

Case of Au(n) : q0K ⊂ Q0K ⊂ K.

Why this picture ?

vertices v are irreducible corepresentations edges come from fusion rulesv⊗u =L

v0

weights depend on dimensions of corepresentations

(33)

Quantum Cayley trees Quantum path cocycles

Quantum path cocycles

We look for cocycles with values in the space of geometric, or antisymmetric, edges Kg =Ker(Θ +id).

Recall that T =m= (id⊗)Θ, so thatm−id⊗= 2T on Kg. Definition

A path cocycleis a cocycle cg :A →Kg such thatT ◦cg =c0.

e w

T

+1

−1

e

1 +1

w

+1

−1

(34)

We look for cocycles with values in the space of geometric, or antisymmetric, edges Kg =Ker(Θ +id).

Recall that T =m= (id⊗)Θ, so thatm−id⊗= 2T on Kg. Definition

A path cocycleis a cocycle cg :A →Kg such thatT ◦cg =c0.

Example: in the Cayley tree of Fn, denote bycg(w)∈Kg the sum of the antisymmetric edges on the path from the origin to w.

e w

T

+1

−1

e

1 +1

w

+1

−1

(35)

We consider a free product of Ao’s and Au’s withn ≥3.

We denote Kg0 the orthogonal projection ofA⊗A ontoKg. Proposition

If T is injective on Kg0, then there exists a unique path cocycle cg :A →Kg0.

In the case of Fn we haveKg0 =Kg ∩(A⊗A) andT is injective only on this dense subspace. On the “purely quantum part” of our quantum trees we have the much stronger property:

Theorem

T is injective with closed range on (1−Q0)Kg.

(36)

Proposition

In the case of Ao(Q), with Q ∈GL(n,C), QQ¯ ∈CIn, n ≥3, the target operator T :Kg →H is invertible. As a result there exists a unique path cocycle cg :A →Kg, and it is trivial.

The main reason is that q0Kg =Q0Kg comes from the half-line:

(0,1) (1,2) (2,3) (3,4) (4,5) (5,6)

We can even compute the fixed vector ξg =T−1ξ0 for cg:

ξg =X

n≥0

ξnn+1)−ξn+1n) pdimqαndimqαn+1dimqα1.

By property RD it lies in M⊗H1. =⇒ β1(2)(Ao(n)) = 0

(37)

The quasiclassical subgraph is a union of trees ⇒ T injective onKg0. Hence we have a unique path cocycle cg :A →Kg0.

Let γ ∈Mn⊗A be the fundamental corepresentation of Au(n).

We consider αkk andβk =γ¯γγ· · ·. Proposition

We have k(id⊗cg)(αk)k ≥C√

k andk(id⊗cg)(βk)k ≤D for all k and constants C , D >0.

As a result cg is neither trivial (bounded) nor proper.

Au(n) non-amenable =⇒ β1(2)(Au(n))6= 0

(38)

Heuristically, the Proposition holds because there is no multiplicity above the zigzag path (βk), and a lot of multiplicity above the straight line (αk):

(39)

IsM =λ(Ao(n))00 strongly solid ? IsM =λ(Ao(n))00 L2-rigid ?

Références

Documents relatifs

After recalling some notation about discrete quantum groups and classical Cayley graphs, we intro- duce in Section 2 the notion of path cocycle for discrete quantum groups and

In Lemma 4.4 we state some basic results about classical Cayley graphs and give a corepresentation-theoretic formulation of the extra assumptions introduced above. Propo- sition

Path cocycles on free quantum groups Vanishing of L 2

Heuristically, the Proposition holds because there is no multiplicity above the zigzag path (β k ), and a lot of multiplicity above the straight line (α k ):.. Quantum Cayley trees

Since our semiclassical approximation is based on a path integral representation of the evolution amplitude, we should only consider trajectories (real or complex) for which the

Stochastic convolution cocycles on a coalgebra are obtained by solving quantum stochastic differential equations.. We describe a direct approach to solving such QSDE’s by

In Section 6, the preceding results contribute to eliminate the potential V(hx) in the quantum scale and the problem is reduced to standard propagation estimates of quantum

The main result of this paper, which uses computer calculations as described in Section 4.2.2 of [HoP 89], contends that for all four maximal finite closed subgroups.. there