c algebras of matricially ordered semigroups
play

C*-algebras of Matricially Ordered *-Semigroups Berndt Brenken COSy - PowerPoint PPT Presentation

C*-algebras of Matricially Ordered *-Semigroups Berndt Brenken COSy 2014 Preface Universal C*-algebras involving an automorphism realized via an implementing unitary, or an endomorphism via an isometry, have played a fundamental role in


  1. C*-algebras of Matricially Ordered *-Semigroups Berndt Brenken COSy 2014

  2. Preface Universal C*-algebras involving an automorphism realized via an implementing unitary, or an endomorphism via an isometry, have played a fundamental role in operator algebras. Such maps preserve algebraic structure.

  3. Preface Universal C*-algebras involving an automorphism realized via an implementing unitary, or an endomorphism via an isometry, have played a fundamental role in operator algebras. Such maps preserve algebraic structure. A map of a C*-algebra defined via an implementing partial isometry does not preserve algebra structure. It is, however, a completely positive *-linear map.

  4. Preface Universal C*-algebras involving an automorphism realized via an implementing unitary, or an endomorphism via an isometry, have played a fundamental role in operator algebras. Such maps preserve algebraic structure. A map of a C*-algebra defined via an implementing partial isometry does not preserve algebra structure. It is, however, a completely positive *-linear map. We consider *-semigroups S , matricial partial order orders on S , along with a universal C*-algebra associated with S and a matricial ordering on S .

  5. For a particular example of a matrically ordered *-semigroup S along with complete order map on S , we obtain a C*-correspondence over the associated C*-algebra of S . The complete order map is implemented by a partial isometry in the Cuntz-Pimsner C*-algebra associated with the correspondence.

  6. For a particular example of a matrically ordered *-semigroup S along with complete order map on S , we obtain a C*-correspondence over the associated C*-algebra of S . The complete order map is implemented by a partial isometry in the Cuntz-Pimsner C*-algebra associated with the correspondence. The resulting Cuntz-Pimsner C*-algebra for this example is the universal C*-algebra P generated by a partial isometry.

  7. For a particular example of a matrically ordered *-semigroup S along with complete order map on S , we obtain a C*-correspondence over the associated C*-algebra of S . The complete order map is implemented by a partial isometry in the Cuntz-Pimsner C*-algebra associated with the correspondence. The resulting Cuntz-Pimsner C*-algebra for this example is the universal C*-algebra P generated by a partial isometry. It is known that P is nonunital, nonexact, residually finite dimensional, and Morita equivalent to the universal C*-algebra generated by a contraction.

  8. *-semigroups A *-semigroup is a semigroup, so a set S with an associative binary operation, along with an involutive antihomomorphism, denoted *.

  9. *-semigroups A *-semigroup is a semigroup, so a set S with an associative binary operation, along with an involutive antihomomorphism, denoted *. There may be different involutive *-maps on the same underlying semigroup.

  10. *-semigroups A *-semigroup is a semigroup, so a set S with an associative binary operation, along with an involutive antihomomorphism, denoted *. There may be different involutive *-maps on the same underlying semigroup. Examples: Any abelian semigroup (with a ∗ = a )

  11. *-semigroups A *-semigroup is a semigroup, so a set S with an associative binary operation, along with an involutive antihomomorphism, denoted *. There may be different involutive *-maps on the same underlying semigroup. Examples: Any abelian semigroup (with a ∗ = a ) A group G , or an inverse semigroup S , are examples of *-semigroups, where a ∗ = a − 1 .

  12. *-semigroups A *-semigroup is a semigroup, so a set S with an associative binary operation, along with an involutive antihomomorphism, denoted *. There may be different involutive *-maps on the same underlying semigroup. Examples: Any abelian semigroup (with a ∗ = a ) A group G , or an inverse semigroup S , are examples of *-semigroups, where a ∗ = a − 1 . For B a C*-algebra, the contractions (or strict contractions) in B viewed as a semigroup under multiplication, with * the usual involution. In particular, for H a Hilbert space and B = B ( H ) .

  13. Matricial order For a semigroup S the set of k × k matrices with entries in S , M k ( S ) , does not inherit much algebraic structure through S . However, the *-structure, along with multiplication of specific types of matrices over S is sufficient to provide some context for an order structure.

  14. Matricial order For a semigroup S the set of k × k matrices with entries in S , M k ( S ) , does not inherit much algebraic structure through S . However, the *-structure, along with multiplication of specific types of matrices over S is sufficient to provide some context for an order structure. For k ∈ N , let [ n i ] denote an element [ n 1 , ..., n k ] ∈ M 1 , k ( S ) , the 1 × n matrices with entries in S . Then [ n i ] ∗ ∈ M k , 1 ( S ) , a k × 1 matrix over S ,

  15. Matricial order For a semigroup S the set of k × k matrices with entries in S , M k ( S ) , does not inherit much algebraic structure through S . However, the *-structure, along with multiplication of specific types of matrices over S is sufficient to provide some context for an order structure. For k ∈ N , let [ n i ] denote an element [ n 1 , ..., n k ] ∈ M 1 , k ( S ) , the 1 × n matrices with entries in S . Then [ n i ] ∗ ∈ M k , 1 ( S ) , a k × 1 matrix over S , and the element [ n i ] ∗ [ n j ] = [ n ∗ i n j ] ∈ M k ( S ) sa .

  16. For the case of a C*-algebra B , the sequence of partially ordered sets M k ( B ) sa satisfy some basic interconnections among their positive elements.

  17. For the case of a C*-algebra B , the sequence of partially ordered sets M k ( B ) sa satisfy some basic interconnections among their positive elements. For example, if � a 1 , 1 � a 1 , 2 a 2 , 1 a 2 , 2 is positive in M 2 ( B ) sa then   a 1 , 1 a 1 , 2 a 1 , 2 a 2 , 1 a 2 , 2 a 2 , 2   a 2 , 1 a 2 , 2 a 2 , 2 is also positive in M 3 ( B ) sa .

  18. We may describe this property using d -tuples of natural numbers as ordered partitions of k where zero summands are allowed.

  19. We may describe this property using d -tuples of natural numbers as ordered partitions of k where zero summands are allowed. Notation: For d , k ∈ N and d ≤ k , set � d � ( t 1 , ..., t d ) ∈ ( N 0 ) d | � P ( d , k ) = t r = k . r =1

  20. We may describe this property using d -tuples of natural numbers as ordered partitions of k where zero summands are allowed. Notation: For d , k ∈ N and d ≤ k , set � d � ( t 1 , ..., t d ) ∈ ( N 0 ) d | � P ( d , k ) = t r = k . r =1 Each τ = ( t 1 , ..., t d ) ∈ P ( d , k ) yields a *-map ι τ : M d ( B ) → M k ( B ) . For [ a i , j ] ∈ M d ( B ) the element ι τ ([ a i , j ]) := [ a i , j ] τ ∈ M k ( B ) is the matrix obtained using matrix blocks; the i , j block of [ a i , j ] τ is the t i × t j matrix with the constant entry a i , j .

  21. The following Lemma shows that the maps ι τ map positive elements to positive elements.

  22. The following Lemma shows that the maps ι τ map positive elements to positive elements. Lemma For τ = ( t 1 , ..., t d ) ∈ P ( d , k ) and [ b i , j ] ∈ M r , d ( B ) . There is [ c i , j ] ∈ M r , k ( B ) , whose entries appear in [ b i , j ] , such that ι τ ([ b i , j ] ∗ [ b i , j ]) = [ c i , j ] ∗ [ c i , j ] . Proof. For 1 ≤ i ≤ r let the r × k matrix [ c i , j ] have i -th row [ b i 1 , ..., b i 1 , b i 2 , ..., b i 2 , ..., b id , ..., b id ] where each element b ij appears repeated t j consecutive times.

  23. Note that the maps ι τ are defined even if the matrix entries are from a set, so in particular for matrices with entries from a *-semigroup S , and although there is no natural ’posi- tivity’ for matrices with entries in S one can still use partial orderings.

  24. Note that the maps ι τ are defined even if the matrix entries are from a set, so in particular for matrices with entries from a *-semigroup S , and although there is no natural ’posi- tivity’ for matrices with entries in S one can still use partial orderings. Definition A *-semigroup S is matricially ordered, write ( S , � , M ) , if there is a sequence of partially ordered sets ( M k ( S ) , � ) , M k ( S ) ⊆ M k ( S ) sa ( k ∈ N ) , with M 1 ( S ) = S sa , satisfying (for [ n i ] ∈ M 1 , k ( S )) a. [ n i ] ∗ [ n j ] = [ n ∗ i n j ] ∈ M k ( S ) b. if [ a i , j ] � [ b i , j ] in M k ( S ) then [ n ∗ i a i , j n j ] � [ n ∗ i b i , j n j ] in M k ( S ) c. the maps ι τ : M d ( S ) → M k ( S ) are order maps for all τ ∈ P ( d , k ) .

  25. The lemma above showed that a C*-algebra B has a matricial order where M k ( B ) is the usual partially ordered set M k ( B ) sa .

  26. The lemma above showed that a C*-algebra B has a matricial order where M k ( B ) is the usual partially ordered set M k ( B ) sa . We may define *-maps β : S → T of matricially ordered *-semigroups S and T that are complete order maps - so β k : M k ( S ) → M k ( T ) is defined, and an order map of partially ordered sets. A completely positive map of C*-algebras is then a complete order map. A complete order representation of a matricially ordered *-semigroup S into a C*-algebra is a *-homomorphism which is a complete order map.

Recommend


More recommend