Content deleted Content added
Update |
Paradoctor (talk | contribs) m →Canonical ordering: dab |
||
(13 intermediate revisions by 7 users not shown) | |||
Line 1:
{{Short description|Concept in functional analysis}}
In [[mathematics]], more specifically in [[functional analysis]], a '''positive linear operator''' from an [[ordered vector space|preordered vector space]] (''X'', ≤) into a preordered vector space (''Y'', ≤) is a [[linear operator]] ''f'' on ''X'' into ''Y'' such that for all [[positive element (ordered group)|positive element]]s ''x'' of ''X'', that is ''x''≥0, it holds that ''f''(''x'')≥0. ▼
{{Multiple issues|{{refimprove|date=June 2020}}{{lead rewrite|date=June 2020|reason=The lead should be a summary of the body of the article.}}}}
In other words, a positive linear operator maps the positive cone of the ___domain into the positive cone of the codomain. ▼
▲In [[mathematics]], more specifically in [[functional analysis]], a '''positive linear operator''' from an [[
▲In other words, a positive linear operator maps the positive cone of the [[Domain of a function|___domain]] into the positive cone of the [[codomain]].
Every [[positive linear functional]] is a type of positive linear operator.
The significance of positive linear operators lies in results such as [[Riesz–Markov–Kakutani representation theorem]].
==
A [[linear function]] <math>f</math> on a [[Ordered vector space|preordered vector space]] is called '''positive''' if it satisfies either of the following equivalent conditions:
# <math>x \geq 0</math> implies <math>f(x) \geq 0.</math>
# if <math>x \leq y</math> then <math>f(x) \leq f(y).</math>{{sfn|Narici|Beckenstein|2011|pp=139-153}}
The set of all positive linear forms on a vector space with positive cone <math>C,</math> called the '''[[Dual cone and polar cone|dual cone]]''' and denoted by <math>C^*,</math> is a cone equal to the [[Polar set|polar]] of <math>-C.</math>
The preorder induced by the dual cone on the space of linear functionals on <math>X</math> is called the '''{{visible anchor|dual preorder}}'''.{{sfn|Narici|Beckenstein|2011|pp=139-153}}
The '''[[Order dual (functional analysis)|order dual]]''' of an ordered vector space <math>X</math> is the set, denoted by <math>X^+,</math> defined by <math>X^+ := C^* - C^*.</math>
==Canonical ordering==
The set
If
If <math>(X, \leq)</math> and <math>(Y, \leq)</math> are [[ordered topological vector space]]s and if <math>\mathcal{G}</math> is a family of bounded subsets of <math>X</math> whose union covers <math>X</math> then the [[positive cone of an ordered vector space|positive cone]] <math>\mathcal{H}</math> in <math>L(X; Y)</math>, which is the space of all continuous linear maps from <math>X</math> into <math>Y,</math> is closed in <math>L(X; Y)</math> when <math>L(X; Y)</math> is endowed with the [[Topology of uniform convergence|<math>\mathcal{G}</math>-topology]].{{sfn | Schaefer | Wolff | 1999 | pp=225–229}}
For <math>\mathcal{H}</math> to be a proper cone in <math>L(X; Y)</math> it is sufficient that the positive cone of
If
Thus, if the positive cone of
▲Throughout let (''X'', ≤) and (''Y'', ≤) be preordered vector spaces on ''X'' and let <math>\mathcal{L}(X; Y)</math> be the space of all linear maps from ''X'' into ''Y''.
▲The set ''H'' of all positive linear operators in <math>\mathcal{L}(X; Y)</math> is a cone in <math>\mathcal{L}(X; Y)</math> that defines a preorder on <math>\mathcal{L}(X; Y)</math>.
▲If ''M'' is a vector subspace of <math>\mathcal{L}(X; Y)</math> and if ''H'' ∩ ''M'' is a proper cone then this proper cone defines a '''canonical''' partial order on ''M'' making ''M'' into a partially ordered vector space.{{sfn | Schaefer | 1999 | pp=225-229}}
▲For <math>\mathcal{H}</math> to be a proper cone in <math>L(X; Y)</math> it is sufficient that the positive cone of ''X'' be total in ''X'' (i.e. the span of the positive cone of ''X'' be dense in ''X'').
▲If ''Y'' is a locally convex space of dimension greater than 0 then this condition is also necessary.{{sfn | Schaefer | 1999 | pp=225-229}}
▲Thus, if the positive cone of ''X'' is total in ''X'' and if ''Y'' is a locally convex space, then the canonical ordering of <math>L(X; Y)</math> defined by <math>\mathcal{H}</math> is a regular order.{{sfn | Schaefer | 1999 | pp=225-229}}
'''Proposition''': Suppose <math>X</math> is a [[Barreled space|barreled]] [[ordered topological vector space]] (TVS) with positive cone <math>C</math> that satisfies <math>X = C - C</math> and <math>Y</math> is a [[semi-reflexive]] ordered TVS with a positive cone <math>D</math> that is a [[Normal cone (functional analysis)|normal cone]]. Give <math>L(X; Y)</math> its canonical order and let <math>\mathcal{U}</math> be a subset of <math>L(X; Y)</math> that is directed upward and either majorized (that is, bounded above by some element of <math>L(X; Y)</math>) or simply bounded. Then <math>u = \sup \mathcal{U}</math> exists and the section filter <math>\mathcal{F}(\mathcal{U})</math> converges to <math>u</math> uniformly on every precompact subset of <math>X.</math>{{sfn | Schaefer | Wolff | 1999 | pp=225–229}}
▲== Properties ==
▲== See also ==
▲* [[Cone-saturated]]
▲* [[Positive linear functional]]
▲* [[Vector lattice]]
{{reflist|group=note}}
▲== References ==
{{reflist}}
* {{Narici Beckenstein Topological Vector Spaces|edition=2}} <!-- {{sfn | Narici | Beckenstein | 2011 | p=}} -->
* {{
{{Functional analysis}}
{{Ordered topological vector spaces}}
<!--- Categories --->
[[Category:Functional analysis]]
[[Category:Order theory]]
|