Baire Category Theorem

[[concept]]

Baire Category Theorem

Let be a {as||complete} metric space and let be a {as||collection of closed subsets} of such that Then {ha||at least one} of the {ha||contain an open ball} {==ha||} (ie, {ha||at least one==} has {ha||an interior point}).

^statement

NOTE

A set that does not contain an interior point is called nowhere dense. Sometimes when we apply this theorem, we do not need to be closed. Then the result is that their closures must contain and open ball. ie, we cannot have all be all nowhere dense.

NOTE

We can use this theorem to prove that there exists a continuous function that is nowhere differentiable

Proof (by contradiction)

Suppose BWOC that there is some collection of closed subsets of such that and all are nowhere dense.

that does not converge

we’ll show that there is a sequence in

Since contains an open ball but does not, we have . Thus there is some . Since is closed but is open, this implies that s.t. .

Now, means there exists some . And since is closed, there exists such that

Now, suppose there we have found such points. Then for each we have with such that

Since , there exists some such that

Then there exists such that

Thus, by indiction, we have found a sequence of points and such that for all ,

This sequence is Cauchy because for all , we have

d(p_{k+1}, p_{k+\ell}) &\leq d(p_{k}, p_{k+1}) + d(p_{k+1}, p_{k+2}) + \dots + d(p_{k+\ell-1}, p_{k+\ell}) \\ &< \frac{\epsilon_{k}}{3} + \frac{\epsilon_{k+1}}{3} + \dots+\frac{\epsilon_{k+\ell-1}}{3} \\ &< \frac{\epsilon_{1}}{3^k}+\frac{\epsilon_{1}}{3^{k+1}}+\dots+\frac{\epsilon_{1}}{3^{k+\ell}} \\ &< \epsilon_{1} \sum_{n=k}^\infty \frac{1}{3^k} \\ &= \frac{\epsilon_{1}}{3^k}\left( \frac{1}{1-\frac{1}{3}} \right) \\ &= \frac{\epsilon_{1}}{2} 3^{-k+1} \end{align}$$ Since $M$ is complete, there exists some $p \in M$ such that $p_{k} \to p$ as $k \to \infty$. Now, for all $k \in \mathbb{N}$, we have $$\begin{align} d(p_{k+1}, p_{k+\ell+1}) &< \epsilon_{k+1} \left[ \frac{1}{3} + \frac{1}{3^2} + \dots+\frac{1}{3^\ell} \right] \\ &< \epsilon_{k+1} \sum_{n=1}^\infty 3^{-n} \\ &= \frac{\epsilon_{k+1}}{2} \\ \implies \lim_{ \ell \to \infty } d(p_{k+1}, p_{l+\ell+1}) &=d(p_{k+1}, p) \\ &\leq \frac{\epsilon_{k+1}}{2} \\ &< \frac{\epsilon_{k}}{6} \\ \end{align}$$ So as $\ell\to \infty$, we have $$d(p_{k+1}, p)$$ $$\implies d(p_{k}, p) \leq d(p_{k}, p_{k+1}) + d(p_{k+1}, p) \leq \frac{1}{3}\epsilon + \frac{1}{6}\epsilon_{k} < \epsilon_{k}$$ ie, $p \in B(p_{k}, \epsilon_{k}) = B_{k}$ *for all* $k$. And each of these balls has $B_{k} \cap C_{k} = \varnothing$. Thus $p$ is not in any of the $C_{k}$ ie $p \not\in\bigcup_{k}C_{k} = M$ $$\implies \impliedby$$ $$\tag*{$\blacksquare$}$$

References

functional

Mentions

Mentions

TABLE file.mday as "Last Modified"
FROM [[]]
 
FLATTEN choice(contains(artist, this.file.link), 1, "") + choice(contains(author, this.file.link), 1, "") + choice(contains(director, this.file.link), 1, "") + choice(contains(source, this.file.link), 1, "") as direct_source
 
WHERE !direct_source
SORT file.mday ASC
SORT file.name ASC
const { dateTime } = await cJS()
 
return function View() {
	const file = dc.useCurrentFile();
	return <p class="dv-modified">Created {dateTime.getCreated(file)}     ֍     Last Modified {dateTime.getLastMod(file)}</p>
}