State space of finite dimensional, abelian C*-algebra is a simplex.
Clash Royale CLAN TAG#URR8PPP
up vote
3
down vote
favorite
I am looking for a proof that the state space of a finite dimensional C*-algebra is a simplex and, vice versa, if the state space is a simplex, the C*-algebra is abelian. I've found one proof, but it involves representations and the GNS construction, which is way beyond the scope of what I need.
I was hoping that because I only need the result in finite dimensions, there would be a simple proof. Does anyone have an idea?
functional-analysis operator-algebras c-star-algebras
add a comment |Â
up vote
3
down vote
favorite
I am looking for a proof that the state space of a finite dimensional C*-algebra is a simplex and, vice versa, if the state space is a simplex, the C*-algebra is abelian. I've found one proof, but it involves representations and the GNS construction, which is way beyond the scope of what I need.
I was hoping that because I only need the result in finite dimensions, there would be a simple proof. Does anyone have an idea?
functional-analysis operator-algebras c-star-algebras
add a comment |Â
up vote
3
down vote
favorite
up vote
3
down vote
favorite
I am looking for a proof that the state space of a finite dimensional C*-algebra is a simplex and, vice versa, if the state space is a simplex, the C*-algebra is abelian. I've found one proof, but it involves representations and the GNS construction, which is way beyond the scope of what I need.
I was hoping that because I only need the result in finite dimensions, there would be a simple proof. Does anyone have an idea?
functional-analysis operator-algebras c-star-algebras
I am looking for a proof that the state space of a finite dimensional C*-algebra is a simplex and, vice versa, if the state space is a simplex, the C*-algebra is abelian. I've found one proof, but it involves representations and the GNS construction, which is way beyond the scope of what I need.
I was hoping that because I only need the result in finite dimensions, there would be a simple proof. Does anyone have an idea?
functional-analysis operator-algebras c-star-algebras
asked Jul 31 at 15:53
user353840
1097
1097
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
2
down vote
accepted
For the finite-dimensional case:
You have $mathcal A=bigoplus_k=1^m M_n_k(mathbb C)subset M_n(mathbb C)$, where $n=n_1+cdots+n_m$.
Any linear functional on $mathcal A$ is of the form $f(X)=sum_k,jbeta_k,jX_k,j$. This is precisely $$f(X)=operatornameTr(BX),$$ where $B=[beta_k,j]$. We may assume that $Bin mathcal A$.
If $f$ is a state, it follows that $Bgeq0$, $operatornameTr(B)=1$.
Within this picture, one can show that the pure states (the extreme points of the state space) are given by the rank-one projections. If $n_kgeq 2$ for at least one index, then there are uncountably many of them.
When $mathcal A$ is abelian, $n_1=cdots=n_m=1$, and there are finitely many rank-one projections. Namely, $mathcal A=mathbb C^n$, and the pure states are given by the canonical basis (so, for instance, $mathbb C^2$ has the pure state $(1,0)$ and $(0,1)$).
If the state space is a simplex (finitely many pure states), then $mathcal A$ is (finite-dimensional and) abelian. First because the pure states separate points (because the states do); if $mathcal A$ is infinite-dimensional, there exists an infinite linearly independent set; and so one needs enough pure states to distinguish infinitely many distinct linear combinations. Once we know that $mathcal A$ is finite-dimensional, by the bullets above the only way to have finitely many pure states is to have $n_1=cdots=n_m=1$, so $mathcal A$ is abelian.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
accepted
For the finite-dimensional case:
You have $mathcal A=bigoplus_k=1^m M_n_k(mathbb C)subset M_n(mathbb C)$, where $n=n_1+cdots+n_m$.
Any linear functional on $mathcal A$ is of the form $f(X)=sum_k,jbeta_k,jX_k,j$. This is precisely $$f(X)=operatornameTr(BX),$$ where $B=[beta_k,j]$. We may assume that $Bin mathcal A$.
If $f$ is a state, it follows that $Bgeq0$, $operatornameTr(B)=1$.
Within this picture, one can show that the pure states (the extreme points of the state space) are given by the rank-one projections. If $n_kgeq 2$ for at least one index, then there are uncountably many of them.
When $mathcal A$ is abelian, $n_1=cdots=n_m=1$, and there are finitely many rank-one projections. Namely, $mathcal A=mathbb C^n$, and the pure states are given by the canonical basis (so, for instance, $mathbb C^2$ has the pure state $(1,0)$ and $(0,1)$).
If the state space is a simplex (finitely many pure states), then $mathcal A$ is (finite-dimensional and) abelian. First because the pure states separate points (because the states do); if $mathcal A$ is infinite-dimensional, there exists an infinite linearly independent set; and so one needs enough pure states to distinguish infinitely many distinct linear combinations. Once we know that $mathcal A$ is finite-dimensional, by the bullets above the only way to have finitely many pure states is to have $n_1=cdots=n_m=1$, so $mathcal A$ is abelian.
add a comment |Â
up vote
2
down vote
accepted
For the finite-dimensional case:
You have $mathcal A=bigoplus_k=1^m M_n_k(mathbb C)subset M_n(mathbb C)$, where $n=n_1+cdots+n_m$.
Any linear functional on $mathcal A$ is of the form $f(X)=sum_k,jbeta_k,jX_k,j$. This is precisely $$f(X)=operatornameTr(BX),$$ where $B=[beta_k,j]$. We may assume that $Bin mathcal A$.
If $f$ is a state, it follows that $Bgeq0$, $operatornameTr(B)=1$.
Within this picture, one can show that the pure states (the extreme points of the state space) are given by the rank-one projections. If $n_kgeq 2$ for at least one index, then there are uncountably many of them.
When $mathcal A$ is abelian, $n_1=cdots=n_m=1$, and there are finitely many rank-one projections. Namely, $mathcal A=mathbb C^n$, and the pure states are given by the canonical basis (so, for instance, $mathbb C^2$ has the pure state $(1,0)$ and $(0,1)$).
If the state space is a simplex (finitely many pure states), then $mathcal A$ is (finite-dimensional and) abelian. First because the pure states separate points (because the states do); if $mathcal A$ is infinite-dimensional, there exists an infinite linearly independent set; and so one needs enough pure states to distinguish infinitely many distinct linear combinations. Once we know that $mathcal A$ is finite-dimensional, by the bullets above the only way to have finitely many pure states is to have $n_1=cdots=n_m=1$, so $mathcal A$ is abelian.
add a comment |Â
up vote
2
down vote
accepted
up vote
2
down vote
accepted
For the finite-dimensional case:
You have $mathcal A=bigoplus_k=1^m M_n_k(mathbb C)subset M_n(mathbb C)$, where $n=n_1+cdots+n_m$.
Any linear functional on $mathcal A$ is of the form $f(X)=sum_k,jbeta_k,jX_k,j$. This is precisely $$f(X)=operatornameTr(BX),$$ where $B=[beta_k,j]$. We may assume that $Bin mathcal A$.
If $f$ is a state, it follows that $Bgeq0$, $operatornameTr(B)=1$.
Within this picture, one can show that the pure states (the extreme points of the state space) are given by the rank-one projections. If $n_kgeq 2$ for at least one index, then there are uncountably many of them.
When $mathcal A$ is abelian, $n_1=cdots=n_m=1$, and there are finitely many rank-one projections. Namely, $mathcal A=mathbb C^n$, and the pure states are given by the canonical basis (so, for instance, $mathbb C^2$ has the pure state $(1,0)$ and $(0,1)$).
If the state space is a simplex (finitely many pure states), then $mathcal A$ is (finite-dimensional and) abelian. First because the pure states separate points (because the states do); if $mathcal A$ is infinite-dimensional, there exists an infinite linearly independent set; and so one needs enough pure states to distinguish infinitely many distinct linear combinations. Once we know that $mathcal A$ is finite-dimensional, by the bullets above the only way to have finitely many pure states is to have $n_1=cdots=n_m=1$, so $mathcal A$ is abelian.
For the finite-dimensional case:
You have $mathcal A=bigoplus_k=1^m M_n_k(mathbb C)subset M_n(mathbb C)$, where $n=n_1+cdots+n_m$.
Any linear functional on $mathcal A$ is of the form $f(X)=sum_k,jbeta_k,jX_k,j$. This is precisely $$f(X)=operatornameTr(BX),$$ where $B=[beta_k,j]$. We may assume that $Bin mathcal A$.
If $f$ is a state, it follows that $Bgeq0$, $operatornameTr(B)=1$.
Within this picture, one can show that the pure states (the extreme points of the state space) are given by the rank-one projections. If $n_kgeq 2$ for at least one index, then there are uncountably many of them.
When $mathcal A$ is abelian, $n_1=cdots=n_m=1$, and there are finitely many rank-one projections. Namely, $mathcal A=mathbb C^n$, and the pure states are given by the canonical basis (so, for instance, $mathbb C^2$ has the pure state $(1,0)$ and $(0,1)$).
If the state space is a simplex (finitely many pure states), then $mathcal A$ is (finite-dimensional and) abelian. First because the pure states separate points (because the states do); if $mathcal A$ is infinite-dimensional, there exists an infinite linearly independent set; and so one needs enough pure states to distinguish infinitely many distinct linear combinations. Once we know that $mathcal A$ is finite-dimensional, by the bullets above the only way to have finitely many pure states is to have $n_1=cdots=n_m=1$, so $mathcal A$ is abelian.
answered Jul 31 at 19:31


Martin Argerami
115k1071164
115k1071164
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2868202%2fstate-space-of-finite-dimensional-abelian-c-algebra-is-a-simplex%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password