Positive element

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics, an element of a *-algebra is called positive if it is the sum of elements of the form a*a.[1]

Definition

[edit | edit source]

Let 𝒜 be a *-algebra. An element a𝒜 is called positive if there are finitely many elements ak𝒜(k=1,2,,n), so that a=k=1nak*ak holds.[1] This is also denoted by a0.[2]

The set of positive elements is denoted by 𝒜+.

A special case from particular importance is the case where 𝒜 is a complete normed *-algebra, that satisfies the C*-identity (a*a=a2 a𝒜), which is called a C*-algebra.

Examples

[edit | edit source]
  • The unit element e of an unital *-algebra is positive.
  • For each element a𝒜, the elements a*a and aa* are positive by definition.[1]

In case 𝒜 is a C*-algebra, the following holds:

Criteria

[edit | edit source]

Let 𝒜 be a C*-algebra and a𝒜. Then the following are equivalent:[4]

  • For the spectrum σ(a)[0,) holds and a is a normal element.
  • There exists an element b𝒜, such that a=bb*.
  • There exists a (unique) self-adjoint element c𝒜sa such that a=c2.

If 𝒜 is a unital *-algebra with unit element e, then in addition the following statements are equivalent:[5]

  • teat for every ta and a is a self-adjoint element.
  • teat for some ta and a is a self-adjoint element.

Properties

[edit | edit source]

In *-algebras

[edit | edit source]

Let 𝒜 be a *-algebra. Then:

  • If a𝒜+ is a positive element, then a is self-adjoint.[6]
  • The set of positive elements 𝒜+ is a convex cone in the real vector space of the self-adjoint elements 𝒜sa. This means that αa,a+b𝒜+ holds for all a,b𝒜 and α[0,).[6]
  • If a𝒜+ is a positive element, then b*ab is also positive for every element b𝒜.[7]
  • For the linear span of 𝒜+ the following holds: 𝒜+=𝒜2 and 𝒜+𝒜+=𝒜sa𝒜2.[8]

In C*-algebras

[edit | edit source]

Let 𝒜 be a C*-algebra. Then:

  • Using the continuous functional calculus, for every a𝒜+ and n there is a uniquely determined b𝒜+ that satisfies bn=a, i.e. a unique n-th root. In particular, a square root exists for every positive element. Since for every b𝒜 the element b*b is positive, this allows the definition of a unique absolute value: |b|=(b*b)12.[9]
  • For every real number α0 there is a positive element aα𝒜+ for which aαaβ=aα+β holds for all β[0,). The mapping αaα is continuous. Negative values for α are also possible for invertible elements a.[7]
  • Products of commutative positive elements are also positive. So if ab=ba holds for positive a,b𝒜+, then ab𝒜+.[5]
  • Each element a𝒜 can be uniquely represented as a linear combination of four positive elements. To do this, a is first decomposed into the self-adjoint real and imaginary parts and these are then decomposed into positive and negative parts using the continuous functional calculus.[10] For it holds that 𝒜sa=𝒜+𝒜+, since 𝒜2=𝒜.[8]
  • If both a and a are positive a=0 holds.[5]
  • If is a C*-subalgebra of 𝒜, then +=𝒜+.[5]
  • If is another C*-algebra and Φ is a *-homomorphism from 𝒜 to , then Φ(𝒜+)=Φ(𝒜)+ holds.[11]
  • If a,b𝒜+ are positive elements for which ab=0, they commutate and a+b=max(a,b) holds. Such elements are called orthogonal and one writes ab.[12]

Partial order

[edit | edit source]

Let 𝒜 be a *-algebra. The property of being a positive element defines a translation invariant partial order on the set of self-adjoint elements 𝒜sa. If ba𝒜+ holds for a,b𝒜, one writes ab or ba.[13]

This partial order fulfills the properties tatb and a+cb+c for all a,b,c𝒜sa with ab and t[0,).[8]

If 𝒜 is a C*-algebra, the partial order also has the following properties for a,b𝒜:

  • If ab holds, then c*acc*bc is true for every c𝒜. For every c𝒜+ that commutates with a and b even acbc holds.[14]
  • If bab holds, then ab.[15]
  • If 0ab holds, then aαbα holds for all real numbers 0<α1.[16]
  • If a is invertible and 0ab holds, then b is invertible and for the inverses b1a1 holds.[15]

See also

[edit | edit source]

Citations

[edit | edit source]

References

[edit | edit source]
  1. ^ a b c Palmer 2001, p. 798.
  2. ^ Blackadar 2006, p. 63.
  3. ^ a b Kadison & Ringrose 1983, p. 271.
  4. ^ Kadison & Ringrose 1983, pp. 247–248.
  5. ^ a b c d Kadison & Ringrose 1983, p. 245.
  6. ^ a b Palmer 2001, p. 800.
  7. ^ a b Blackadar 2006, p. 64.
  8. ^ a b c Palmer 2001, p. 802.
  9. ^ Blackadar 2006, pp. 63–65.
  10. ^ Kadison & Ringrose 1983, p. 247.
  11. ^ Dixmier 1977, p. 18.
  12. ^ Blackadar 2006, p. 67.
  13. ^ Palmer 2001, p. 799.
  14. ^ Kadison & Ringrose 1983, p. 249.
  15. ^ a b Kadison & Ringrose 1983, p. 250.
  16. ^ Blackadar 2006, p. 66.

Bibliography

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). English translation of Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).