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 R : X ⇉ Y {\displaystyle {\mathcal {R}}:X\rightrightarrows Y} is a set-valued function and S {\displaystyle S} is a non-empty subset of a topological vector space X {\displaystyle X} :
the affine span of S {\displaystyle S} is denoted by aff S {\displaystyle \operatorname {aff} S} and the linear span is denoted by span S . {\displaystyle \operatorname {span} S.}
S i := aint X S {\displaystyle S^{i}:=\operatorname {aint} _{X}S} denotes the algebraic interior of S {\displaystyle S} in X . {\displaystyle X.}
i S := aint aff ( S − S ) S {\displaystyle {}^{i}S:=\operatorname {aint} _{\operatorname {aff} (S-S)}S} denotes the relative algebraic interior of S {\displaystyle S} (i.e. the algebraic interior of S {\displaystyle S} in aff ( S − S ) {\displaystyle \operatorname {aff} (S-S)} ).
i b S :=
i S {\displaystyle {}^{ib}S:={}^{i}S} if span ( S − s 0 ) {\displaystyle \operatorname {span} \left(S-s_{0}\right)} is barreled for some/every s 0 ∈ S {\displaystyle s_{0}\in S} while
i b S := ∅ {\displaystyle {}^{ib}S:=\varnothing } otherwise. If S {\displaystyle S} is convex then it can be shown that for any x ∈ X , {\displaystyle x\in X,} x ∈
i b S {\displaystyle x\in {}^{ib}S} if and only if the cone generated by S − x {\displaystyle S-x} is a barreled linear subspace of X {\displaystyle X} or equivalently, if and only if ∪ n ∈ N n ( S − x ) {\displaystyle \cup _{n\in \mathbb {N} }n(S-x)} is a barreled linear subspace of X {\displaystyle X}
The domain of R {\displaystyle {\mathcal {R}}} is Dom R := { x ∈ X : R ( x ) ≠ ∅ } . {\displaystyle \operatorname {Dom} {\mathcal {R}}:=\{x\in X:{\mathcal {R}}(x)\neq \varnothing \}.}
The image of R {\displaystyle {\mathcal {R}}} is Im R := ∪ x ∈ X R ( x ) . {\displaystyle \operatorname {Im} {\mathcal {R}}:=\cup _{x\in X}{\mathcal {R}}(x).} For any subset A ⊆ X , {\displaystyle A\subseteq X,} R ( A ) := ∪ x ∈ A R ( x ) . {\displaystyle {\mathcal {R}}(A):=\cup _{x\in A}{\mathcal {R}}(x).}
The graph of R {\displaystyle {\mathcal {R}}} is gr R := { ( x , y ) ∈ X × Y : y ∈ R ( x ) } . {\displaystyle \operatorname {gr} {\mathcal {R}}:=\{(x,y)\in X\times Y:y\in {\mathcal {R}}(x)\}.}
… excerpt ends here. Continue reading the full article.
