In mathematics, uniformly convex spaces (or uniformly rotund spaces) are common examples of reflexive Banach spaces. The concept of uniform convexity was first introduced by James A. Clarkson in 1936. A uniformly convex space is a normed vector space such that, for every there is some such that for any two vectors with and the condition implies that: Intuitively, the center of a line segment inside the unit ball must lie deep inside the unit ball unless the segment is short. The unit sphere can be replaced with the closed unit ball in the definition. Namely, a normed vector space is uniformly convex if and only if for every there is some so that, for any two vectors and in the closed unit ball (i.e. and ) with , one has (note that, given , the corresponding value of could be smaller than the one provided by the original weaker definition). The "if" part is trivial. Conversely, assume now that is uniformly convex and that are as in the statement, for some fixed . Let be the value of corresponding to in the definition of uniform convexity. We will show that , with . If then and the claim is proved. A similar argument applies for the case , so we can assume that . In this case, since , both vectors are nonzero, so we can let and . We have and similarly , so and belong to the unit sphere and have distance . Hence, by our choice of , we have . It follows that and the claim is proved. The Milman–Pettis theorem states that every uniformly convex Banach space is reflexive, while the converse is not true. Every uniformly convex Banach space is a Radon-Riesz space, that is, if is a sequence in a uniformly convex Banach space which converges weakly to and satisfies then converges strongly to , that is, . A Banach space is uniformly convex if and only if its dual is uniformly smooth. Every uniformly convex space is strictly convex. Intuitively, the strict convexity means a stronger triangle inequality whenever are linearly independent, while the uniform convexity requires this inequality to be true uniformly.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.