20.07.2013 Views

Estimation optimale du gradient du semi-groupe de la chaleur sur le ...

Estimation optimale du gradient du semi-groupe de la chaleur sur le ...

Estimation optimale du gradient du semi-groupe de la chaleur sur le ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Journal of Functional Analysis 236 (2006) 630–633<br />

www.elsevier.com/locate/jfa<br />

AnewprimeC ∗ -algebra that is not primitive<br />

M.J. Crabb<br />

Department of Mathematics, University of G<strong>la</strong>sgow, G<strong>la</strong>sgow G12 8QW, Scot<strong>la</strong>nd, UK<br />

Received 9 January 2006; accepted 28 February 2006<br />

Communicated by G. Pisier<br />

Abstract<br />

An explicit prime non-primitive C∗-algebra is constructed.<br />

© 2006 Elsevier Inc. All rights reserved.<br />

Keywords: C ∗ -algebra; Primitivity<br />

In [7], N. Weaver gives an examp<strong>le</strong> of a C ∗ -algebra that is prime but not primitive, solving a<br />

long-standing prob<strong>le</strong>m. Here we give a simp<strong>le</strong>r examp<strong>le</strong>.<br />

An algebra is said to be prime if the pro<strong>du</strong>ct of any two nonzero two-si<strong>de</strong>d i<strong>de</strong>als is nonzero.<br />

An algebra is primitive if it has a faithful irre<strong>du</strong>cib<strong>le</strong> representation. In the case of a C ∗ -algebra<br />

this representation can be assumed to be a ∗-representation on a Hilbert space [6, Corol<strong>la</strong>ry<br />

2.9.6]. A primitive algebra is always prime. J. Dixmier [5] proved that a separab<strong>le</strong> prime<br />

C ∗ -algebra is primitive.<br />

Throughout, X is an uncountab<strong>le</strong> set and G the free group on X with i<strong>de</strong>ntity e. Forw in G<br />

in re<strong>du</strong>ced form, <strong>de</strong>fine w! to be the set of all prefixes of w, including e and w. For examp<strong>le</strong>,<br />

(xyz)! ={e,x,xy,xyz}. Denote by P the set of all e<strong>le</strong>ments of G that in re<strong>du</strong>ced form have<br />

no negative exponents, and put Q = P −1 , the set of e<strong>le</strong>ments with no positive exponents. Thus<br />

P ∩ Q ={e}. Define L by<br />

L := {p!∪q!: p ∈ P, q ∈ Q}.<br />

For a = x1x2 ···xn in P , with xi ∈ X, we say that a has <strong>de</strong>gree n and a −1 has <strong>de</strong>gree −n; we<br />

<strong>de</strong>fine the content of a, con(a) := {x1,x2,...,xn}=con(a −1 ). We also <strong>de</strong>fine the <strong>de</strong>gree of e to<br />

E-mail address: mjc@maths.g<strong>la</strong>.ac.uk.<br />

0022-1236/$ – see front matter © 2006 Elsevier Inc. All rights reserved.<br />

doi:10.1016/j.jfa.2006.02.018

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!