Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $\phi_n: U(\subset\mathbb R^2\sim\mathbb C)\to \mathbb R$, be sequence of continuous functions.

Then for any compact set $K\subset U$, what are the necessary and sufficient condition on $\phi_ns$ or on domain of $\phi_ns$ to hold: $$\sup_{z\in K}[\limsup_n\phi_n(z)]= \limsup_n[\sup_{z\in K}\phi_n(z)] $$

share|cite|improve this question
up vote 0 down vote accepted

I doubt that you'll find a nice answer; the answer can't involve global properties of the functions since the equality depends only on the function values near the suprema and the functions are free to do whatever they want away from the suprema whether the equality holds or not.

The equality holds if and only if there is a point $y\in K$ such that for all $\epsilon\gt0$ every neighbourhood of $y$ contains a point $x$ such that $\limsup_n\phi_n(x)$ is within $\epsilon$ of $a:=\limsup_n[\sup_{z\in K}\phi_n(z)]$.

For the "only if" direction, assume that the equality holds. Then for every $k\in\mathbb N$ there is a point $x_k\in K$ such that $\limsup_n\phi_n(x_k)$ is within $1/k$ of $a$. Since $K$ is compact, the sequence $x_k$ has an accumulation point $y$, and every neighbourhood of $y\in K$ contains points $x_k$ with $\limsup_n\phi_n(x_k)$ arbitrarily close to $a$.

For the "if" direction, if there is such a point $y$, then there are points $x$ with $\limsup_n\phi_n(x)$ arbitrarily close to $a$, so $\sup_{z\in K}[\limsup_n\phi_n(z)]\ge \limsup_n[\sup_{z\in K}\phi_n(z)]$. Since also $\sup_{z\in K}[\limsup_n\phi_n(z)]\le \limsup_n[\sup_{z\in K}\phi_n(z)]$ (independent of any conditions), it follows that $\sup_{z\in K}[\limsup_n\phi_n(z)]=\limsup_n[\sup_{z\in K}\phi_n(z)]$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.