Ursescu theorem

From HandWiki
Short description: Generalization of closed graph, open mapping, and uniform boundedness theorem

In mathematics, particularly in functional analysis and convex analysis, the Ursescu theorem is a theorem that generalizes the closed graph theorem, the open mapping theorem, and the uniform boundedness principle.

Ursescu Theorem

The following notation and notions are used, where :XY is a set-valued function and S is a non-empty subset of a topological vector space X:

  • the affine span of S is denoted by affS and the linear span is denoted by spanS.
  • Si:=aintXS denotes the algebraic interior of S in X.
  • iS:=aintaff(SS)S denotes the relative algebraic interior of S (i.e. the algebraic interior of S in aff(SS)).
  • ibS:=iS if span(Ss0) is barreled for some/every s0S while ibS:= otherwise.
    • If S is convex then it can be shown that for any xX, xibS if and only if the cone generated by Sx is a barreled linear subspace of X or equivalently, if and only if nn(Sx) is a barreled linear subspace of X
  • The domain of is Dom:={xX:(x)}.
  • The image of is Im:=xX(x). For any subset AX, (A):=xA(x).
  • The graph of is gr:={(x,y)X×Y:y(x)}.
  • is closed (respectively, convex) if the graph of is closed (resp. convex) in X×Y.
    • Note that is convex if and only if for all x0,x1X and all r[0,1], r(x0)+(1r)(x1)(rx0+(1r)x1).
  • The inverse of is the set-valued function 1:YX defined by 1(y):={xX:y(x)}. For any subset BY, 1(B):=yB1(y).
    • If f:XY is a function, then its inverse is the set-valued function f1:YX obtained from canonically identifying f with the set-valued function f:XY defined by x{f(x)}.
  • intTS is the topological interior of S with respect to T, where ST.
  • rintS:=intaffSS is the interior of S with respect to affS.

Statement

Theorem[1] (Ursescu) — Let X be a complete semi-metrizable locally convex topological vector space and :XY be a closed convex multifunction with non-empty domain. Assume that span(Imy) is a barrelled space for some/every yIm. Assume that y0i(Im) and let x01(y0) (so that y0(x0)). Then for every neighborhood U of x0 in X, y0 belongs to the relative interior of (U) in aff(Im) (that is, y0intaff(Im)(U)). In particular, if ib(Im) then ib(Im)=i(Im)=rint(Im).

Corollaries

Closed graph theorem

Closed graph theorem — Let X and Y be Fréchet spaces and T:XY be a linear map. Then T is continuous if and only if the graph of T is closed in X×Y.

Uniform boundedness principle

Uniform boundedness principle — Let X and Y be Fréchet spaces and T:XY be a bijective linear map. Then T is continuous if and only if T1:YX is continuous. Furthermore, if T is continuous then T is an isomorphism of Fréchet spaces.

Open mapping theorem

Open mapping theorem — Let X and Y be Fréchet spaces and T:XY be a continuous surjective linear map. Then T is an open map.

Additional corollaries

The following notation and notions are used for these corollaries, where :XY is a set-valued function, S is a non-empty subset of a topological vector space X:

  • a convex series with elements of S is a series of the form i=1risi where all siS and i=1ri=1 is a series of non-negative numbers. If i=1risi converges then the series is called convergent while if (si)i=1 is bounded then the series is called bounded and b-convex.
  • S is ideally convex if any convergent b-convex series of elements of S has its sum in S.
  • S is lower ideally convex if there exists a Fréchet space Y such that S is equal to the projection onto X of some ideally convex subset B of X×Y. Every ideally convex set is lower ideally convex.

Corollary — Let X be a barreled first countable space and let C be a subset of X. Then:

  1. If C is lower ideally convex then Ci=intC.
  2. If C is ideally convex then Ci=intC=int(clC)=(clC)i.

Simons' theorem

Simons' theorem[2] — Let X and Y be first countable with X locally convex. Suppose that :XY is a multimap with non-empty domain that satisfies condition (Hwx) or else assume that X is a Fréchet space and that is lower ideally convex. Assume that span(Imy) is barreled for some/every yIm. Assume that y0i(Im) and let x01(y0). Then for every neighborhood U of x0 in X, y0 belongs to the relative interior of (U) in aff(Im) (i.e. y0intaff(Im)(U)). In particular, if ib(Im) then ib(Im)=i(Im)=rint(Im).

Robinson–Ursescu theorem

The implication (1) (2) in the following theorem is known as the Robinson–Ursescu theorem.[3]

Robinson–Ursescu theorem[3] — Let (X,) and (Y,) be normed spaces and :XY be a multimap with non-empty domain. Suppose that Y is a barreled space, the graph of verifies condition condition (Hwx), and that (x0,y0)gr. Let CX (resp. CY) denote the closed unit ball in X (resp. Y) (so CX={xX:x1}). Then the following are equivalent:

  1. y0 belongs to the algebraic interior of Im.
  2. y0int(x0+CX).
  3. There exists B>0 such that for all 0r1, y0+BrCY(x0+rCX).
  4. There exist A>0 and B>0 such that for all xx0+ACX and all yy0+ACY, d(x,1(y))Bd(y,(x)).
  5. There exists B>0 such that for all xX and all yy0+BCY, d(x,1(y))1+xx0Byy0d(y,(x)).

See also

Notes

  1. Zălinescu 2002, p. 23.
  2. Zălinescu 2002, p. 22-23.
  3. 3.0 3.1 Zălinescu 2002, p. 24.

References