Skip Navigation


Bulletin of the London Mathematical Society Advance Access originally published online on December 15, 2006
Bulletin of the London Mathematical Society 2007 39(1):112-120; doi:10.1112/blms/bdl022
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
39/1/112    most recent
bdl022v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Smith, R. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2006 London Mathematical Society

Trees, Gâteaux norms and a problem of Haydon

Richard J. Smith

Queens’ College
Cambridge CB3 9ET
United Kingdom
rjs209{at}cam.ac.uk

Received 27 July 2005. Revision received 22 November 2005.

We give a sufficient condition for the existence of an equivalent Gâteaux smooth norm on C0({Upsilon}), where {Upsilon} is a tree. Using this, we prove that if C0({Upsilon}) admits an equivalent strictly convex norm, then it admits an equivalent Gâteaux smooth norm. This resolves an open problem from Haydon's study of trees in renorming theory.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.