= Clamped-map proof of planar path crossing
Let $\alpha,\beta:[0,1]\to[0,1]^2$ be <continuous paths> with $\alpha_1(0)=0$, $\alpha_1(1)=1$, $\beta_2(0)=0$, and $\beta_2(1)=1$. Thus one <continuous path> joins the left and right sides of the <square>, and the other joins the bottom and top. They must intersect, even if neither <continuous path> is injective.
Define the <continuous map>
$$
H(s,t)=(\alpha_1(s)-\beta_1(t),\,\beta_2(t)-\alpha_2(s)).
$$
Its first component is nonpositive on $s=0$ and nonnegative on $s=1$; its second component has the corresponding signs on $t=0$ and $t=1$. This is the sign pattern of the <Poincaré-Miranda theorem>. To see the <fixed point> argument explicitly, fix $\varepsilon>0$, put $c(u)=\max(0,\min(1,u))$, and set $T(z)_i=c(z_i-\varepsilon H_i(z))$. The <Brouwer fixed-point theorem> gives a <fixed point> $z$ of this <continuous> self-map of the <square>. If $0<z_i<1$, its equation forces $H_i(z)=0$. If $z_i=0$, clamping requires $H_i(z)\geq0$, while the boundary sign gives $H_i(z)\leq0$. The case $z_i=1$ reverses these inequalities and again gives zero. Consequently $H(s,t)=0$, so $\alpha(s)=\beta(t)$.
Back to article page