Trees in renorming theory

Details Trees in renorming theory Trees in renorming theory

1995-09-27

arxiv.org/abs/math/9509217v1

Mathematics

Functional Analysis

Scientific paper

Trees are very agreeable objects to work with, offering a diversity of behaviour within a structure that is sufficiently simple to admit precise analysis. Thus we are able to offer fairly satisfactory necessary and sufficient conditions on a tree $\Upsilon $ for the existence of equivalent LUR or strictly convex norms on $\C_0(\Upsilon )$ and for norms with the Kadec Property. In particular, we show that for a {\sl finitely branching} tree $\Upsilon $ the space $\C_0(\Upsilon )$ admits a Kadec renorming. Since some finitely branching trees fail the condition for strictly convex renormability, we obtain an example of a Banach space that is Kadec renormable but not strictly convexifiable. Consideration of specially tailored examples enables us to answer the ``three-space problem'' for strictly convex renorming: there exists a Banach space $X$ with a closed subspace $Y$ such that both $Y$ and the quotient $X/Y$ admit strictly convex norms, while $X$ does not. We also solve a problem about the property of mid-point locally uniform convexity (MLUR), showing that this does not imply LUR renormability.

Affiliated with

Also associated with

No associations

Rating

Trees in renorming theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Trees in renorming theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trees in renorming theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167595