functorial spectra and discretization of c algebras
play

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


  1. Functorial spectra and discretization of C*-algebras Chris Heunen 1 / 13

  2. Introduction Hom( − , C ) KHaus op Equivalence cCstar 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

  3. Obstruction Theorem : If C has strict initial object ∅ and I continuous, Spec KHaus op cCstar I C op Cstar F then F ( M n ( C )) = ∅ for all n > 2. [Berg & H, 2014] 3 / 13

  4. Obstruction Theorem : If C has strict initial object ∅ and I continuous, Spec KHaus op cCstar I C op Cstar F then F ( M n ( C )) = ∅ for all n > 2. [Berg & H, 2014] Proof : 1. define K : cCstar → C op by A �→ lim C ⊆ 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(colim C ⊆ A C )) 5. Kochen-Specker: colim C ⊆ M n ( C ) Proj( C ) is Boolean algebra 1 6. so F ( M n ( C )) → K ( M n ( C )) = ∅ 3 / 13

  5. Obstruction Theorem : If C has strict initial object ∅ and I continuous, Spec KHaus op cCstar I C op Cstar F then F ( M n ( C )) = ∅ for all n > 2. [Berg & H, 2014] Remarks : ◮ Rules out sets, schemes, locales, quantales, ringed toposes, ... ◮ Not just M n ( C ): W*-algebras without summands C or M 2 ( 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

  6. Obstruction Theorem : If C has strict initial object ∅ and I continuous, Spec KHaus op cCstar I C op Cstar F then F ( M n ( C )) = ∅ for all n > 2. [Berg & H, 2014] Remarks : ◮ Rules out sets, schemes, locales, quantales, ringed toposes, ... ◮ Not just M n ( C ): W*-algebras without summands C or M 2 ( 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

  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

  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 �≃ A op , but C ( A ) ≃ C ( A op ) 4 / 13

  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 �≃ A op , but C ( A ) ≃ C ( A op ) ◮ Everything commutative: if A, B commutative, [Mendivil 99] C ( A ) ≃ C ( B ) = ⇒ A ≃ B 4 / 13

  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 �≃ A op , but C ( A ) ≃ C ( A op ) ◮ Everything commutative: if A, B commutative, [Mendivil 99] C ( A ) ≃ C ( B ) = ⇒ A ≃ B ◮ Jordan: if A, B are W* have no I 2 summand, [Harding & Doering 10] ⇒ ( A, ◦ ) ≃ ( B, ◦ ) for a ◦ b = 1 C ( A ) ≃ C ( B ) = 2 ( ab + ba ) 4 / 13

  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 �≃ A op , but C ( A ) ≃ C ( A op ) ◮ Everything commutative: if A, B commutative, [Mendivil 99] C ( A ) ≃ C ( B ) = ⇒ A ≃ B ◮ Jordan: if A, B are W* have no I 2 summand, [Harding & Doering 10] ⇒ ( A, ◦ ) ≃ ( B, ◦ ) for a ◦ b = 1 C ( A ) ≃ C ( B ) = 2 ( ab + ba ) ◮ Quasi-Jordan: if A not C 2 or M 2 ( C ), [Hamhalter 11] C ( A ) ≃ C ( B ) = ⇒ ( A, ◦ ) ≃ ( B, ◦ ) quasi-linear 4 / 13

  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 �≃ A op , but C ( A ) ≃ C ( A op ) ◮ Everything commutative: if A, B commutative, [Mendivil 99] C ( A ) ≃ C ( B ) = ⇒ A ≃ B ◮ Jordan: if A, B are W* have no I 2 summand, [Harding & Doering 10] ⇒ ( A, ◦ ) ≃ ( B, ◦ ) for a ◦ b = 1 C ( A ) ≃ C ( B ) = 2 ( ab + ba ) ◮ Quasi-Jordan: if A not C 2 or M 2 ( 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

  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

  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

  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

  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

  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

  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

  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

  20. Active lattices ◮ Restrict to ‘noncommutative sets and functions’ AW*-algebras: abundance of projections [Kaplansky 51] 7 / 13

  21. Active lattices ◮ Restrict to ‘noncommutative sets and functions’ AW*-algebras: abundance of projections [Kaplansky 51] ◮ May replace AWstar C Proj → Poset with AWstar − → Poset Not full and faithful 7 / 13

  22. Active lattices ◮ Restrict to ‘noncommutative sets and functions’ AW*-algebras: abundance of projections [Kaplansky 51] ◮ May replace AWstar C Proj → Poset with AWstar − → Poset Not full and faithful ◮ Use action to make it full and faithful [H & Reyes 14] AWstar Proj U Group Poset 7 / 13

  23. Active lattices ◮ Restrict to ‘noncommutative sets and functions’ AW*-algebras: abundance of projections [Kaplansky 51] ◮ May replace AWstar C Proj → Poset with AWstar − → Poset Not full and faithful ◮ Use action to make it full and faithful [H & Reyes 14] AWstar Proj U Group Poset p 1 − 2 p upu ∗ u 7 / 13

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend