conjugacies between dynamical systems and their crossed
play

Conjugacies between dynamical systems, and their crossed products. - PowerPoint PPT Presentation

The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks Conjugacies between dynamical systems, and their crossed products. Wei Sun Research Center for Operator Algebras


  1. The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks ”Conjugacies” between dynamical systems, and their crossed products. Wei Sun Research Center for Operator Algebras Department of Mathematics East China Normal University, Shanghai 42nd COZy, Fields Institute, Toronto. 27-06-2014

  2. The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks For compact infinite metric spaces X and Y , and for two minimal homeomorphism α : X → X and β : Y → Y , starting from information on crossed products C ( X ) ⋊ α Z and C ( Y ) ⋊ β Z , what can we say about the relation between two dynamical systems ( X , α ) and ( Y , β )? Dictionary: For crossed product C ∗ -algebras: Simpleness, isomorphisms, structured isomorphisms, tracial spaces, etc.. For dynamical systems: Minimality, Rokhlin dimension, invariant probability measures, induced (co)homology maps, (flip) conjugacy, weak conjugacy, orbit equivalence, etc.. Spoiler: The main thing to connect dynamical system side and crossed product side is to find the “right descriptions”.

  3. The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks For compact infinite metric spaces X and Y , and for two minimal homeomorphism α : X → X and β : Y → Y , starting from information on crossed products C ( X ) ⋊ α Z and C ( Y ) ⋊ β Z , what can we say about the relation between two dynamical systems ( X , α ) and ( Y , β )? Dictionary: For crossed product C ∗ -algebras: Simpleness, isomorphisms, structured isomorphisms, tracial spaces, etc.. For dynamical systems: Minimality, Rokhlin dimension, invariant probability measures, induced (co)homology maps, (flip) conjugacy, weak conjugacy, orbit equivalence, etc.. Spoiler: The main thing to connect dynamical system side and crossed product side is to find the “right descriptions”.

  4. The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks For compact infinite metric spaces X and Y , and for two minimal homeomorphism α : X → X and β : Y → Y , starting from information on crossed products C ( X ) ⋊ α Z and C ( Y ) ⋊ β Z , what can we say about the relation between two dynamical systems ( X , α ) and ( Y , β )? Dictionary: For crossed product C ∗ -algebras: Simpleness, isomorphisms, structured isomorphisms, tracial spaces, etc.. For dynamical systems: Minimality, Rokhlin dimension, invariant probability measures, induced (co)homology maps, (flip) conjugacy, weak conjugacy, orbit equivalence, etc.. Spoiler: The main thing to connect dynamical system side and crossed product side is to find the “right descriptions”.

  5. The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks For compact infinite metric spaces X and Y , and for two minimal homeomorphism α : X → X and β : Y → Y , starting from information on crossed products C ( X ) ⋊ α Z and C ( Y ) ⋊ β Z , what can we say about the relation between two dynamical systems ( X , α ) and ( Y , β )? Dictionary: For crossed product C ∗ -algebras: Simpleness, isomorphisms, structured isomorphisms, tracial spaces, etc.. For dynamical systems: Minimality, Rokhlin dimension, invariant probability measures, induced (co)homology maps, (flip) conjugacy, weak conjugacy, orbit equivalence, etc.. Spoiler: The main thing to connect dynamical system side and crossed product side is to find the “right descriptions”.

  6. The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks For compact infinite metric spaces X and Y , and for two minimal homeomorphism α : X → X and β : Y → Y , starting from information on crossed products C ( X ) ⋊ α Z and C ( Y ) ⋊ β Z , what can we say about the relation between two dynamical systems ( X , α ) and ( Y , β )? Dictionary: For crossed product C ∗ -algebras: Simpleness, isomorphisms, structured isomorphisms, tracial spaces, etc.. For dynamical systems: Minimality, Rokhlin dimension, invariant probability measures, induced (co)homology maps, (flip) conjugacy, weak conjugacy, orbit equivalence, etc.. Spoiler: The main thing to connect dynamical system side and crossed product side is to find the “right descriptions”.

  7. � � � The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks Definition Let X and Y be two compact metric spaces. Let ( X , α ) and ( Y , β ) be two dynamical systems. They are conjugate if there exists σ ∈ Homeo( X , Y ) such that σ ◦ α = β ◦ σ . That is, the following diagram commutes: α X X σ σ β � Y Y Definition Let X and Y be two compact metric spaces. Let ( X , α ) and ( Y , β ) be two dynamical systems. They are flip conjugate if ( X , α ) is conjugate to either ( Y , β ) or ( Y , β − 1 ).

  8. � � � The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks Definition Let X and Y be two compact metric spaces. Let ( X , α ) and ( Y , β ) be two dynamical systems. They are conjugate if there exists σ ∈ Homeo( X , Y ) such that σ ◦ α = β ◦ σ . That is, the following diagram commutes: α X X σ σ β � Y Y Definition Let X and Y be two compact metric spaces. Let ( X , α ) and ( Y , β ) be two dynamical systems. They are flip conjugate if ( X , α ) is conjugate to either ( Y , β ) or ( Y , β − 1 ).

  9. � � � The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks Definition Let X and Y be two compact metric spaces. Let ( X , α ) and ( Y , β ) be two dynamical systems. They are conjugate if there exists σ ∈ Homeo( X , Y ) such that σ ◦ α = β ◦ σ . That is, the following diagram commutes: α X X σ σ β � Y Y Definition Let X and Y be two compact metric spaces. Let ( X , α ) and ( Y , β ) be two dynamical systems. They are flip conjugate if ( X , α ) is conjugate to either ( Y , β ) or ( Y , β − 1 ).

  10. � � � � � � The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks Definition Let X and Y be two compact metric spaces. Let ( X , α ) and ( Y , β ) be two dynamical systems. They are weakly (approximately) conjugate if there exist { σ n ∈ Homeo ( X , Y ) } and { τ n ∈ Homeo ( Y , X ) } , such that dist( g ◦ β, g ◦ τ − 1 ◦ α ◦ τ n ) → 0 and dist( f ◦ α, f ◦ σ − 1 ◦ β ◦ σ n ) → 0 for all n n f ∈ C ( X ) and g ∈ C ( Y ). Roughly speaking, the diagrams below “approximately” commute: α α � X X X X σ n σ n τ n τ n β β � Y Y Y Y Remark: Generally speaking, weak approximate conjugacy might not be an equivalence relation at all.

  11. � � � � � � The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks Definition Let X and Y be two compact metric spaces. Let ( X , α ) and ( Y , β ) be two dynamical systems. They are weakly (approximately) conjugate if there exist { σ n ∈ Homeo ( X , Y ) } and { τ n ∈ Homeo ( Y , X ) } , such that dist( g ◦ β, g ◦ τ − 1 ◦ α ◦ τ n ) → 0 and dist( f ◦ α, f ◦ σ − 1 ◦ β ◦ σ n ) → 0 for all n n f ∈ C ( X ) and g ∈ C ( Y ). Roughly speaking, the diagrams below “approximately” commute: α α � X X X X σ n σ n τ n τ n β β � Y Y Y Y Remark: Generally speaking, weak approximate conjugacy might not be an equivalence relation at all.

  12. � � � � � � The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks Definition Let X and Y be two compact metric spaces. Let ( X , α ) and ( Y , β ) be two dynamical systems. They are weakly (approximately) conjugate if there exist { σ n ∈ Homeo ( X , Y ) } and { τ n ∈ Homeo ( Y , X ) } , such that dist( g ◦ β, g ◦ τ − 1 ◦ α ◦ τ n ) → 0 and dist( f ◦ α, f ◦ σ − 1 ◦ β ◦ σ n ) → 0 for all n n f ∈ C ( X ) and g ∈ C ( Y ). Roughly speaking, the diagrams below “approximately” commute: α α � X X X X σ n σ n τ n τ n β β � Y Y Y Y Remark: Generally speaking, weak approximate conjugacy might not be an equivalence relation at all.

  13. The Goal Terminologies General Strategy Good news Bad news One possible approach to fix it Concluding remarks Definition (Lin) Let ( X , α ) and ( Y , β ) be two minimal dynamical systems. Assume that C ( X ) ⋊ α Z and C ( Y ) ⋊ β Z both have tracial rank zero. We say that ( X , α ) and ( Y , β ) are approximately K -conjugate if there exist homeomorphisms σ n : X → Y , τ n : Y → X and unital order isomorphisms ρ : K ∗ ( C ( Y ) ⋊ β Z ) → K ∗ ( C ( X ) ⋊ α Z ), such that σ n ◦ α ◦ σ − 1 → β, τ n ◦ β ◦ τ − 1 → α n n and the associated asymptotic morphisms ψ n : C ( Y ) ⋊ β Z → C ( X ) ⋊ α Z and ϕ n : C ( X ) ⋊ α Z → C ( Y ) ⋊ β Z “induce” the order isomorphisms ρ and ρ − 1 correspondingly. Roughly speaking, approximate K -conjugacy = weak (approximate) conjugacy + “ K -theoretic compatibility”.

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