Uniformly convex space

From testwiki
Revision as of 09:53, 10 May 2024 by 194.72.158.170 (talk) (Clarkson's inequalities are more well known and precede by 20 years)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description 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.

Definition

A uniformly convex space is a normed vector space such that, for every 0<ε2 there is some δ>0 such that for any two vectors with x=1 and y=1, the condition

xyε

implies that:

x+y21δ.

Intuitively, the center of a line segment inside the unit ball must lie deep inside the unit ball unless the segment is short.

Properties

  • The unit sphere can be replaced with the closed unit ball in the definition. Namely, a normed vector space X is uniformly convex if and only if for every 0<ε2 there is some δ>0 so that, for any two vectors x and y in the closed unit ball (i.e. x1 and y1) with xyε, one has x+y21δ (note that, given ε, the corresponding value of δ could be smaller than the one provided by the original weaker definition).

Template:Collapsed top The "if" part is trivial. Conversely, assume now that X is uniformly convex and that x,y are as in the statement, for some fixed 0<ε2. Let δ11 be the value of δ corresponding to ε3 in the definition of uniform convexity. We will show that x+y21δ, with δ=min{ε6,δ13}.

If x12δ then x+y212(12δ)+12=1δ and the claim is proved. A similar argument applies for the case y12δ, so we can assume that 12δ<x,y1. In this case, since δ13, both vectors are nonzero, so we can let x=xx and y=yy. We have xx=1x2δ and similarly yy2δ, so x and y belong to the unit sphere and have distance xyxy4δε4ε6=ε3. Hence, by our choice of δ1, we have x+y21δ1. It follows that x+y2x+y2+xx+yy21δ1+2δ1δ131δ and the claim is proved. Template:Collapsed bottom

  • 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 {fn}n=1 is a sequence in a uniformly convex Banach space that converges weakly to f and satisfies fnf, then fn converges strongly to f, that is, fnf0.
  • A Banach space X is uniformly convex if and only if its dual X* is uniformly smooth.
  • Every uniformly convex space is strictly convex. Intuitively, the strict convexity means a stronger triangle inequality x+y<x+y whenever x,y are linearly independent, while the uniform convexity requires this inequality to be true uniformly.

Examples

See also

References

Citations

Template:Reflist

General references

Template:Functional analysis