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 ℛ:X⇉Y 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 aff⁡S and the linear span is denoted by span⁡S.
  • Si:=aintXS denotes the algebraic interior of S in X.
  • iS:=aintaff⁡(S−S)S denotes the relative algebraic interior of S (i.e. the algebraic interior of S in aff⁡(S−S)).
  • ibS:=iS if span⁡(S−s0) is barreled for some/every s0∈S while ibS:=∅ otherwise.
    • If S is convex then it can be shown that for any x∈X, x∈ibS if and only if the cone generated by S−x is a barreled linear subspace of X or equivalently, if and only if ∪n∈ℕn(S−x) is a barreled linear subspace of X
  • The domain of ℛ is Dom⁡ℛ:={x∈X:ℛ(x)≠∅}.
  • The image of ℛ is Im⁡ℛ:=∪x∈Xℛ(x). For any subset A⊆X, ℛ(A):=∪x∈Aℛ(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,x1∈X and all r∈[0,1], rℛ(x0)+(1−r)ℛ(x1)⊆ℛ(rx0+(1−r)x1).
  • The inverse of ℛ is the set-valued function ℛ−1:Y⇉X defined by ℛ−1(y):={x∈X:y∈ℛ(x)}. For any subset B⊆Y, ℛ−1(B):=∪y∈Bℛ−1(y).
    • If f:X→Y is a function, then its inverse is the set-valued function f−1:Y⇉X obtained from canonically identifying f with the set-valued function f:X⇉Y defined by x↦{f(x)}.
  • intTS is the topological interior of S with respect to T, where S⊆T.
  • rint⁡S:=intaff⁡SS is the interior of S with respect to aff⁡S.

Statement

Theorem[1] (Ursescu) — Let X be a complete semi-metrizable locally convex topological vector space and ℛ:X⇉Y be a closed convex multifunction with non-empty domain. Assume that span⁡(Im⁡ℛ−y) is a barrelled space for some/every y∈Im⁡ℛ. Assume that y0∈i(Im⁡ℛ) and let x0∈ℛ−1(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, y0∈intaff⁡(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:X→Y 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:X→Y be a bijective linear map. Then T is continuous if and only if T−1:Y→X 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:X→Y 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 ℛ:X⇉Y 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=1∞risi where all si∈S and ∑i=1∞ri=1 is a series of non-negative numbers. If ∑i=1∞risi 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=int⁡C.
  2. If C is ideally convex then Ci=int⁡C=int⁡(cl⁡C)=(cl⁡C)i.

Simons' theorem

Simons' theorem[2] — Let X and Y be first countable with X locally convex. Suppose that ℛ:X⇉Y 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⁡(Im⁡ℛ−y) is barreled for some/every y∈Im⁡ℛ. Assume that y0∈i(Im⁡ℛ) and let x0∈ℛ−1(y0). Then for every neighborhood U of x0 in X, y0 belongs to the relative interior of ℛ(U) in aff⁡(Im⁡ℛ) (i.e. y0∈intaff⁡(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 ℛ:X⇉Y 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={x∈X:‖x‖≤1}). Then the following are equivalent:

  1. y0 belongs to the algebraic interior of Im⁡ℛ.
  2. y0∈int⁡ℛ(x0+CX).
  3. There exists B>0 such that for all 0≤r≤1, y0+BrCY⊆ℛ(x0+rCX).
  4. There exist A>0 and B>0 such that for all x∈x0+ACX and all y∈y0+ACY, d(x,ℛ−1(y))≤B⋅d(y,ℛ(x)).
  5. There exists B>0 such that for all x∈X and all y∈y0+BCY, d(x,ℛ−1(y))≤1+‖x−x0‖B−‖y−y0‖⋅d(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

Template:Convex analysis and variational analysis