continuous orbit equivalence rigidity
play

Continuous orbit equivalence rigidity Xin Li Dynamical systems and - PowerPoint PPT Presentation

Continuous orbit equivalence rigidity Xin Li Dynamical systems and operator algebras Dynamical systems Operator algebras Dynamical systems and operator algebras Dynamical systems


  1. Continuous orbit equivalence rigidity Xin Li

  2. Dynamical systems and operator algebras Dynamical systems ← − − − − − − − − − − − − → Operator algebras

  3. Dynamical systems and operator algebras Dynamical systems ← − − − − − − − − − − − − → Operator algebras ◮ Q.: How to go from dynamical systems to operator algebras?

  4. Dynamical systems and operator algebras Dynamical systems ← − − − − − − − − − − − − → Operator algebras ◮ Q.: How to go from dynamical systems to operator algebras? A.: Crossed product construction.

  5. Dynamical systems and operator algebras Dynamical systems ← − − − − − − − − − − − − → Operator algebras ◮ Q.: How to go from dynamical systems to operator algebras? A.: Crossed product construction. ◮ Q.: Is there a way back???

  6. Dynamical systems and operator algebras Dynamical systems ← − − − − − − − − − − − − → Operator algebras ◮ Q.: How to go from dynamical systems to operator algebras? A.: Crossed product construction. ◮ Q.: Is there a way back??? ◮ More precisely: Given G � X , H � Y , do we have C 0 ( X ) ⋊ r G ∼ = C 0 ( Y ) ⋊ r H ⇒ G � X ∼ H � Y ???

  7. Continuous orbit equivalence

  8. Continuous orbit equivalence G � X , H � Y : topological dynamical systems.

  9. Continuous orbit equivalence G � X , H � Y : topological dynamical systems. Definition G � X and H � Y are conjugate if there exist a homeomorphism ∼ = ∼ = ϕ : X − → Y and an isomorphism ρ : G − → H with ϕ ( g . x ) = ρ ( g ) .ϕ ( x ) for all g ∈ G , x ∈ X .

  10. Continuous orbit equivalence G � X , H � Y : topological dynamical systems. Definition G � X and H � Y are conjugate if there exist a homeomorphism ∼ = ∼ = ϕ : X − → Y and an isomorphism ρ : G − → H with ϕ ( g . x ) = ρ ( g ) .ϕ ( x ) for all g ∈ G , x ∈ X . Definition G � X and H � Y are continuously orbit equivalent if there ∼ = exists a homeomorphism ϕ : X − → Y together with continuous maps a : G × X → H and b : H × Y → G such that

  11. Continuous orbit equivalence G � X , H � Y : topological dynamical systems. Definition G � X and H � Y are conjugate if there exist a homeomorphism ∼ = ∼ = ϕ : X − → Y and an isomorphism ρ : G − → H with ϕ ( g . x ) = ρ ( g ) .ϕ ( x ) for all g ∈ G , x ∈ X . Definition G � X and H � Y are continuously orbit equivalent if there ∼ = exists a homeomorphism ϕ : X − → Y together with continuous maps a : G × X → H and b : H × Y → G such that ϕ ( g . x ) = a ( g , x ) .ϕ ( x ) and ϕ − 1 ( h . y ) = b ( h , y ) .ϕ − 1 ( y ).

  12. Topological dynamics and C*-algebras

  13. Topological dynamics and C*-algebras Theorem G � X, H � Y : topologically free topological dynamical systems. G � X ∼ coe H � Y if and only if there is a C*-isomorphism ∼ = Φ : C 0 ( X ) ⋊ r G − → C 0 ( Y ) ⋊ r H with Φ( C 0 ( X )) = C 0 ( Y ) .

  14. Topological dynamics and C*-algebras Theorem G � X, H � Y : topologically free topological dynamical systems. G � X ∼ coe H � Y if and only if there is a C*-isomorphism ∼ = Φ : C 0 ( X ) ⋊ r G − → C 0 ( Y ) ⋊ r H with Φ( C 0 ( X )) = C 0 ( Y ) . - top. free: for all e � = g ∈ G , { x ∈ X : g . x � = x } is dense in X .

  15. Topological dynamics and C*-algebras Theorem G � X, H � Y : topologically free topological dynamical systems. G � X ∼ coe H � Y if and only if there is a C*-isomorphism ∼ = Φ : C 0 ( X ) ⋊ r G − → C 0 ( Y ) ⋊ r H with Φ( C 0 ( X )) = C 0 ( Y ) . - top. free: for all e � = g ∈ G , { x ∈ X : g . x � = x } is dense in X . ◮ Conjugacy ⇒ COE ⇔ Cartan-isom. ⇒ C*-isom.

  16. Topological dynamics and C*-algebras Theorem G � X, H � Y : topologically free topological dynamical systems. G � X ∼ coe H � Y if and only if there is a C*-isomorphism ∼ = Φ : C 0 ( X ) ⋊ r G − → C 0 ( Y ) ⋊ r H with Φ( C 0 ( X )) = C 0 ( Y ) . - top. free: for all e � = g ∈ G , { x ∈ X : g . x � = x } is dense in X . ◮ Conjugacy ⇒ COE ⇔ Cartan-isom. ⇒ C*-isom. ◮ Can these arrows be reversed?

  17. Continuous orbit equivalence rigidity Can we reverse the first arrow in ◮ Conjugacy ⇒ COE ⇔ Cartan-isom. ⇒ C*-isom.?

  18. Continuous orbit equivalence rigidity Can we reverse the first arrow in ◮ Conjugacy ⇒ COE ⇔ Cartan-isom. ⇒ C*-isom.? ◮ Example (Boyle-Tomiyama 1998): For top. transitive topological dynamical systems of the form Z � X on compact spaces X , Conjugacy ⇐ COE.

  19. Continuous orbit equivalence rigidity Can we reverse the first arrow in ◮ Conjugacy ⇒ COE ⇔ Cartan-isom. ⇒ C*-isom.? ◮ Example (Boyle-Tomiyama 1998): For top. transitive topological dynamical systems of the form Z � X on compact spaces X , Conjugacy ⇐ COE. ⇐ COE for certain Z n � X , ◮ Counterexamples: Conjugacy ✟ ✟

  20. Continuous orbit equivalence rigidity Can we reverse the first arrow in ◮ Conjugacy ⇒ COE ⇔ Cartan-isom. ⇒ C*-isom.? ◮ Example (Boyle-Tomiyama 1998): For top. transitive topological dynamical systems of the form Z � X on compact spaces X , Conjugacy ⇐ COE. ⇐ COE for certain Z n � X , ◮ Counterexamples: Conjugacy ✟ ✟ and also for certain F n � X .

  21. Continuous orbit equivalence and quasi-isometry

  22. Continuous orbit equivalence and quasi-isometry Theorem G � X, H � Y : top. free systems on compact spaces X and Y . Assume G � X ∼ coe H � Y .

  23. Continuous orbit equivalence and quasi-isometry Theorem G � X, H � Y : top. free systems on compact spaces X and Y . Assume G � X ∼ coe H � Y . If G is fin. gen., then so is H, and G and H are quasi-isometric.

  24. Continuous orbit equivalence and quasi-isometry Theorem G � X, H � Y : top. free systems on compact spaces X and Y . Assume G � X ∼ coe H � Y . If G is fin. gen., then so is H, and G and H are quasi-isometric. ◮ A. Thom and R. Sauer have shown that for two groups G and H , there exist top. free systems G � X , H � Y on compact spaces X and Y with G � X ∼ coe H � Y if and only if G and H are bi-Lipschitz equivalent.

  25. An abstract continuous orbit equivalence rigidity result

  26. An abstract continuous orbit equivalence rigidity result Theorem G � X, H � Y : top. free systems.

  27. An abstract continuous orbit equivalence rigidity result Theorem G � X, H � Y : top. free systems. Assume: ◮ X compact, C ( X , Z ) ∼ = Z · 1 ⊕ N as Z G-modules with pd Z G ( N ) < cd ( G ) − 1

  28. An abstract continuous orbit equivalence rigidity result Theorem G � X, H � Y : top. free systems. Assume: ◮ X compact, C ( X , Z ) ∼ = Z · 1 ⊕ N as Z G-modules with pd Z G ( N ) < cd ( G ) − 1 ◮ G: duality group, H: solvable group.

  29. An abstract continuous orbit equivalence rigidity result Theorem G � X, H � Y : top. free systems. Assume: ◮ X compact, C ( X , Z ) ∼ = Z · 1 ⊕ N as Z G-modules with pd Z G ( N ) < cd ( G ) − 1 ◮ G: duality group, H: solvable group. Then G � X ∼ coe H � Y ⇒ G � X ∼ conj H � Y .

  30. A concrete continuous orbit equivalence rigidity result

  31. A concrete continuous orbit equivalence rigidity result Theorem The following systems satisfy COER:

  32. A concrete continuous orbit equivalence rigidity result Theorem The following systems satisfy COER: ◮ G � X G 0 , X 0 compact, | X 0 | > 1 , G: solvable duality group;

  33. A concrete continuous orbit equivalence rigidity result Theorem The following systems satisfy COER: ◮ G � X G 0 , X 0 compact, | X 0 | > 1 , G: solvable duality group; ◮ top. free subshift of G � { 0 , . . . , N } G whose forbidden words avoid the letter 0 , G: solvable duality group;

  34. A concrete continuous orbit equivalence rigidity result Theorem The following systems satisfy COER: ◮ G � X G 0 , X 0 compact, | X 0 | > 1 , G: solvable duality group; ◮ top. free subshift of G � { 0 , . . . , N } G whose forbidden words avoid the letter 0 , G: solvable duality group; ◮ chessboards Z 2 � X ( n ) with n ≥ 4 colours.

  35. The End Thank you!

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