PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] $C^*$-algebras have approximate identities (Theorem)

In this entry $ \leq$ has three different meanings:

  1. - The ordering of self-adjoint elements of a given $ C^*$-algebra.
  2. - The usual order in $ \mathbb{R}$.
  3. - The order of a directed set taken as the domain of a given net.
It will be clear from the context which one is being used.

Theorem - Every $ C^*$-algebra has an approximate identity $ (e_{\lambda})_{\lambda \in \Lambda}$. Moreover, the approximate identity $ (e_{\lambda})_{\lambda \in \Lambda}$ can be chosen to satisfy the following properties:

For separable $ C^*$-algebras the approximate identity can be chosen as an increasing sequence $ 0\leq e_1 \leq e_2 \leq \dots$ of norm-one elements.



Anyone with an account can edit this entry. Please help improve it!

"$C^*$-algebras have approximate identities" is owned by asteroid.
(view preamble)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: sequence, increasing, approximate identity, clear, net, domain, directed set
There are 2 references to this entry.

This is version 1 of $C^*$-algebras have approximate identities, born on 2007-08-28.
Object id is 9901, canonical name is CAlgebrasHaveApproximateIdentities.
Accessed 680 times total.

Classification:
AMS MSC46L05 (Functional analysis :: Selfadjoint operator algebras :: General theory of $C^*$-algebras)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)