Papers
Topics
Authors
Recent
Search
2000 character limit reached

Polyhedrality in Pieces

Published 1 Feb 2013 in math.FA | (1302.0160v1)

Abstract: The aim of this paper is to present two tools, Theorems 4 and 7, that make the task of finding equivalent polyhedral norms on certain Banach spaces easier and more transparent. The hypotheses of both tools are based on countable decompositions, either of the unit sphere S_X or of certain subsets of the dual ball of a given Banach space X. The sufficient conditions of Theorem 4 are shown to be necessary in the separable case. Using Theorem 7, we can unify two known results regarding the polyhedral renorming of certain C(K) spaces, and spaces having an (uncountable) unconditional basis. New examples of spaces having equivalent polyhedral norms are given in the final section.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.