Skip Navigation


Journal of the London Mathematical Society Advance Access originally published online on November 12, 2007
Journal of the London Mathematical Society 2007 76(3):633-646; doi:10.1112/jlms/jdm085
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
76/3/633    most recent
jdm085v1
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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
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?

© 2007 London Mathematical Society

Trees, linear orders and Gâteaux smooth norms

Richard J. Smith

Queens’ College
Cambridge
CB3 9ET
United Kingdom

We introduce a linearly ordered set Z and use it to prove a necessity condition for the existence of a Gâteaux smooth norm on C0({Upsilon}), where {Upsilon} is a tree. This criterion is directly analogous to the corresponding equivalent condition for Fréchet smooth norms. In addition, we prove that if C0({Upsilon}) admits a Gâteaux smooth lattice norm then it also admits a lattice norm with strictly convex dual norm.

2000 Mathematics Subject Classification 46B03 (primary), 46B26 (secondary).

Received August 22, 2006; revised May 23, 2007; published online November 12, 2007.


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.