Subproduct systems and superproduct systems (or: behind the scenes - - PowerPoint PPT Presentation

subproduct systems and superproduct systems or behind the
SMART_READER_LITE
LIVE PREVIEW

Subproduct systems and superproduct systems (or: behind the scenes - - PowerPoint PPT Presentation

Subproduct systems and superproduct systems (or: behind the scenes of the dilation theory of CP-semigroups) Orr Shalit Technion ISI Bangalore, December 2016 1 / 27 This talk is part of my joint work in progress with Michael Skeide 2 / 27


slide-1
SLIDE 1

Subproduct systems and superproduct systems (or: behind the scenes of the dilation theory of CP-semigroups)

Orr Shalit

Technion

ISI Bangalore, December 2016

1 / 27

slide-2
SLIDE 2

This talk is part of my joint work in progress with Michael Skeide

2 / 27

slide-3
SLIDE 3

Background

The objects of study

S a semigroup of Rk

+, such that 0 ∈ S.

T = (Ts)s∈S a family of maps on a unital C*-algebra B.

3 / 27

slide-4
SLIDE 4

Background

The objects of study

S a semigroup of Rk

+, such that 0 ∈ S.

T = (Ts)s∈S a family of maps on a unital C*-algebra B.

  • T is said to be a CP-semigroup (over S) if
  • 1. Ts is a (contractive) CP map for all s,
  • 2. T0 = idB,
  • 3. Ts+t = Ts ◦ Tt, for all s, t ∈ S.

3 / 27

slide-5
SLIDE 5

Background

The objects of study

S a semigroup of Rk

+, such that 0 ∈ S.

T = (Ts)s∈S a family of maps on a unital C*-algebra B.

  • T is said to be a CP-semigroup (over S) if
  • 1. Ts is a (contractive) CP map for all s,
  • 2. T0 = idB,
  • 3. Ts+t = Ts ◦ Tt, for all s, t ∈ S.
  • If Ts is a ∗-endomorphism for all s, then T is said to be an E-semigroup.

3 / 27

slide-6
SLIDE 6

Background

The objects of study

S a semigroup of Rk

+, such that 0 ∈ S.

T = (Ts)s∈S a family of maps on a unital C*-algebra B.

  • T is said to be a CP-semigroup (over S) if
  • 1. Ts is a (contractive) CP map for all s,
  • 2. T0 = idB,
  • 3. Ts+t = Ts ◦ Tt, for all s, t ∈ S.
  • If Ts is a ∗-endomorphism for all s, then T is said to be an E-semigroup.
  • Case of greatest interest: S = R+, then CP-semigroups T = (Tt)t≥0

(and E-semigroups) have quantum dynamical interpretations.

3 / 27

slide-7
SLIDE 7

Background

The objects of study

S a semigroup of Rk

+, such that 0 ∈ S.

T = (Ts)s∈S a family of maps on a unital C*-algebra B.

  • T is said to be a CP-semigroup (over S) if
  • 1. Ts is a (contractive) CP map for all s,
  • 2. T0 = idB,
  • 3. Ts+t = Ts ◦ Tt, for all s, t ∈ S.
  • If Ts is a ∗-endomorphism for all s, then T is said to be an E-semigroup.
  • Case of greatest interest: S = R+, then CP-semigroups T = (Tt)t≥0

(and E-semigroups) have quantum dynamical interpretations. (UCP) t → Tt(a) evolution in an irreversible quantum system (∗auto) t → αt(a) evolution in a reversible quantum system

3 / 27

slide-8
SLIDE 8

Background

The objects of study II

0 ∈ S ⊆ Rk

+.

T = (Ts)s∈S a CP-semigroup on a unital C*-algebra B.

4 / 27

slide-9
SLIDE 9

Background

The objects of study II

0 ∈ S ⊆ Rk

+.

T = (Ts)s∈S a CP-semigroup on a unital C*-algebra B. Example If T1, . . . , Tk are k commuting CP maps, then we get a CP-semigroup (Ts)s∈Nk over S = Nk : Ts = T s1

1 ◦ · · · ◦ T sk k

where s = (s1, . . . , sk) ∈ Nk. Every CP-semigroup over S = Nk arises this way.

4 / 27

slide-10
SLIDE 10

Background

Bhat’s dilation theorem1

Theorem (Bhat, 1996) Let T = (Tt)t≥0 be a CP-semigroup on B(H). Then there exists a Hilbert space K containing H, and an E-semigroup ϑ = (ϑt)t≥0 on B(K), such that Tt(A) = PHϑt(A)PH , for all t ≥ 0 and A ∈ B(H). B(K)

ϑt

B(K)

PH•PH

  • B(H)

i

  • Tt

B(H)

1Result also works for N instead of R+ (see abstract). 5 / 27

slide-11
SLIDE 11

Background

Bhat’s dilation theorem

Theorem (Bhat, 1996) Let T = (Tt)t≥0 be a CP-semigroup on B(H). Then there exists a Hilbert space K containing H, and an E-semigroup ϑ = (ϑt)t≥0 on B(K), such that Tt(PHAPH) = PHϑt(A)PH , for all t ≥ 0 and A ∈ B(K). B(K)

ϑt

  • PH•PH
  • B(K)

PH•PH

  • B(H)

Tt

B(H)

6 / 27

slide-12
SLIDE 12

Background

Bhat’s dilation theorem

Theorem (Bhat, 1996) Let T = (Tt)t≥0 be a CP-semigroup on B(H). Then there exists a Hilbert space K containing H, and an E-semigroup ϑ = (ϑt)t≥0 on B(K), such that Tt(A) = PHϑt(A)PH , for all t ≥ 0 and A ∈ B(H).

7 / 27

slide-13
SLIDE 13

Background

Bhat’s dilation theorem

Theorem (Bhat, 1996) Let T = (Tt)t≥0 be a CP-semigroup on B(H). Then there exists a Hilbert space K containing H, and an E-semigroup ϑ = (ϑt)t≥0 on B(K), such that Tt(A) = PHϑt(A)PH , for all t ≥ 0 and A ∈ B(H). Interpretation An irreversible quantum dynamical system can be embedded in a reversible

  • ne (ϑ can be extended to a group of *-automorphisms).

7 / 27

slide-14
SLIDE 14

Background

Bhat’s dilation theorem

Theorem (Bhat, 1996) Let T = (Tt)t≥0 be a CP-semigroup on B(H). Then there exists a Hilbert space K containing H, and an E-semigroup ϑ = (ϑt)t≥0 on B(K), such that Tt(A) = PHϑt(A)PH , for all t ≥ 0 and A ∈ B(H). Interpretation An irreversible quantum dynamical system can be embedded in a reversible

  • ne (ϑ can be extended to a group of *-automorphisms).

Application An index for quantum dynamical semigroups (Bhat).

7 / 27

slide-15
SLIDE 15

Background

Bhat’s dilation theorem

Theorem (Bhat, 1996) Let T = (Tt)t≥0 be a CP-semigroup on B(H). Then there exists a Hilbert space K containing H, and an E-semigroup ϑ = (ϑt)t≥0 on B(K), such that Tt(A) = PHϑt(A)PH , for all t ≥ 0 and A ∈ B(H). Interpretation An irreversible quantum dynamical system can be embedded in a reversible

  • ne (ϑ can be extended to a group of *-automorphisms).

Application An index for quantum dynamical semigroups (Bhat). Remark Different notions of dilations of CP-semigroups have been studied since 70s: Davies, Evans-Lewis, Hudson-Parthasarathy, Kummerer, Sauvageout ...

7 / 27

slide-16
SLIDE 16

The problem

We study the possible generalizations of Bhat’s theorem to CP-semigroups

  • n a unital C*-algebra, paramaterized by a semigroup S, and beyond.

8 / 27

slide-17
SLIDE 17

The problem

We study the possible generalizations of Bhat’s theorem to CP-semigroups

  • n a unital C*-algebra, paramaterized by a semigroup S, and beyond.

For the presentation, narrow the scope: Let T = (Ts)s∈S be a CP-semigroup over S ⊆ Rk

+, acting on a von

Neumann algebra B, such that every Ts is a normal map.

8 / 27

slide-18
SLIDE 18

The problem

We study the possible generalizations of Bhat’s theorem to CP-semigroups

  • n a unital C*-algebra, paramaterized by a semigroup S, and beyond.

For the presentation, narrow the scope: Let T = (Ts)s∈S be a CP-semigroup over S ⊆ Rk

+, acting on a von

Neumann algebra B, such that every Ts is a normal map. Definition A dilation of T is a triple (A, ϑ, p), where A is a von Neumann algebra, ϑ = (ϑs)s∈S is a semigroup of normal *-endomorphism, and p ∈ A is a projection, such that B = pAp, and such that Ts(b) = pϑs(b)p for all b ∈ B, s ∈ S. A

ϑs

A

p•p

  • B

i

  • Ts

B

Arveson, Bhat, Bhat-Skeide, Markiewicz, Muhly-Solel, Powers, SeLegue, S., S.-Solel, Solel, Vernik,. . .

8 / 27

slide-19
SLIDE 19

The problem

We study the possible generalizations of Bhat’s theorem to CP-semigroups

  • n a unital C*-algebra, paramaterized by a semigroup S, and beyond.

For the presentation, narrow the scope: Let T = (Ts)s∈S be a CP-semigroup over S ⊆ Rk

+, acting on a von

Neumann algebra B, such that every Ts is a normal map. Definition A dilation of T is a triple (A, ϑ, p), where A is a von Neumann algebra, ϑ = (ϑs)s∈S is a semigroup of normal *-endomorphism, and p ∈ A is a projection, such that B = pAp, and such that Ts(b) = pϑs(b)p for all b ∈ B, s ∈ S. Questions

  • 1. Find necessary & sufficient conditions for existence of dilation.
  • 2. For fixed k, does every CP-semigroup over Nk have a dilation?

.

9 / 27

slide-20
SLIDE 20

Subproduct systems and dilations

The GNS representation (E, ξ) of a CP map

Let T : B → B be a CP map. Then there exists a unique W*-correspondence2 E over B, and a vector ξ ∈ E, such that span BξB

s = E

and ξ, bξ = T(b) for all b ∈ B.

2A bimodule over B, that has a B-valued inner product. Equivalently, one may use

Skeide’s von Neumann modules (and we do).

10 / 27

slide-21
SLIDE 21

Subproduct systems and dilations

The GNS representation (E, ξ) of a CP map

Let T : B → B be a CP map. Then there exists a unique W*-correspondence2 E over B, and a vector ξ ∈ E, such that span BξB

s = E

and ξ, bξ = T(b) for all b ∈ B.

Construction: on E0 = B ⊗ B put inner product a ⊗ b, c ⊗ d = b∗T(a∗c)d and bimodule operation a(x ⊗ y)d = ax ⊗ yd.

2A bimodule over B, that has a B-valued inner product. Equivalently, one may use

Skeide’s von Neumann modules (and we do).

10 / 27

slide-22
SLIDE 22

Subproduct systems and dilations

The GNS representation (E, ξ) of a CP map

Let T : B → B be a CP map. Then there exists a unique W*-correspondence2 E over B, and a vector ξ ∈ E, such that span BξB

s = E

and ξ, bξ = T(b) for all b ∈ B.

Construction: on E0 = B ⊗ B put inner product a ⊗ b, c ⊗ d = b∗T(a∗c)d and bimodule operation a(x ⊗ y)d = ax ⊗ yd. Complete the quotient, and put ξ = 1 ⊗ 1.

2A bimodule over B, that has a B-valued inner product. Equivalently, one may use

Skeide’s von Neumann modules (and we do).

10 / 27

slide-23
SLIDE 23

Subproduct systems and dilations

The GNS representation (E, ξ) of a CP map

Let T : B → B be a CP map. Then there exists a unique W*-correspondence2 E over B, and a vector ξ ∈ E, such that span BξB

s = E

and ξ, bξ = T(b) for all b ∈ B.

Construction: on E0 = B ⊗ B put inner product a ⊗ b, c ⊗ d = b∗T(a∗c)d and bimodule operation a(x ⊗ y)d = ax ⊗ yd. Complete the quotient, and put ξ = 1 ⊗ 1. This works: ξ, bξ

2A bimodule over B, that has a B-valued inner product. Equivalently, one may use

Skeide’s von Neumann modules (and we do).

10 / 27

slide-24
SLIDE 24

Subproduct systems and dilations

The GNS representation (E, ξ) of a CP map

Let T : B → B be a CP map. Then there exists a unique W*-correspondence2 E over B, and a vector ξ ∈ E, such that span BξB

s = E

and ξ, bξ = T(b) for all b ∈ B.

Construction: on E0 = B ⊗ B put inner product a ⊗ b, c ⊗ d = b∗T(a∗c)d and bimodule operation a(x ⊗ y)d = ax ⊗ yd. Complete the quotient, and put ξ = 1 ⊗ 1. This works: ξ, bξ = 1 ⊗ 1, b ⊗ 1

2A bimodule over B, that has a B-valued inner product. Equivalently, one may use

Skeide’s von Neumann modules (and we do).

10 / 27

slide-25
SLIDE 25

Subproduct systems and dilations

The GNS representation (E, ξ) of a CP map

Let T : B → B be a CP map. Then there exists a unique W*-correspondence2 E over B, and a vector ξ ∈ E, such that span BξB

s = E

and ξ, bξ = T(b) for all b ∈ B.

Construction: on E0 = B ⊗ B put inner product a ⊗ b, c ⊗ d = b∗T(a∗c)d and bimodule operation a(x ⊗ y)d = ax ⊗ yd. Complete the quotient, and put ξ = 1 ⊗ 1. This works: ξ, bξ = 1 ⊗ 1, b ⊗ 1 = 1∗T(1∗b)1 = T(b).

2A bimodule over B, that has a B-valued inner product. Equivalently, one may use

Skeide’s von Neumann modules (and we do).

10 / 27

slide-26
SLIDE 26

Subproduct systems and dilations

The GNS representation (E, ξ) of a CP map

Let T : B → B be a CP map. Then there exists a unique W*-correspondence3 E over B, and a vector ξ ∈ E, such that span BξB

s = E

and ξ, bξ = T(b) for all b ∈ B.

Construction: on E0 = B ⊗ B put inner product a ⊗ b, c ⊗ d = b∗T(a∗c)d and bimodule operation a(x ⊗ y)d = ax ⊗ yd. Complete the quotient, and put ξ = 1 ⊗ 1. This works: ξ, bξ = 1 ⊗ 1, b ⊗ 1 = 1∗T(1∗b)1 = T(b).

3A bimodule over B, that has a B-valued inner product. Equivalently, one may use

Skeide’s von Neumann modules (and we do).

11 / 27

slide-27
SLIDE 27

Subproduct systems and dilations

The GNS representation of a CP-semigroup

Let T = (Ts)s∈S be a CP-semigroup on B. For every s, let (Es, ξs) be the GNS representation of Ts.

12 / 27

slide-28
SLIDE 28

Subproduct systems and dilations

The GNS representation of a CP-semigroup

Let T = (Ts)s∈S be a CP-semigroup on B. For every s, let (Es, ξs) be the GNS representation of Ts. For s, t ∈ S, define ws,t : Es+t → Es ⊙ Et ( really Es⊙sEt ) by ws,t : aξs+tb → aξs ⊙ ξtb, and then extend linearly.

12 / 27

slide-29
SLIDE 29

Subproduct systems and dilations

The GNS representation of a CP-semigroup

Let T = (Ts)s∈S be a CP-semigroup on B. For every s, let (Es, ξs) be the GNS representation of Ts. For s, t ∈ S, define ws,t : Es+t → Es ⊙ Et ( really Es⊙sEt ) by ws,t : aξs+tb → aξs ⊙ ξtb, and then extend linearly. We check: aξs ⊙ ξtb, aξs ⊙ ξtb

12 / 27

slide-30
SLIDE 30

Subproduct systems and dilations

The GNS representation of a CP-semigroup

Let T = (Ts)s∈S be a CP-semigroup on B. For every s, let (Es, ξs) be the GNS representation of Ts. For s, t ∈ S, define ws,t : Es+t → Es ⊙ Et ( really Es⊙sEt ) by ws,t : aξs+tb → aξs ⊙ ξtb, and then extend linearly. We check: aξs ⊙ ξtb, aξs ⊙ ξtb = ξtb, aξs, aξsξtb

12 / 27

slide-31
SLIDE 31

Subproduct systems and dilations

The GNS representation of a CP-semigroup

Let T = (Ts)s∈S be a CP-semigroup on B. For every s, let (Es, ξs) be the GNS representation of Ts. For s, t ∈ S, define ws,t : Es+t → Es ⊙ Et ( really Es⊙sEt ) by ws,t : aξs+tb → aξs ⊙ ξtb, and then extend linearly. We check: aξs ⊙ ξtb, aξs ⊙ ξtb = ξtb, aξs, aξsξtb = b∗ξt, Ts(a∗a)ξtb

12 / 27

slide-32
SLIDE 32

Subproduct systems and dilations

The GNS representation of a CP-semigroup

Let T = (Ts)s∈S be a CP-semigroup on B. For every s, let (Es, ξs) be the GNS representation of Ts. For s, t ∈ S, define ws,t : Es+t → Es ⊙ Et ( really Es⊙sEt ) by ws,t : aξs+tb → aξs ⊙ ξtb, and then extend linearly. We check: aξs ⊙ ξtb, aξs ⊙ ξtb = ξtb, aξs, aξsξtb = b∗ξt, Ts(a∗a)ξtb = = b∗Tt(Ts(a∗a))b

12 / 27

slide-33
SLIDE 33

Subproduct systems and dilations

The GNS representation of a CP-semigroup

Let T = (Ts)s∈S be a CP-semigroup on B. For every s, let (Es, ξs) be the GNS representation of Ts. For s, t ∈ S, define ws,t : Es+t → Es ⊙ Et ( really Es⊙sEt ) by ws,t : aξs+tb → aξs ⊙ ξtb, and then extend linearly. We check: aξs ⊙ ξtb, aξs ⊙ ξtb = ξtb, aξs, aξsξtb = b∗ξt, Ts(a∗a)ξtb = = b∗Tt(Ts(a∗a))b = b∗Tt+s(a∗a)b

12 / 27

slide-34
SLIDE 34

Subproduct systems and dilations

The GNS representation of a CP-semigroup

Let T = (Ts)s∈S be a CP-semigroup on B. For every s, let (Es, ξs) be the GNS representation of Ts. For s, t ∈ S, define ws,t : Es+t → Es ⊙ Et ( really Es⊙sEt ) by ws,t : aξs+tb → aξs ⊙ ξtb, and then extend linearly. We check: aξs ⊙ ξtb, aξs ⊙ ξtb = ξtb, aξs, aξsξtb = b∗ξt, Ts(a∗a)ξtb = = b∗Tt(Ts(a∗a))b = b∗Tt+s(a∗a)b = aξs+tb, aξs+tb. ws,t is an isometry!

12 / 27

slide-35
SLIDE 35

Subproduct systems and dilations

Subproduct systems4

Definition A subproduct system is a family E = (Es)s∈S of B-correspondences, together with a family {ws,t : Es+t → Es ⊙ Et} of isometric bimodule maps, which iterate associatively

4Inclusion systems by Bhat-Mukherjee. 13 / 27

slide-36
SLIDE 36

Subproduct systems and dilations

Subproduct systems4

Definition A subproduct system is a family E = (Es)s∈S of B-correspondences, together with a family {ws,t : Es+t → Es ⊙ Et} of isometric bimodule maps, which iterate associatively, i.e., the following diagram is commutative (∀r, s, t): Er+s+t

  • Er ⊙ Es+t
  • Er+s ⊙ Et

Er ⊙ Es ⊙ Et

4Inclusion systems by Bhat-Mukherjee. 13 / 27

slide-37
SLIDE 37

Subproduct systems and dilations

Subproduct systems4

Definition A subproduct system is a family E = (Es)s∈S of B-correspondences, together with a family {ws,t : Es+t → Es ⊙ Et} of isometric bimodule maps, which iterate associatively, i.e., the following diagram is commutative (∀r, s, t): Er+s+t

  • Er ⊙ Es+t
  • Er+s ⊙ Et

Er ⊙ Es ⊙ Et

A product system is a subproduct system in which ws,t are all unitaries.

4Inclusion systems by Bhat-Mukherjee. 13 / 27

slide-38
SLIDE 38

Subproduct systems and dilations

Subproduct systems4

Definition A subproduct system is a family E = (Es)s∈S of B-correspondences, together with a family {ws,t : Es+t → Es ⊙ Et} of isometric bimodule maps, which iterate associatively, i.e., the following diagram is commutative (∀r, s, t): Er+s+t

  • Er ⊙ Es+t
  • Er+s ⊙ Et

Er ⊙ Es ⊙ Et

A product system is a subproduct system in which ws,t are all unitaries. Definition A family {ξs ∈ Es}s∈S is called a unit if ws,tξs+t = ξs ⊙ ξt for all s, t.

4Inclusion systems by Bhat-Mukherjee. 13 / 27

slide-39
SLIDE 39

Subproduct systems and dilations

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t (or Es⊙sEt , etc.)

14 / 27

slide-40
SLIDE 40

Subproduct systems and dilations

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t (or Es⊙sEt , etc.) Product system: Es ⊙ Et = Es+t

14 / 27

slide-41
SLIDE 41

Subproduct systems and dilations

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t (or Es⊙sEt , etc.) Product system: Es ⊙ Et = Es+t Unit: ξs ⊙ ξt = ξs+t

14 / 27

slide-42
SLIDE 42

Subproduct systems and dilations

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t (or Es⊙sEt , etc.) Product system: Es ⊙ Et = Es+t Unit: ξs ⊙ ξt = ξs+t For every CP-semigroup on B, there exists a subproduct system E = (Es)s∈S of B-correspondences (called the GNS subproduct system) and a unit (ξs)s∈S such that Ts(b) = ξs, bξs for all s ∈ S, b ∈ B.

14 / 27

slide-43
SLIDE 43

Subproduct systems and dilations

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t (or Es⊙sEt , etc.) Product system: Es ⊙ Et = Es+t Unit: ξs ⊙ ξt = ξs+t For every CP-semigroup on B, there exists a subproduct system E = (Es)s∈S of B-correspondences (called the GNS subproduct system) and a unit (ξs)s∈S such that Ts(b) = ξs, bξs for all s ∈ S, b ∈ B. Theorem (Following Bhat-Skeide, 2000) Let T be a Markov semigroup. If the GNS subproduct system of T can be embedded in a product system, then T has a unital dilation (A, ϑ, p).

14 / 27

slide-44
SLIDE 44

Subproduct systems and dilations

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t (or Es⊙sEt , etc.) Product system: Es ⊙ Et = Es+t Unit: ξs ⊙ ξt = ξs+t For every CP-semigroup on B, there exists a subproduct system E = (Es)s∈S of B-correspondences (called the GNS subproduct system) and a unit (ξs)s∈S such that Ts(b) = ξs, bξs for all s ∈ S, b ∈ B. Theorem (Following Bhat-Skeide, 2000) Let T be a Markov semigroup. If the GNS subproduct system of T can be embedded in a product system, then T has a unital dilation (A, ϑ, p). In fact, one can take A = Ba(E), where E is some (full) B-correspondence.

Markov semigroup = unital CP-semigroup.

14 / 27

slide-45
SLIDE 45

Subproduct systems and dilations

An application

Theorem (S.-Skeide, see also Bhat 98, Solel 2006) Every Markov semigroup over N2 has a unital dilation:

15 / 27

slide-46
SLIDE 46

Subproduct systems and dilations

An application

Theorem (S.-Skeide, see also Bhat 98, Solel 2006) Every Markov semigroup over N2 has a unital dilation: If T1, T2 are two commuting normal unital CP maps on a vN algebra B, then there exist two commuting normal unital *-endomorphisms ϑ1, ϑ2 on a vN algebra A containing B, a projection p ∈ A such that B = pAp,

15 / 27

slide-47
SLIDE 47

Subproduct systems and dilations

An application

Theorem (S.-Skeide, see also Bhat 98, Solel 2006) Every Markov semigroup over N2 has a unital dilation: If T1, T2 are two commuting normal unital CP maps on a vN algebra B, then there exist two commuting normal unital *-endomorphisms ϑ1, ϑ2 on a vN algebra A containing B, a projection p ∈ A such that B = pAp, and T n1

1 ◦ T n2 2 (b) = pϑn1 1 ◦ ϑn2 2 (b)p

for all b ∈ B, n1, n2 ∈ N.

15 / 27

slide-48
SLIDE 48

Subproduct systems and dilations

An application

Theorem (S.-Skeide, see also Bhat 98, Solel 2006) Every Markov semigroup over N2 has a unital dilation: If T1, T2 are two commuting normal unital CP maps on a vN algebra B, then there exist two commuting normal unital *-endomorphisms ϑ1, ϑ2 on a vN algebra A containing B, a projection p ∈ A such that B = pAp, and T n1

1 ◦ T n2 2 (b) = pϑn1 1 ◦ ϑn2 2 (b)p

for all b ∈ B, n1, n2 ∈ N. Proof. Given a Markov semigroup over N2, we construct a product system that contains the GNS subproduct system of that semigroup.

15 / 27

slide-49
SLIDE 49

Subproduct systems and dilations

An application

Theorem (S.-Skeide, see also Bhat 98, Solel 2006) Every Markov semigroup over N2 has a unital dilation: If T1, T2 are two commuting normal unital CP maps on a vN algebra B, then there exist two commuting normal unital *-endomorphisms ϑ1, ϑ2 on a vN algebra A containing B, a projection p ∈ A such that B = pAp, and T n1

1 ◦ T n2 2 (b) = pϑn1 1 ◦ ϑn2 2 (b)p

for all b ∈ B, n1, n2 ∈ N. Proof. Given a Markov semigroup over N2, we construct a product system that contains the GNS subproduct system of that semigroup. Then apply previous theorem.

15 / 27

slide-50
SLIDE 50

Subproduct systems and dilations

An application

Theorem (S.-Skeide, see also Bhat 98, Solel 2006) Every Markov semigroup over N2 has a unital dilation: If T1, T2 are two commuting normal unital CP maps on a vN algebra B, then there exist two commuting normal unital *-endomorphisms ϑ1, ϑ2 on a vN algebra A containing B, a projection p ∈ A such that B = pAp, and T n1

1 ◦ T n2 2 (b) = pϑn1 1 ◦ ϑn2 2 (b)p

for all b ∈ B, n1, n2 ∈ N. Proof. Given a Markov semigroup over N2, we construct a product system that contains the GNS subproduct system of that semigroup. Then apply previous theorem. Remark: In fact we have A = ApA

s = Ba(E), where E = Ap

  • s. In

particular, A is Morita equivalent to B (in the sense of Rieffel).

15 / 27

slide-51
SLIDE 51

Subproduct systems and dilations

The converse direction

A sufficient condition for the existence of a dilation for a unital CP-semigroup T is that its GNS subproduct system embeds into a product system.

16 / 27

slide-52
SLIDE 52

Subproduct systems and dilations

The converse direction

A sufficient condition for the existence of a dilation for a unital CP-semigroup T is that its GNS subproduct system embeds into a product system. What about the converse direction?

16 / 27

slide-53
SLIDE 53

Subproduct systems and dilations

The converse direction

A sufficient condition for the existence of a dilation for a unital CP-semigroup T is that its GNS subproduct system embeds into a product system. What about the converse direction? Theorem (S.-Skeide)

  • If a Markov semigroup T = (Ts)s∈S has a minimal dilation then its GNS

subproduct system embeds into a product system.

16 / 27

slide-54
SLIDE 54

Subproduct systems and dilations

The converse direction

A sufficient condition for the existence of a dilation for a unital CP-semigroup T is that its GNS subproduct system embeds into a product system. What about the converse direction? Theorem (S.-Skeide)

  • If a Markov semigroup T = (Ts)s∈S has a minimal dilation then its GNS

subproduct system embeds into a product system.

  • A Markov semigroup T = (Ts)s∈S has a dilation (Ba(E), ϑ, p) where E

is a (full) B-correspondence, if and only if its GNS subproduct system embeds into a product system.

16 / 27

slide-55
SLIDE 55

Subproduct systems and dilations

The converse direction

A sufficient condition for the existence of a dilation for a unital CP-semigroup T is that its GNS subproduct system embeds into a product system. What about the converse direction? Theorem (S.-Skeide)

  • If a Markov semigroup T = (Ts)s∈S has a minimal dilation then its GNS

subproduct system embeds into a product system.

  • A Markov semigroup T = (Ts)s∈S has a dilation (Ba(E), ϑ, p) where E

is a (full) B-correspondence, if and only if its GNS subproduct system embeds into a product system. Caveats:

  • 1. We did not define what "minimal" means.

16 / 27

slide-56
SLIDE 56

Subproduct systems and dilations

The converse direction

A sufficient condition for the existence of a dilation for a unital CP-semigroup T is that its GNS subproduct system embeds into a product system. What about the converse direction? Theorem (S.-Skeide)

  • If a Markov semigroup T = (Ts)s∈S has a minimal dilation then its GNS

subproduct system embeds into a product system.

  • A Markov semigroup T = (Ts)s∈S has a dilation (Ba(E), ϑ, p) where E

is a (full) B-correspondence, if and only if its GNS subproduct system embeds into a product system. Caveats:

  • 1. We did not define what "minimal" means.
  • 2. Over Nk (k ≥ 2), minimal dilations are not unique.

16 / 27

slide-57
SLIDE 57

Subproduct systems and dilations

The converse direction

A sufficient condition for the existence of a dilation for a unital CP-semigroup T is that its GNS subproduct system embeds into a product system. What about the converse direction? Theorem (S.-Skeide)

  • If a Markov semigroup T = (Ts)s∈S has a minimal dilation then its GNS

subproduct system embeds into a product system.

  • A Markov semigroup T = (Ts)s∈S has a dilation (Ba(E), ϑ, p) where E

is a (full) B-correspondence, if and only if its GNS subproduct system embeds into a product system. Caveats:

  • 1. We did not define what "minimal" means.
  • 2. Over Nk (k ≥ 2), minimal dilations are not unique.
  • 3. Over Nk (k ≥ 2), a given dilation might not be "minimalizable", that is,

cannot be compressed or restricted to a minimal one (new and weird).

16 / 27

slide-58
SLIDE 58

Subproduct systems and dilations

The converse direction

A sufficient condition for the existence of a dilation for a unital CP-semigroup T is that its GNS subproduct system embeds into a product system. What about the converse direction? Theorem (S.-Skeide)

  • If a Markov semigroup T = (Ts)s∈S has a minimal dilation then its GNS

subproduct system embeds into a product system.

  • A Markov semigroup T = (Ts)s∈S has a dilation (Ba(E), ϑ, p) where E

is a (full) B-correspondence, if and only if its GNS subproduct system embeds into a product system. Caveats:

  • 1. We did not define what "minimal" means.
  • 2. Over Nk (k ≥ 2), minimal dilations are not unique.
  • 3. Over Nk (k ≥ 2), a given dilation might not be "minimalizable", that is,

cannot be compressed or restricted to a minimal one (new and weird).

  • 4. What about dilations (A, ϑ, p), where A = Ba(E)?

16 / 27

slide-59
SLIDE 59

Subproduct systems and dilations

The converse direction II

Theorem (S.-Skeide)

  • If a Markov semigroup T = (Ts)s∈S has a minimal dilation then its GNS

subproduct system embeds into a product system. Corollary (S.-Skeide) There exist CP and Markov semigroups over N3 for which there is no minimal dilation.

17 / 27

slide-60
SLIDE 60

Subproduct systems and dilations

The converse direction II

Theorem (S.-Skeide)

  • If a Markov semigroup T = (Ts)s∈S has a minimal dilation then its GNS

subproduct system embeds into a product system. Corollary (S.-Skeide) There exist CP and Markov semigroups over N3 for which there is no minimal dilation. "Proof" (not really...) [S.-Solel] construct a subproduct system over N3 that cannot be embedded into a product system. We apply the above theorem to that subproduct system.

17 / 27

slide-61
SLIDE 61

Subproduct systems and dilations

The converse direction II

Theorem (S.-Skeide)

  • If a Markov semigroup T = (Ts)s∈S has a minimal dilation then its GNS

subproduct system embeds into a product system. Corollary (S.-Skeide) There exist CP and Markov semigroups over N3 for which there is no minimal dilation. "Proof" (not really...) [S.-Solel] construct a subproduct system over N3 that cannot be embedded into a product system. We apply the above theorem to that subproduct system. Problem: this does not rule out the existence of non-minimal dilations.

17 / 27

slide-62
SLIDE 62

Minimality

Minimality

Let T = (Ts)s∈S be a CP-semigroup over S, and (A, ϑ, p) a dilation. Suppose that B ⊆ B(H) and that A ⊆ B(K), so that p = PH.

18 / 27

slide-63
SLIDE 63

Minimality

Minimality

Let T = (Ts)s∈S be a CP-semigroup over S, and (A, ϑ, p) a dilation. Suppose that B ⊆ B(H) and that A ⊆ B(K), so that p = PH. There are three properties that one may require for "minimality":

18 / 27

slide-64
SLIDE 64

Minimality

Minimality

Let T = (Ts)s∈S be a CP-semigroup over S, and (A, ϑ, p) a dilation. Suppose that B ⊆ B(H) and that A ⊆ B(K), so that p = PH. There are three properties that one may require for "minimality":

  • 1. "Algebraic minimality", that is

A = W ∗(∪s∈Sϑs(B)).

18 / 27

slide-65
SLIDE 65

Minimality

Minimality

Let T = (Ts)s∈S be a CP-semigroup over S, and (A, ϑ, p) a dilation. Suppose that B ⊆ B(H) and that A ⊆ B(K), so that p = PH. There are three properties that one may require for "minimality":

  • 1. "Algebraic minimality", that is

A = W ∗(∪s∈Sϑs(B)).

  • 2. "Spatial minimality", that is, A = ApA
  • s. Assuming 1, same as:

K = span{ϑs1(b1) · · · ϑsn(bn)h : si ∈ S, bi ∈ B, h ∈ H}.

18 / 27

slide-66
SLIDE 66

Minimality

Minimality

Let T = (Ts)s∈S be a CP-semigroup over S, and (A, ϑ, p) a dilation. Suppose that B ⊆ B(H) and that A ⊆ B(K), so that p = PH. There are three properties that one may require for "minimality":

  • 1. "Algebraic minimality", that is

A = W ∗(∪s∈Sϑs(B)).

  • 2. "Spatial minimality", that is, A = ApA
  • s. Assuming 1, same as:

K = span{ϑs1(b1) · · · ϑsn(bn)h : si ∈ S, bi ∈ B, h ∈ H}.

  • 3. "Incompressibility": there is no nontrivial projection p ≤ q ∈ A s.t.

qϑs(·)q : qAq → qAq , qϑs(·)q : qaq → qϑs(qaq)q, is an E-semigroup, and a dilation of T.

18 / 27

slide-67
SLIDE 67

Minimality

Minimality II

  • 1. A = W ∗(∪s∈Sϑs(B)).
  • 2. A = ApA

s.

  • 3. No nontrivial projection p ≤ q = 1 in A s.t. qϑs(·)q is a dilation.

19 / 27

slide-68
SLIDE 68

Minimality

Minimality II

  • 1. A = W ∗(∪s∈Sϑs(B)).
  • 2. A = ApA

s.

  • 3. No nontrivial projection p ≤ q = 1 in A s.t. qϑs(·)q is a dilation.

The notion of minimality referred to in theorem and corollary above is the strongest one: 1+2. (This also implies 3).

19 / 27

slide-69
SLIDE 69

Minimality

Minimality II

  • 1. A = W ∗(∪s∈Sϑs(B)).
  • 2. A = ApA

s.

  • 3. No nontrivial projection p ≤ q = 1 in A s.t. qϑs(·)q is a dilation.

The notion of minimality referred to in theorem and corollary above is the strongest one: 1+2. (This also implies 3). It is easy to restrict to a semigroup satisfying 1, and not hard to compress to obtain 1+3, but that is not the notion that works best (M.E.).

19 / 27

slide-70
SLIDE 70

Minimality

Minimality II

  • 1. A = W ∗(∪s∈Sϑs(B)).
  • 2. A = ApA

s.

  • 3. No nontrivial projection p ≤ q = 1 in A s.t. qϑs(·)q is a dilation.

The notion of minimality referred to in theorem and corollary above is the strongest one: 1+2. (This also implies 3). It is easy to restrict to a semigroup satisfying 1, and not hard to compress to obtain 1+3, but that is not the notion that works best (M.E.). Over R+ (and N), 1+2 is equivalent to 1+3. (non-trivial!)

19 / 27

slide-71
SLIDE 71

Minimality

Minimality II

  • 1. A = W ∗(∪s∈Sϑs(B)).
  • 2. A = ApA

s.

  • 3. No nontrivial projection p ≤ q = 1 in A s.t. qϑs(·)q is a dilation.

The notion of minimality referred to in theorem and corollary above is the strongest one: 1+2. (This also implies 3). It is easy to restrict to a semigroup satisfying 1, and not hard to compress to obtain 1+3, but that is not the notion that works best (M.E.). Over R+ (and N), 1+2 is equivalent to 1+3. (non-trivial!) We have an example of a dilation (A, ϑ, p) over N2, which satisfies 2, but not 1. After restricting to W ∗(∪s∈Sϑs(B)), and then compressing to the minimal compressing q, one obtains an algebraically minimal and incompressible dilation (1+3), which does not satisfy 2.

19 / 27

slide-72
SLIDE 72

Dilations and superproduct systems

Dilation ⇒ what?

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Following a construction from [Skeide02], we see what structure arises.

20 / 27

slide-73
SLIDE 73

Dilations and superproduct systems

Dilation ⇒ what?

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Following a construction from [Skeide02], we see what structure arises. Define a family (Es)s∈S of B-correspondences as follows: E := Ap

20 / 27

slide-74
SLIDE 74

Dilations and superproduct systems

Dilation ⇒ what?

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Following a construction from [Skeide02], we see what structure arises. Define a family (Es)s∈S of B-correspondences as follows: E := Ap , Es := ϑs(p)E.

20 / 27

slide-75
SLIDE 75

Dilations and superproduct systems

Dilation ⇒ what?

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Following a construction from [Skeide02], we see what structure arises. Define a family (Es)s∈S of B-correspondences as follows: E := Ap , Es := ϑs(p)E. W*-correspondence structure: b · xs := ϑs(b)xs , xs · b := xb, xs ∈ Es, b ∈ B. xs, ys := x∗

s ys ∈ pAp = B.

20 / 27

slide-76
SLIDE 76

Dilations and superproduct systems

Dilation ⇒ what?

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Following a construction from [Skeide02], we see what structure arises. Define a family (Es)s∈S of B-correspondences as follows: E := Ap , Es := ϑs(p)E. W*-correspondence structure: b · xs := ϑs(b)xs , xs · b := xb, xs ∈ Es, b ∈ B. xs, ys := x∗

s ys ∈ pAp = B.

Unit: ηs := ϑs(p)p ∈ Es.

20 / 27

slide-77
SLIDE 77

Dilations and superproduct systems

Dilation ⇒ what?

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Following a construction from [Skeide02], we see what structure arises. Define a family (Es)s∈S of B-correspondences as follows: E := Ap , Es := ϑs(p)E. W*-correspondence structure: b · xs := ϑs(b)xs , xs · b := xb, xs ∈ Es, b ∈ B. xs, ys := x∗

s ys ∈ pAp = B.

Unit: ηs := ϑs(p)p ∈ Es. (Es, ηs) represents T ηs, b · ηs

20 / 27

slide-78
SLIDE 78

Dilations and superproduct systems

Dilation ⇒ what?

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Following a construction from [Skeide02], we see what structure arises. Define a family (Es)s∈S of B-correspondences as follows: E := Ap , Es := ϑs(p)E. W*-correspondence structure: b · xs := ϑs(b)xs , xs · b := xb, xs ∈ Es, b ∈ B. xs, ys := x∗

s ys ∈ pAp = B.

Unit: ηs := ϑs(p)p ∈ Es. (Es, ηs) represents T ηs, b · ηs = pϑs(p)ϑs(b)ϑs(p)p = pϑs(b)p

20 / 27

slide-79
SLIDE 79

Dilations and superproduct systems

Dilation ⇒ what?

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Following a construction from [Skeide02], we see what structure arises. Define a family (Es)s∈S of B-correspondences as follows: E := Ap , Es := ϑs(p)E. W*-correspondence structure: b · xs := ϑs(b)xs , xs · b := xb, xs ∈ Es, b ∈ B. xs, ys := x∗

s ys ∈ pAp = B.

Unit: ηs := ϑs(p)p ∈ Es. (Es, ηs) represents T ηs, b · ηs = pϑs(p)ϑs(b)ϑs(p)p = pϑs(b)p = Ts(b).

20 / 27

slide-80
SLIDE 80

Dilations and superproduct systems

Dilation ⇒ what? II

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. We constructed a family (Es)s∈S of B-corresopndences, and a family (ηs)s∈S of unit vectors (ηs ∈ Es) that represent T: ηs, b · ηs = pϑs(b)p = Ts(b).

21 / 27

slide-81
SLIDE 81

Dilations and superproduct systems

Dilation ⇒ what? II

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. We constructed a family (Es)s∈S of B-corresopndences, and a family (ηs)s∈S of unit vectors (ηs ∈ Es) that represent T: ηs, b · ηs = pϑs(b)p = Ts(b). Hence (Es, ηs) "contains" the GNS representation (Es, ξs) of Ts.

21 / 27

slide-82
SLIDE 82

Dilations and superproduct systems

Dilation ⇒ what? II

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. We constructed a family (Es)s∈S of B-corresopndences, and a family (ηs)s∈S of unit vectors (ηs ∈ Es) that represent T: ηs, b · ηs = pϑs(b)p = Ts(b). Hence (Es, ηs) "contains" the GNS representation (Es, ξs) of Ts.

Q:

21 / 27

slide-83
SLIDE 83

Dilations and superproduct systems

Dilation ⇒ what? II

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. We constructed a family (Es)s∈S of B-corresopndences, and a family (ηs)s∈S of unit vectors (ηs ∈ Es) that represent T: ηs, b · ηs = pϑs(b)p = Ts(b). Hence (Es, ηs) "contains" the GNS representation (Es, ξs) of Ts.

Q: is (Es)s∈S a PRODUCT system?

21 / 27

slide-84
SLIDE 84

Dilations and superproduct systems

Dilation ⇒ what? III

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Let ((Es)s∈S, (ηs)s∈S) be as above, ηs, b · ηs = Ts(b).

22 / 27

slide-85
SLIDE 85

Dilations and superproduct systems

Dilation ⇒ what? III

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Let ((Es)s∈S, (ηs)s∈S) be as above, ηs, b · ηs = Ts(b). Define vs,t : Es ⊙ Et → Es+t ( really Es⊙sEt ) vs,t : xs ⊙ yt → ϑt(xs)yt .

22 / 27

slide-86
SLIDE 86

Dilations and superproduct systems

Dilation ⇒ what? III

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Let ((Es)s∈S, (ηs)s∈S) be as above, ηs, b · ηs = Ts(b). Define vs,t : Es ⊙ Et → Es+t ( really Es⊙sEt ) vs,t : xs ⊙ yt → ϑt(xs)yt . A direct calculation shows: xs ⊙ yt, x′

s ⊙ y′ t = . . . = ϑt(xs)yt, ϑt(x′ s)y′ t.

Hence vs,t : Es ⊙ Et → Es+t is an isometry:

22 / 27

slide-87
SLIDE 87

Dilations and superproduct systems

Dilation ⇒ what? III

Let T = (Ts)s∈S be a CP-semigroup on B, and (A, ϑ, p) a dilation. Let ((Es)s∈S, (ηs)s∈S) be as above, ηs, b · ηs = Ts(b). Define vs,t : Es ⊙ Et → Es+t ( really Es⊙sEt ) vs,t : xs ⊙ yt → ϑt(xs)yt . A direct calculation shows: xs ⊙ yt, x′

s ⊙ y′ t = . . . = ϑt(xs)yt, ϑt(x′ s)y′ t.

Hence vs,t : Es ⊙ Et → Es+t is an isometry: Es ⊙ Et ⊆ Es+t. (Es)s∈S is a superproduct system (but not always a product system).

22 / 27

slide-88
SLIDE 88

Dilations and superproduct systems

Superproduct systems

Definition A superproduct system is a family E = (Es)s∈S of B-correspondences, together with a family {vs,t : Es ⊙ Et → Es+t} of isometric bimodule maps, which iterate associatively

23 / 27

slide-89
SLIDE 89

Dilations and superproduct systems

Superproduct systems

Definition A superproduct system is a family E = (Es)s∈S of B-correspondences, together with a family {vs,t : Es ⊙ Et → Es+t} of isometric bimodule maps, which iterate associatively, i.e., the following diagram is commutative (∀r, s, t): Er ⊙ Es ⊙ Et

  • Er ⊙ Es+t
  • Er+s ⊙ Et

Er+s+t

23 / 27

slide-90
SLIDE 90

Dilations and superproduct systems

Superproduct systems

Definition A superproduct system is a family E = (Es)s∈S of B-correspondences, together with a family {vs,t : Es ⊙ Et → Es+t} of isometric bimodule maps, which iterate associatively, i.e., the following diagram is commutative (∀r, s, t): Er ⊙ Es ⊙ Et

  • Er ⊙ Es+t
  • Er+s ⊙ Et

Er+s+t

A product system is a superproduct system in which vs,t are all unitaries.

23 / 27

slide-91
SLIDE 91

Dilations and superproduct systems

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t Product system: Es ⊙ Et = Es+t Unit: ξs ⊙ ξt = ξs+t

24 / 27

slide-92
SLIDE 92

Dilations and superproduct systems

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t Product system: Es ⊙ Et = Es+t Unit: ξs ⊙ ξt = ξs+t Superproduct system: Es ⊙ Et ⊆ Es+t

24 / 27

slide-93
SLIDE 93

Dilations and superproduct systems

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t Product system: Es ⊙ Et = Es+t Unit: ξs ⊙ ξt = ξs+t Superproduct system: Es ⊙ Et ⊆ Es+t For every CP-semigroup T on B, there exists a subproduct system E = (Es)s∈S of B-correspondences (the GNS subproduct system) and a unit (ξs)s∈S such that Ts(b) = ξs, bξs for all s ∈ S, b ∈ B.

24 / 27

slide-94
SLIDE 94

Dilations and superproduct systems

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t Product system: Es ⊙ Et = Es+t Unit: ξs ⊙ ξt = ξs+t Superproduct system: Es ⊙ Et ⊆ Es+t For every CP-semigroup T on B, there exists a subproduct system E = (Es)s∈S of B-correspondences (the GNS subproduct system) and a unit (ξs)s∈S such that Ts(b) = ξs, bξs for all s ∈ S, b ∈ B. If T unital, and if the GNS subproduct system can be embedded into a product system, then T has a dilation (A, ϑ, p) (with A = Ba(E)).

24 / 27

slide-95
SLIDE 95

Dilations and superproduct systems

Recap

Subproduct system: Es ⊙ Et ⊇ Es+t Product system: Es ⊙ Et = Es+t Unit: ξs ⊙ ξt = ξs+t Superproduct system: Es ⊙ Et ⊆ Es+t For every CP-semigroup T on B, there exists a subproduct system E = (Es)s∈S of B-correspondences (the GNS subproduct system) and a unit (ξs)s∈S such that Ts(b) = ξs, bξs for all s ∈ S, b ∈ B. If T unital, and if the GNS subproduct system can be embedded into a product system, then T has a dilation (A, ϑ, p) (with A = Ba(E)). If T has a dilation (A, ϑ, p), then the GNS subproduct system must embed into a superproduct system.

24 / 27

slide-96
SLIDE 96

Dilations and superproduct systems

Dilations and superproduct systems

Theorem (S.-Skeide) Let T = (Ts)s∈S be a Markov semigroup on a von Neumann algebra B.

  • A sufficient condition for T to a have a dilation, is that the GNS

subproduct system of T embeds into a product system.

  • A necessary condition for T to have a dilation, is that the GNS

subproduct system of T embeds into a superproduct system.

25 / 27

slide-97
SLIDE 97

Dilations and superproduct systems

Dilations and superproduct systems

Theorem (S.-Skeide) Let T = (Ts)s∈S be a Markov semigroup on a von Neumann algebra B.

  • A sufficient condition for T to a have a dilation, is that the GNS

subproduct system of T embeds into a product system.

  • A necessary condition for T to have a dilation, is that the GNS

subproduct system of T embeds into a superproduct system. Corollary (S.-Skeide) There exist CP and Markov semigroups over N3 that have no dilation.

25 / 27

slide-98
SLIDE 98

Dilations and superproduct systems

Dilations and superproduct systems

Theorem (S.-Skeide) Let T = (Ts)s∈S be a Markov semigroup on a von Neumann algebra B.

  • A sufficient condition for T to a have a dilation, is that the GNS

subproduct system of T embeds into a product system.

  • A necessary condition for T to have a dilation, is that the GNS

subproduct system of T embeds into a superproduct system. Corollary (S.-Skeide) There exist CP and Markov semigroups over N3 that have no dilation. "Proof" (not really...) We have an example of a subproduct system over N3 that cannot be embedded into a superproduct system.

25 / 27

slide-99
SLIDE 99

Dilations and superproduct systems

Dilations and superproduct systems

Theorem (S.-Skeide) Let T = (Ts)s∈S be a Markov semigroup on a von Neumann algebra B.

  • A sufficient condition for T to a have a dilation, is that the GNS

subproduct system of T embeds into a product system.

  • A necessary condition for T to have a dilation, is that the GNS

subproduct system of T embeds into a superproduct system. Corollary (S.-Skeide) There exist CP and Markov semigroups over N3 that have no dilation. "Proof" (not really...) We have an example of a subproduct system over N3 that cannot be embedded into a superproduct system. The truth: the SPS is not the GNS subproduct system of a CP-semigroup, so the proof does not really go like that . . .

25 / 27

slide-100
SLIDE 100

More subproduct systems

Another way subproduct systems arise

Let E be a full W*-correspondence over B, and Ba(E) the adjointable

  • perators on E. E is a Morita W* equivalence from Ba(E) to B:

B = E ∗⊙sE , Ba(E) = E⊙sE ∗.

26 / 27

slide-101
SLIDE 101

More subproduct systems

Another way subproduct systems arise

Let E be a full W*-correspondence over B, and Ba(E) the adjointable

  • perators on E. E is a Morita W* equivalence from Ba(E) to B:

B = E ∗⊙sE , Ba(E) = E⊙sE ∗. For T = (Ts)s∈S a CP-s.g. on Ba(E), and E = (Es)s∈S the GNS SPS

26 / 27

slide-102
SLIDE 102

More subproduct systems

Another way subproduct systems arise

Let E be a full W*-correspondence over B, and Ba(E) the adjointable

  • perators on E. E is a Morita W* equivalence from Ba(E) to B:

B = E ∗⊙sE , Ba(E) = E⊙sE ∗. For T = (Ts)s∈S a CP-s.g. on Ba(E), and E = (Es)s∈S the GNS SPS consider the Morita equivalent subproduct system F = (Fs)s∈S given by Fs := E ∗⊙sEs⊙sE. F the subproduct system of B-correspondences associated with T.

26 / 27

slide-103
SLIDE 103

More subproduct systems

Another way subproduct systems arise

Let E be a full W*-correspondence over B, and Ba(E) the adjointable

  • perators on E. E is a Morita W* equivalence from Ba(E) to B:

B = E ∗⊙sE , Ba(E) = E⊙sE ∗. For T = (Ts)s∈S a CP-s.g. on Ba(E), and E = (Es)s∈S the GNS SPS consider the Morita equivalent subproduct system F = (Fs)s∈S given by Fs := E ∗⊙sEs⊙sE. F the subproduct system of B-correspondences associated with T. Theorem (S.-Skeide, see also S.-Solel) Every subproduct system over B is the subproduct system of B-correspondences associated with some normal CP-semigroup T acting on some Ba(E), where E is a B-correspondence.

26 / 27

slide-104
SLIDE 104

More subproduct systems

Another way subproduct systems arise

Let E be a full W*-correspondence over B, and Ba(E) the adjointable

  • perators on E. E is a Morita W* equivalence from Ba(E) to B:

B = E ∗⊙sE , Ba(E) = E⊙sE ∗. For T = (Ts)s∈S a CP-s.g. on Ba(E), and E = (Es)s∈S the GNS SPS consider the Morita equivalent subproduct system F = (Fs)s∈S given by Fs := E ∗⊙sEs⊙sE. F the subproduct system of B-correspondences associated with T. Theorem (S.-Skeide, see also S.-Solel) Every subproduct system over B is the subproduct system of B-correspondences associated with some normal CP-semigroup T acting on some Ba(E), where E is a B-correspondence. In particular, every SPS is Morita equivalent to the GNS of some CP-semigroup.

26 / 27

slide-105
SLIDE 105

More subproduct systems

Another way subproduct systems arise

Let E be a full W*-correspondence over B, and Ba(E) the adjointable

  • perators on E. E is a Morita W* equivalence from Ba(E) to B:

B = E ∗⊙sE , Ba(E) = E⊙sE ∗. For T = (Ts)s∈S a CP-s.g. on Ba(E), and E = (Es)s∈S the GNS SPS consider the Morita equivalent subproduct system F = (Fs)s∈S given by Fs := E ∗⊙sEs⊙sE. F the subproduct system of B-correspondences associated with T. Theorem (S.-Skeide, see also S.-Solel) Every subproduct system over B is the subproduct system of B-correspondences associated with some normal CP-semigroup T acting on some Ba(E), where E is a B-correspondence. In particular, every SPS is Morita equivalent to the GNS of some CP-semigroup. Morita equivalence behaves nicely w.r.t. inclusions into product systems.

26 / 27

slide-106
SLIDE 106

Thank you slide

Thank you!

27 / 27