Topological analysis (source code)

= Topological analysis

<Topological analysis> groups methods that use properties of <topological spaces> to establish results in <analysis>. <Compactness> turns bounded families with suitable regularity into <convergent subsequences>; <connectedness> underlies intermediate-value arguments; and <fixed point theorems> can prove that a <nonlinear equation> has a solution without producing a closed formula.

For instance, if a <continuous function> maps $[0,1]$ into itself, $g(x)=f(x)-x$ satisfies $g(0)\geq0$ and $g(1)\leq0$. The <intermediate value theorem> therefore gives $g(c)=0$, so $f(c)=c$. The <Brouwer fixed-point theorem> extends this existence mechanism to finite-dimensional convex <compact sets>. Such arguments provide existence, while uniqueness and <numerical convergence> need further information.