Applications of connectedness - MathOverflow

Applications of connectedness

2010-05-31T14:38:20Z

In an «advanced calculus» course, I am talking tomorrow about connectedness (in the context of metric spaces, including notably the real line).

What are nice examples of applications of the idea of connectedness?

High wow-ratio examples are specially welcomed... :)

Answer by Xandi Tuni for Applications of connectedness

2010-05-31T15:08:48Z

You can use conectedness of $\mathbb R^n \setminus 0$ for $n\geq 2$ to show that doesn't exist a an $\mathbb R$-division algebra of any odd dimension $n\geq 3$.

Take any odd $n\geq 1$ and a $\mathbb R$-algebra $A$ of dimension $n$. For $a\in A$ denote by $f(a)$ the determinant of the linear map $A\to A$ given by $x\mapsto ax$. This is a continuous function on $A$ and we have $f(1)=1$ and $f(-1)=-1$ because $n$ is odd. If $A$ is a division algebra, then $f(a)$ is nonzero for all $a\neq 0$, what forces $A\setminus 0$ to be disconnected. Hence $n=1$.

Answer by coudy for Applications of connectedness

2010-05-31T15:17:16Z

You cannot diagonalize real symmetric 2x2 matrices in a continuous way.

Let us restrict to the set $Sym^r(R)$ of 2x2 symmetric matrices with two distinct real eigenvalues. Then we have the following result.

Theorem There is no continuous function $f:Sym^r(R) \rightarrow SO_2(R)$ such that for all $M\in Sym^r(R)$, $f(M)Mf(M)^{-1}$ is diagonal.

Proof Let us restrict our attention to the $SO_2$-conjuguacy class $O_A$ of some fixed diagonal matrix $A\in Sym^r$. Let $D$ the set of diagonal matrices. If there were such a f, then the map $(A,D)\rightarrow f(A)D$ would give a homeomorphism between $O_A\times (D\cap SO_2)\rightarrow SO_2$. But $D\cap SO_2$ is not connected (it contains only $id$ and $-id$).

The complex case with hermitian matrices uses simple connectedness (you end up with $S^2\times S^1 \simeq S^3$). And the result holds in all dimension. This may be the occasion to speak about connectedness of matrix groups.

Answer by Mike Skirvin for Applications of connectedness

2010-05-31T15:23:08Z

You can use connectedness to prove that $\mathbb{R}$ is not homeomorphic to $\mathbb{R}^n$ for any n>1 by noting that $\mathbb{R} \backslash 0$ is not connected while $\mathbb{R}^n \backslash 0$ is connected.

The students may not be very impressed by this as it is telling them something they probably already assumed was true. I suppose that if you wanted them to discover cohomology, you could challenge them to find a reason why Euclidean spaces of different dimensions are never homeomorphic (I realize that this probably isn't very reasonable).

Answer by darij grinberg for Applications of connectedness

2010-05-31T15:52:42Z

Lots and lots of matrix inequalities can be proven using the "connectedness exploit", to an extent that I am happy each time I see one that can't be solved this way.

For instance, let us call a matrix $A=\left(a_{i,j}\right)_{1\leq i\leq n,\ 1\leq j\leq n}\in\mathbb R^{n\times n}$ strictly diagonally dominant if every $i\in\left\lbrace 1,2,...,n\right\rbrace$ satisfies $a_{i,i} > \sum\limits_{j\in\left\lbrace 1,2,...,n\right\rbrace ;\ j\neq i} \left|a_{i,j}\right|$. We claim that every strictly diagonally dominant matrix $A$ has determinant $> 0$. In fact, the set of all strictly diagonally dominant matrices (as a subset of $\mathbb R^{n\times n}$) is connected (we can connect every strictly diagonally dominant matrix $A$ to a diagonal matrix with positive entries on the diagonal, just by gradually decreasing all off-diagonal entries), and every strictly diagonally dominant matrix is nonsingular (since every nonzero vector annihilated by such a matrix would lead to a contradiction, because trivial estimates show that whichever of its coordinates has the greatest modulus, there must be another coordinate with yet greater modulus). Qed.

Actually, we can do better: For a diagonally dominant matrix $A$ (not necessarily strictly; that is, we allow $\geq $ instead of $>$), we have

$\det A\geq \prod\limits_{i=1}^n \left(a_{i,i} - \sum\limits_{j=i+1}^n \left|a_{i,j}\right|\right)$,

where $a_{i,j}$ denote the entries of $A$. This is called Ostrowki's theorem and has been discussed elsewhere.

Another example (which used to be a Vojtech Jarnik contest problem in disguise): If $A\in\mathbb R^{n\times n}$ is a positive definite matrix and $X\in\mathbb R^{n\times n}$ is an antisymmetric matrix, then $\det\left(A+X\right)>0$. The proof is by homotopizing $X$ to $0$ while keeping it antisymmetric (all along the way, the determinant stays nonzero because $v^T\left(A+X\right)v>0$ for any $v\neq 0$). There is also an alternative proof using elementary techniques only; however it is much more complicated.

For yet another application of the same tactic, see the proof of Theorem 5.4 in this proof of van der Waerden's permanent conjecture.

Answer by David Carchedi for Applications of connectedness

2010-05-31T16:04:44Z

It might be a bit too sophisticated for an advanced calculus course, but, the proof of the fact that the group generated by an open neighborhood of the identity element of a Lie group is the entire connected component around the identity is cute.

Answer by Byron Schmuland for Applications of connectedness

2010-05-31T19:20:01Z

If $h:[a,b]\to R$ is continuous and one-to-one, then $h$ is monotone.

Proof: The image of the connected set {(s,t): a <= s < t <= b} under the map $h(t)-h(s)$ is a connected subset of $R\setminus{0}$.

Answer by KConrad for Applications of connectedness

2010-05-31T20:27:03Z

Do you want an example where you can give the proof, not just the statement, in the lecture too? Lots of other suggestions are great uses of connectedness, but in one lecture where you first introduce the concept I don't think they can be fully explained. Here is one simple result which I think can: a function on an interval I which is locally a polynomial is globally a polynomial. That if, if f : I ---> R and around each a in I there's a neighborhood and a polynomial p_a(x) such that f(x) = p_a(x) for all x in a, then there is a single polynomial p(x) such that f(x) = p(x) for all x in I. The point is that polynomials that agree at infinitely many points are equal everywhere and connectedness lets you show a polynomial locally equal to f near one point has to be locally equal to f everywhere. Admittedly this is not an important result compared to the other suggestions, but it illustrates in a nice way one of the points of connectedness: how it turns local information into global information.

Answer by David Carchedi for Applications of connectedness

2010-05-31T20:31:21Z

Yet another rather simple application is that any continuous function $f:X \to \mathbb{Z}$ is constant along each connected component (or just constant if X is connected).

Answer by Spencer for Applications of connectedness

2010-05-31T22:03:27Z

You can get the maximum principle for subharmonic functions: Write $F$ for the supremum of $f$ in $\Omega$, write $A$ for the set where $f = F$ and $B$ for the set where $f < F$. Then

$\Omega = A \cup B$.

Now, B is open by upper semicontinuity. If the first is non-empty then it is fairly straightforward to show that it too must be open and therefore the whole domain.

Answer by Yuri Bakhtin for Applications of connectedness

2010-06-01T01:35:26Z

In robotic motion planning, see, e.g., http://parasol.tamu.edu/~amato/Courses/padova04/lectures/L1.intro.ps the connectedness of the configuration space means that one can reach the desired arrangement of solid objects from any initial arrangement.

Answer by Victor Protsak for Applications of connectedness

2010-06-01T04:24:44Z

Our space has two different orientations. It is possible to deform any "right" frame into the standard one (keeping it a frame throughout), but impossible to do it with a "left" frame.

(I originally misread your question as asking about applications of connectedness of the real line.)

Answer by Diego Matessi for Applications of connectedness

2010-06-08T16:02:08Z

As an application of connectedness you can prove the "Borsuk-Ulam" theorem in dimension 1, i.e. that for any continuous function $f$ from $S^1$ to the reals there are two radially symmetric points which are mapped to the same point. This is because the function g(v) = f(v) - f(-v) is either constant or has points where it is positive and points where it is negative, therefore it must have a point where it is zero.

As an application of this fact you can show that for any pair of compact regions A and B inside the plane there is one line splitting each region in pieces of equal area (see the book by Kosniowski, A first course in algebraic topology, where this is referred to as a "pancake problem").

Answer by Gerhard Paseman for Applications of connectedness

2010-06-08T19:27:18Z

For high wow factor, try the topologists sine curve, to let students know that there is more to connectivity than paths. Not so much an application as a hint to how wierd the concept can become.

Gerhard "Ask Me About System Design" Paseman, 2010.06.08