# Positive operator is bounded

For a real Banach space $X$ let $A:X\rightarrow X^*$ be a positive operator in the sense that $(Ax)(x)\geq 0$ for all $x\in X$. Show that $A$ is bounded.

I don't know how to do that, maybe it's an application of the closed graph theorem?

-

## 1 Answer

It's indeed an application of closed graph theorem. First, we take $\{x_n\}\subset X$ a sequence which converges to $x$ and such that $Ax_n\to l$, where $l\in X^*$. As the sequence $\{x_n\}$ is bounded, we have $\langle T(x_n),x_n\rangle\to l(x)$. For $y\in X$, we have $$0\leq \langle Tx_n-Ty,x_n-y\rangle=\langle Tx_n,x_n\rangle-\langle Ty,x_n\rangle-\langle Tx_n,y\rangle+\langle Ty,y\rangle.$$ Taking the limit $\lim_{n\to +\infty}$, we get $$0\leq l(x)-\langle T(y),x\rangle-l(y)+\langle T(y),y\rangle,$$ which gives $$l(y-x)\leq \langle T(y),y-x\rangle.$$ Let $y=z+x$. Then $$l(z)\leq \langle Tz,z\rangle+\langle T(x),z\rangle.$$ Replacing $z$ by $az$, where $0<a$ and taking $a\to 0$, we get $l(z)\leq \langle T(x),z\rangle$. Replacing $z$ by $-z$, we get $l=Tx$.

As $X$ and $X^*$ are Banach spaces, we conclude by closed graph theorem.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 24, "mathjax_display_tex": 4, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9749186038970947, "perplexity_flag": "head"}