Functorial spectra and discretization of C*-algebras Chris Heunen - - PowerPoint PPT Presentation

functorial spectra and discretization of c algebras
SMART_READER_LITE
LIVE PREVIEW

Functorial spectra and discretization of C*-algebras Chris Heunen - - PowerPoint PPT Presentation

Functorial spectra and discretization of C*-algebras Chris Heunen 1 / 13 Introduction Hom( , C ) KHaus op Equivalence cCstar Hom( , C ) 1. Many attempts at noncommutative version, none functorial 2. Idea: noncommutative space = set


slide-1
SLIDE 1

Functorial spectra and discretization of C*-algebras

Chris Heunen

1 / 13

slide-2
SLIDE 2

Introduction

Equivalence cCstar KHausop

Hom(−, C) Hom(−, C)

  • 1. Many attempts at noncommutative version, none functorial
  • 2. Idea: noncommutative space = set of commutative subspaces
  • 3. Active lattices: ‘functions’ on noncommutative space
  • 4. Discretization: ‘continuous’ functions on noncommutative space

2 / 13

slide-3
SLIDE 3

Obstruction

Theorem: If C has strict initial object ∅ and I continuous, cCstar KHausop Cstar Cop

Spec F I

then F(Mn(C)) = ∅ for all n > 2.

[Berg & H, 2014]

3 / 13

slide-4
SLIDE 4

Obstruction

Theorem: If C has strict initial object ∅ and I continuous, cCstar KHausop Cstar Cop

Spec F I

then F(Mn(C)) = ∅ for all n > 2.

[Berg & H, 2014]

Proof:

  • 1. define K : cCstar → Cop by A → limC⊆A I(Spec(C))
  • 2. then K(C) = I(Spec(C)) for commutative C
  • 3. K is final with this property
  • 4. I ◦ Spec preserves limits, so K(A) = I(Spec(colimC⊆A C))
  • 5. Kochen-Specker: colimC⊆Mn(C) Proj(C) is Boolean algebra 1
  • 6. so F(Mn(C)) → K(Mn(C)) = ∅

3 / 13

slide-5
SLIDE 5

Obstruction

Theorem: If C has strict initial object ∅ and I continuous, cCstar KHausop Cstar Cop

Spec F I

then F(Mn(C)) = ∅ for all n > 2.

[Berg & H, 2014]

Remarks:

◮ Rules out sets, schemes, locales, quantales, ringed toposes, ... ◮ Not just Mn(C): W*-algebras without summands C or M2(C) ◮ Not just Gelfand duality: also Stone, Zariski, Pierce ◮ Remarkable that physics theorem affects all rings ◮ Ways out: different limit behaviour, square not commutative

3 / 13

slide-6
SLIDE 6

Obstruction

Theorem: If C has strict initial object ∅ and I continuous, cCstar KHausop Cstar Cop

Spec F I

then F(Mn(C)) = ∅ for all n > 2.

[Berg & H, 2014]

Remarks:

◮ Rules out sets, schemes, locales, quantales, ringed toposes, ... ◮ Not just Mn(C): W*-algebras without summands C or M2(C) ◮ Not just Gelfand duality: also Stone, Zariski, Pierce ◮ Remarkable that physics theorem affects all rings ◮ Ways out: different limit behaviour, square not commutative

Lesson: Set of commutative subalgebras important

3 / 13

slide-7
SLIDE 7

Commutative subalgebras

Definition: for C*-algebra A, let C(A) = {C ⊆ A commutative} partially ordered by inclusion.

[H & Landsman & Spitters 09]

How much does C(A) know about A?

4 / 13

slide-8
SLIDE 8

Commutative subalgebras

Definition: for C*-algebra A, let C(A) = {C ⊆ A commutative} partially ordered by inclusion.

[H & Landsman & Spitters 09]

How much does C(A) know about A?

◮ Not everything: [Connes 75]

there is A ≃ Aop, but C(A) ≃ C(Aop)

4 / 13

slide-9
SLIDE 9

Commutative subalgebras

Definition: for C*-algebra A, let C(A) = {C ⊆ A commutative} partially ordered by inclusion.

[H & Landsman & Spitters 09]

How much does C(A) know about A?

◮ Not everything: [Connes 75]

there is A ≃ Aop, but C(A) ≃ C(Aop)

◮ Everything commutative: if A, B commutative, [Mendivil 99]

C(A) ≃ C(B) = ⇒ A ≃ B

4 / 13

slide-10
SLIDE 10

Commutative subalgebras

Definition: for C*-algebra A, let C(A) = {C ⊆ A commutative} partially ordered by inclusion.

[H & Landsman & Spitters 09]

How much does C(A) know about A?

◮ Not everything: [Connes 75]

there is A ≃ Aop, but C(A) ≃ C(Aop)

◮ Everything commutative: if A, B commutative, [Mendivil 99]

C(A) ≃ C(B) = ⇒ A ≃ B

◮ Jordan: if A, B are W* have no I2 summand, [Harding & Doering 10]

C(A) ≃ C(B) = ⇒ (A, ◦) ≃ (B, ◦) for a ◦ b = 1

2(ab + ba)

4 / 13

slide-11
SLIDE 11

Commutative subalgebras

Definition: for C*-algebra A, let C(A) = {C ⊆ A commutative} partially ordered by inclusion.

[H & Landsman & Spitters 09]

How much does C(A) know about A?

◮ Not everything: [Connes 75]

there is A ≃ Aop, but C(A) ≃ C(Aop)

◮ Everything commutative: if A, B commutative, [Mendivil 99]

C(A) ≃ C(B) = ⇒ A ≃ B

◮ Jordan: if A, B are W* have no I2 summand, [Harding & Doering 10]

C(A) ≃ C(B) = ⇒ (A, ◦) ≃ (B, ◦) for a ◦ b = 1

2(ab + ba) ◮ Quasi-Jordan: if A not C2 or M2(C), [Hamhalter 11]

C(A) ≃ C(B) = ⇒ (A, ◦) ≃ (B, ◦) quasi-linear

4 / 13

slide-12
SLIDE 12

Commutative subalgebras

Definition: for C*-algebra A, let C(A) = {C ⊆ A commutative} partially ordered by inclusion.

[H & Landsman & Spitters 09]

How much does C(A) know about A?

◮ Not everything: [Connes 75]

there is A ≃ Aop, but C(A) ≃ C(Aop)

◮ Everything commutative: if A, B commutative, [Mendivil 99]

C(A) ≃ C(B) = ⇒ A ≃ B

◮ Jordan: if A, B are W* have no I2 summand, [Harding & Doering 10]

C(A) ≃ C(B) = ⇒ (A, ◦) ≃ (B, ◦) for a ◦ b = 1

2(ab + ba) ◮ Quasi-Jordan: if A not C2 or M2(C), [Hamhalter 11]

C(A) ≃ C(B) = ⇒ (A, ◦) ≃ (B, ◦) quasi-linear

◮ Type and dimension: [Lindenhovius 15]

C(A) ≃ C(B) and A is W*/AW* = ⇒ so is B C(A) ≃ C(B) and dim(A) < ∞ = ⇒ A ≃ B

4 / 13

slide-13
SLIDE 13

Combinatorial structure

◮ C(A) can encode graphs: [H & Fritz & Reyes 14]

projection valued measures compatible when commute any graph can be realised as PVMs in some C(A)

5 / 13

slide-14
SLIDE 14

Combinatorial structure

◮ C(A) can encode graphs: [H & Fritz & Reyes 14]

projection valued measures compatible when commute any graph can be realised as PVMs in some C(A)

◮ C(A) can encode simplicial complexes: [Kunjwal & H & Fritz 14]

positive operator valued measures compatible when marginals any simplical complex can be realised as POVMs in some C(A)

5 / 13

slide-15
SLIDE 15

Combinatorial structure

◮ C(A) can encode graphs: [H & Fritz & Reyes 14]

projection valued measures compatible when commute any graph can be realised as PVMs in some C(A)

◮ C(A) can encode simplicial complexes: [Kunjwal & H & Fritz 14]

positive operator valued measures compatible when marginals any simplical complex can be realised as POVMs in some C(A)

◮ C(A) domain ⇐

⇒ A scattered:

[H & Lindenhovius 15]

domain: directed suprema, all elements supremum of finite ones scattered: spectrum C ∈ C(A) scattered; isolated points dense

5 / 13

slide-16
SLIDE 16

Combinatorial structure

◮ C(A) can encode graphs: [H & Fritz & Reyes 14]

projection valued measures compatible when commute any graph can be realised as PVMs in some C(A)

◮ C(A) can encode simplicial complexes: [Kunjwal & H & Fritz 14]

positive operator valued measures compatible when marginals any simplical complex can be realised as POVMs in some C(A)

◮ C(A) domain ⇐

⇒ A scattered:

[H & Lindenhovius 15]

domain: directed suprema, all elements supremum of finite ones scattered: spectrum C ∈ C(A) scattered; isolated points dense Then C(A) is compact Hausdorff in Lawson topology; C(C(A))?

5 / 13

slide-17
SLIDE 17

Combinatorial structure

◮ C(A) can encode graphs: [H & Fritz & Reyes 14]

projection valued measures compatible when commute any graph can be realised as PVMs in some C(A)

◮ C(A) can encode simplicial complexes: [Kunjwal & H & Fritz 14]

positive operator valued measures compatible when marginals any simplical complex can be realised as POVMs in some C(A)

◮ C(A) domain ⇐

⇒ A scattered:

[H & Lindenhovius 15]

domain: directed suprema, all elements supremum of finite ones scattered: spectrum C ∈ C(A) scattered; isolated points dense Then C(A) is compact Hausdorff in Lawson topology; C(C(A))? Lesson: C(A) has lots of structure, interesting to study

5 / 13

slide-18
SLIDE 18

Characterization

When is a partially ordered set of the form C(A)? If A has weakly terminal abelian subalgebra C(X):

[H 14]

  • 1. C(A) ≃ C(C(X))
  • 2. C(C(X)) ≃ P(X) ⋊ S(X)
  • 3. Axiomatization known for partition lattice P(X)

[Firby 73]

  • 4. Axiomatize monoid S(X) of epimorphisms X ։ X
  • 5. Axiomatize semidirect product of posets and monoids

6 / 13

slide-19
SLIDE 19

Characterization

When is a partially ordered set of the form C(A)? If A has weakly terminal abelian subalgebra C(X):

[H 14]

  • 1. C(A) ≃ C(C(X))
  • 2. C(C(X)) ≃ P(X) ⋊ S(X)
  • 3. Axiomatization known for partition lattice P(X)

[Firby 73]

  • 4. Axiomatize monoid S(X) of epimorphisms X ։ X
  • 5. Axiomatize semidirect product of posets and monoids

Lesson: Not just partial order C(A) important, also action

6 / 13

slide-20
SLIDE 20

Active lattices

◮ Restrict to ‘noncommutative sets and functions’

AW*-algebras: abundance of projections

[Kaplansky 51]

7 / 13

slide-21
SLIDE 21

Active lattices

◮ Restrict to ‘noncommutative sets and functions’

AW*-algebras: abundance of projections

[Kaplansky 51] ◮ May replace AWstar C

→ Poset with AWstar

Proj

− → Poset Not full and faithful

7 / 13

slide-22
SLIDE 22

Active lattices

◮ Restrict to ‘noncommutative sets and functions’

AW*-algebras: abundance of projections

[Kaplansky 51] ◮ May replace AWstar C

→ Poset with AWstar

Proj

− → Poset Not full and faithful

◮ Use action to make it full and faithful [H & Reyes 14]

AWstar Poset Group Proj U

7 / 13

slide-23
SLIDE 23

Active lattices

◮ Restrict to ‘noncommutative sets and functions’

AW*-algebras: abundance of projections

[Kaplansky 51] ◮ May replace AWstar C

→ Poset with AWstar

Proj

− → Poset Not full and faithful

◮ Use action to make it full and faithful [H & Reyes 14]

AWstar Poset Group Proj U p upu∗ 1 − 2p u

7 / 13

slide-24
SLIDE 24

Active lattices

◮ Restrict to ‘noncommutative sets and functions’

AW*-algebras: abundance of projections

[Kaplansky 51] ◮ May replace AWstar C

→ Poset with AWstar

Proj

− → Poset Not full and faithful

◮ Use action to make it full and faithful [H & Reyes 14]

AWstar Poset Group Proj U p upu∗ 1 − 2p u ActLat

7 / 13

slide-25
SLIDE 25

Active lattices: details

◮ Symmetry group Sym(A) ⊆ U(A) generated by {1 − 2p}

◮ if A commutative, then Sym(A) is Boolean ring Proj(A) ◮ if A = Mn(C) type I≥2, then Sym(A) = det−1(Sym(C)) ◮ If A type I∞, II, III, then Sym(A) = U(A) 8 / 13

slide-26
SLIDE 26

Active lattices: details

◮ Symmetry group Sym(A) ⊆ U(A) generated by {1 − 2p}

◮ if A commutative, then Sym(A) is Boolean ring Proj(A) ◮ if A = Mn(C) type I≥2, then Sym(A) = det−1(Sym(C)) ◮ If A type I∞, II, III, then Sym(A) = U(A)

◮ A piecewise C*-algebra is reflexive symmetric ⊙ ⊆ A × A with

partial structure (addition, multiplication) such that S ⊆ A with S2 ⊆ ⊙ extends to commutative C*-algebra T with T 2 ⊆ ⊙.

8 / 13

slide-27
SLIDE 27

Active lattices: details

◮ Symmetry group Sym(A) ⊆ U(A) generated by {1 − 2p}

◮ if A commutative, then Sym(A) is Boolean ring Proj(A) ◮ if A = Mn(C) type I≥2, then Sym(A) = det−1(Sym(C)) ◮ If A type I∞, II, III, then Sym(A) = U(A)

◮ A piecewise C*-algebra is reflexive symmetric ⊙ ⊆ A × A with

partial structure (addition, multiplication) such that S ⊆ A with S2 ⊆ ⊙ extends to commutative C*-algebra T with T 2 ⊆ ⊙.

◮ There is equivalence

pAWstar pCBool COrtho

Proj F

8 / 13

slide-28
SLIDE 28

Active lattices: details

◮ Symmetry group Sym(A) ⊆ U(A) generated by {1 − 2p}

◮ if A commutative, then Sym(A) is Boolean ring Proj(A) ◮ if A = Mn(C) type I≥2, then Sym(A) = det−1(Sym(C)) ◮ If A type I∞, II, III, then Sym(A) = U(A)

◮ A piecewise C*-algebra is reflexive symmetric ⊙ ⊆ A × A with

partial structure (addition, multiplication) such that S ⊆ A with S2 ⊆ ⊙ extends to commutative C*-algebra T with T 2 ⊆ ⊙.

◮ There is equivalence

pAWstar pCBool COrtho

Proj F ◮ Definition: an active lattice is a complete orthomodular lattice

P, together with a group G generated by P ≃ Proj(F(P)), and an action of G on P with induced action on F(P) conjugation.

8 / 13

slide-29
SLIDE 29

Active lattices: details

◮ Symmetry group Sym(A) ⊆ U(A) generated by {1 − 2p}

◮ if A commutative, then Sym(A) is Boolean ring Proj(A) ◮ if A = Mn(C) type I≥2, then Sym(A) = det−1(Sym(C)) ◮ If A type I∞, II, III, then Sym(A) = U(A)

◮ A piecewise C*-algebra is reflexive symmetric ⊙ ⊆ A × A with

partial structure (addition, multiplication) such that S ⊆ A with S2 ⊆ ⊙ extends to commutative C*-algebra T with T 2 ⊆ ⊙.

◮ There is equivalence

pAWstar pCBool COrtho

Proj F ◮ Definition: an active lattice is a complete orthomodular lattice

P, together with a group G generated by P ≃ Proj(F(P)), and an action of G on P with induced action on F(P) conjugation. Theorem: A → (Proj(A), Sym(A), conjugation) is full and faithful

8 / 13

slide-30
SLIDE 30

Active lattices: details

◮ Symmetry group Sym(A) ⊆ U(A) generated by {1 − 2p}

◮ if A commutative, then Sym(A) is Boolean ring Proj(A) ◮ if A = Mn(C) type I≥2, then Sym(A) = det−1(Sym(C)) ◮ If A type I∞, II, III, then Sym(A) = U(A)

◮ A piecewise C*-algebra is reflexive symmetric ⊙ ⊆ A × A with

partial structure (addition, multiplication) such that S ⊆ A with S2 ⊆ ⊙ extends to commutative C*-algebra T with T 2 ⊆ ⊙.

◮ There is equivalence

pAWstar pCBool COrtho

Proj F ◮ Definition: an active lattice is a complete orthomodular lattice

P, together with a group G generated by P ≃ Proj(F(P)), and an action of G on P with induced action on F(P) conjugation. Theorem: A → (Proj(A), Sym(A), conjugation) is full and faithful Lesson: ‘Noncommutative sets’ have hidden actionn

8 / 13

slide-31
SLIDE 31

Discretization

How go from ‘noncommutative sets’ to ‘noncommutative topologies’? Definition: a discretization of a C*-algebra A is a morphism A M C(X) ℓ∞(X) φ Where can M live?

9 / 13

slide-32
SLIDE 32

Discretization

How go from ‘noncommutative sets’ to ‘noncommutative topologies’? Definition: a discretization of a C*-algebra A is a morphism A M C(X) ℓ∞(X) φ Where can M live?

◮ Free products gives faithful φ into Cstar, but not functorial ◮ Colimits give functorial φ into Cstar, but not faithful

9 / 13

slide-33
SLIDE 33

Discretization

How go from ‘noncommutative sets’ to ‘noncommutative topologies’? Definition: a discretization of a C*-algebra A is a morphism A M C(X) ℓ∞(X) φ Where can M live?

◮ Free products gives faithful φ into Cstar, but not functorial ◮ Colimits give functorial φ into Cstar, but not faithful ◮ C ⊕ K(H) ֒

→ B(H) is faithful functorial into Wstar

9 / 13

slide-34
SLIDE 34

Discretization

How go from ‘noncommutative sets’ to ‘noncommutative topologies’? Definition: a discretization of a C*-algebra A is a morphism A M C(X) ℓ∞(X) φ Where can M live?

◮ Free products gives faithful φ into Cstar, but not functorial ◮ Colimits give functorial φ into Cstar, but not faithful ◮ C ⊕ K(H) ֒

→ B(H) is faithful functorial into Wstar

◮ Mn(C(X)) ֒

→ Mn(ℓ∞(X)) is faithful functorial into Wstar

◮ Mn(C(X)) ֒

→ Mn(CX) is faithful functorial into proCstar

9 / 13

slide-35
SLIDE 35

Discretization

How go from ‘noncommutative sets’ to ‘noncommutative topologies’? Definition: a discretization of a C*-algebra A is a morphism A M C(X) ℓ∞(X) φ Where can M live?

◮ Free products gives faithful φ into Cstar, but not functorial ◮ Colimits give functorial φ into Cstar, but not faithful ◮ C ⊕ K(H) ֒

→ B(H) is faithful functorial into Wstar

◮ Mn(C(X)) ֒

→ Mn(ℓ∞(X)) is faithful functorial into Wstar

◮ Mn(C(X)) ֒

→ Mn(CX) is faithful functorial into proCstar

◮ A → limI A/I faithful functorial into Wstar or proCstar

for residually finite-dimensional subhomogeneous A

9 / 13

slide-36
SLIDE 36

Discretization: another obstruction

Definition: State

  • − dµ: C(X) → C diffuse when µ has no atoms.

Pair C, D ∈ C(A) is relatively diffuse when every extension of pure state of D to A restricts to diffuse state on C.

10 / 13

slide-37
SLIDE 37

Discretization: another obstruction

Definition: State

  • − dµ: C(X) → C diffuse when µ has no atoms.

Pair C, D ∈ C(A) is relatively diffuse when every extension of pure state of D to A restricts to diffuse state on C. Example: C = L∞[0, 1], D = ℓ∞(N), A = B(L2[0, 1])

[Kadison-Singer]

10 / 13

slide-38
SLIDE 38

Discretization: another obstruction

Definition: State

  • − dµ: C(X) → C diffuse when µ has no atoms.

Pair C, D ∈ C(A) is relatively diffuse when every extension of pure state of D to A restricts to diffuse state on C. Example: C = L∞[0, 1], D = ℓ∞(N), A = B(L2[0, 1])

[Kadison-Singer]

Theorem: If C ≃ D ≃ C(X) A C(Y ) ℓ∞(X) M ℓ∞(Y )

φ φC φD

then φC(δx)φD(δy) = 0.

[H & Reyes, 2016]

10 / 13

slide-39
SLIDE 39

Discretization: another obstruction

Definition: State

  • − dµ: C(X) → C diffuse when µ has no atoms.

Pair C, D ∈ C(A) is relatively diffuse when every extension of pure state of D to A restricts to diffuse state on C. Example: C = L∞[0, 1], D = ℓ∞(N), A = B(L2[0, 1])

[Kadison-Singer]

Theorem: If C ≃ D ≃ C(X) A C(Y ) ℓ∞(X) M ℓ∞(Y )

φ φC φD

then φC(δx)φD(δy) = 0.

[H & Reyes, 2016]

Corollary: Functorial discretizations Cstar → AWstar map A to 0

10 / 13

slide-40
SLIDE 40

Discretization: another obstruction

Definition: State

  • − dµ: C(X) → C diffuse when µ has no atoms.

Pair C, D ∈ C(A) is relatively diffuse when every extension of pure state of D to A restricts to diffuse state on C. Example: C = L∞[0, 1], D = ℓ∞(N), A = B(L2[0, 1])

[Kadison-Singer]

Theorem: If C ≃ D ≃ C(X) A C(Y ) ℓ∞(X) M ℓ∞(Y )

φ φC φD

then φC(δx)φD(δy) = 0.

[H & Reyes, 2016]

Corollary: Functorial discretizations Cstar → AWstar map A to 0 Lesson: Discretization needs other global coherence structure of projections than that of AW*-algebras.

10 / 13

slide-41
SLIDE 41

Conclusion

◮ It pays to take commutative subalgebras seriously ◮ Functoriality crucial to ensure they fit together ◮ Leads to active lattices as ‘noncommutative sets’ ◮ But not good enough for ‘noncommutative topology’

11 / 13

slide-42
SLIDE 42

References

◮ B. van den Berg, C. Heunen ‘Extending obstructions to noncommutative functorial spectra’ Theory and Applications of Categories 29(17):457–474, 2014 ◮ C. Heunen, N. P. Landsman, B. Spitters ‘A topos for algebraic quantum theory’ Communications in Mathematical Physics 291:63–110, 2009 ◮ C. Heunen ‘Characterizations of categories of commutative C*-subalgebras’ Communications in Mathematical Physics 331(1):215-238, 2014 ◮ C. Heunen, M. L. Reyes ‘Active lattices determine AW*-algebras’ Journal of Mathematical Analysis and Applications 416:289-313, 2014 ◮ C. Heunen, A. Lindenhovius ‘Domains of commutative C*-subalgebras’ Logic in Computer Science 450–461, 2015 ◮ C. Heunen, M. L. Reyes ‘Discretization of C*-algebras’ Journal of Operator Theory to appear 2016

12 / 13

slide-43
SLIDE 43

Topos trick

◮ Consider ‘contextual sets’ over C*-algebra A:

assignment of set S(C) to each C ∈ C(A) such that C ⊆ D implies S(C) ֒ → S(D)

◮ They form a topos T(A):

category whose objects behave a lot like sets in particular, it has a logic of its own!

◮ There is a canonical contextual set A given by C → C ◮ T(A) believes that A is a commutative C*-algebra ◮ A has spectrum within T(A)

corresponds externally to map into C(A)

13 / 13