In this article, we only consider continuous maps. So when we write "map", we mean "continuous map". And the coefficient field of all Hi(X) and Ci(X) is F2.
Problem
We have a sandwich (of course it is in R3) that contains three parts (the i-th part is a disk Di×[i−1,i], Di⊂R2, i∈{1,2,3}), and we want to cut it into two parts by a plane. Can we make their volumes equal?
We first introduce a theorem:
Borsuk–Ulam Theorem
∀g:Sn→Rn∃x0∈Sns.t.g(x0)=g(−x0)
Let's see how to prove it.
Lemma 1
The theorem is equivalent to:
∃f:Sn→Sn−1s.t.f(−x)=−f(x)
If ∃gs.t.∀x,g(x)=g(−x),then let f(x)=∥g(x)−g(−x)∥g(x)−g(−x), which satisfies f(−x)=−f(x).Conversely, if ∃f:Sn→Sn−1 s.t. f(−x)=−f(x),then g=l∘fs.t.g(x)=−g(−x)=g(−x),where l:Sn−1→Rn maps s∈Sn−1 to its coordinate representation in {x∈Rn,∥x∥=1}⊂Rn.
So they are indeed equivalent. We will prove the lemma's form.
Homology
In this section, there will be many definitions to clarify.
We will use simplicial homology to prove the theorem. We will use homology over Z/2Z rather than Z, since the homology of RPn is much simpler.
Limited by the length of this article, some basic conclusions about homology in this section will not be proved.
Affine Independence, Simplices, Faces, and Simplicial Complexes
In Rm, a set of vectors {v1,…,vn} is affinely independent iff for all {ci}i=1n such that ∑ici=0, we have ∑civi=0⟺∀i,ci=0.
If a set of vectors is affinely independent, then the set {∑cixi∣∑ci=1,ci≥0} is an n-simplex represented by ⟨x1,…,xn⟩. A face of a simplex is ⟨yi⟩i=1k where {yi}i=1k⊂{xi}i=1n.
If a set of simplices composes a set K, and:
∀σ1,σ2∈K, σ1∩σ2 is a common face of σ1 and σ2,
∀σf that is a face of σ∈K, we have σf∈K,
then K is a simplicial complex (we will just say complex henceforth), and ∣K∣=⋃σ∈Kσ is a simplicial polytope.
Simplicial Maps, Stars, and Simplicial Approximations
A simplicial map is a map V(K)→V(L), where V(K) is the vertex set of K. A simplicial map can be naturally extended to ∣K∣: it is easy to prove that every point is contained in the interior of only one simplex, so we can define f(x) by the convex combination of that simplex's vertices' values.
St(x), the star of x, is ⋃x∈σσ.
A simplicial approximation of f:∣K∣→∣L∣ is a simplicial map g s.t. ∀x,f(St(x))⊂St(g(x)).
One can prove that, for many (but not all) spaces X, we can find a simplicial complex K such that ∣K∣≅X. This enables us to study the simplicial complex K instead of X.
Chain Groups, Boundary Operators, and Homology Groups
For a complex K, let S be the set containing all k-simplices. We define Ck(K,F)=∑s∈Scss,cs∈F. We will write Ck(K) to represent Ck(K,F2).
Define the operator dk:Ck(K)→Ck−1(K) by dk⟨x1,…,xn⟩↦∑i=1n(−1)i⟨x1,…,xi−1,xi+1,…,xn⟩. We can verify that dk∘dk−1=0.
Finally, for the homology groups: we define Hn(X)=imdn+1kerdn.
An Important Lemma
X≃Y⟹H(X)≅H(Y)f:X→Y induces a homomorphism f∗:H(X)→H(Y)f≃g⟹f∗=g∗f∗i=1∑kci⟨v1…vn⟩=i=1∑kci⟨f(v1)…f(vn)⟩
Omitted
This important lemma enables us to only care about the effect of any map on X≃∣K∣ on the homology groups, rather than considering a simplicial map on a triangulation.
Degree of a Map
For a map f:Sn→Sn,f induces a homomorphism f∗:Hn(Sn)→Hn(Sn).Since Hn(Sn)≅Z2,f∗ is an endomorphism.So, taking 1 as the generator of Hn(Sn):f∗(1)=m⟹f∗(n⋅1)=n⋅f∗(1)Thus, we define degf=f∗(1).
To base our proof on some specific spaces, we need the following results:
The fact that f can be extended indicates that ∃F:Dn+1→Sns.t.F∣∂Dn+1=f, making the following diagram commute:
Considering the map it induces on homology, we have:
But Hn(Dn+1)=0, so i∗=0, which implies f∗=F∗∘i∗=F∗∘0=0. Thus, degf∗=0.
Lemma 3
∀f:Sn→Sn,f(−x)=−f(x)degf≡1(mod2)
Since f(−x)=−f(x), we can descend f to fˉ:RPn→RPn,[x]↦[f(x)]. Since [x]=[y]∧x=y⟺x=−y⟹f(x)=−f(y)⟺[f(x)]=[f(y)], we know it is well-defined. This observation (that f can be descended to RPn) reminds us to consider RPn. Since Sn is a double cover of RPn, we obtain a short exact sequence of chain complexes:
We define p as the simplicial approximation of the covering map (σ~↦σ), and T:RPn→Sn as T(σ)=∑(p−1(σ)) (the sum of the two lifts in Sn). Since we work over Z2, we have p∘T=σ+σ=0, so the sequence is indeed exact:
Notice that in order to obtain a simplicial approximation of p and T, we have to perform barycentric subdivision on RPn and Sn. However, since barycentric subdivision does not change the homotopy type (up to isomorphism), we can write the homology groups simply as Hi(Sn) and Hi(RPn).
Once we obtain the simplicial approximations of p and T, they must commute with the boundary operator ∂. Thus, by the Snake Lemma, we obtain the long exact sequence:
The map f will induce an endomorphism on homology as well. It is easy to verify that f commutes with T and p:
f∘T(σ)=f(σ~1+σ~2)=f(σ~1)+f(σ~2)=f(σ1)+f(σ2)=T∘f(σ), and the case for p is similar. This happens naturally because T and p are lift/projection maps, while f preserves the fibers. Since f∗ commutes with T∗ and p∗, we can show that it must commute with the connecting homomorphism δ. Thus, we can write the following commutative diagram:
To prove the degree is 1, we must prove that fn∗ is an isomorphism. Here, fˉ∗ plays the role of a bridge.
We will proceed by induction. For i=0, H0 represents the connected components. Since RPn is connected, it follows that fˉ0∗=id is an isomorphism.
Now consider i∈[1,n−1]. Assume we have proved that for all k<i, fˉk∗ is an isomorphism.
Notice that Hi(Sn)=0 for all i∈[1,n−1]. By exactness, we find that δi is an injection, and hence an isomorphism for all i∈[1,n−1]. As for i=n, δn is a surjection, and hence an isomorphism as well. Thus, in this part of the commutative diagram, we see:
The top, bottom, and right edges are all isomorphisms, so the left edge is also an isomorphism.
Finally, look at this part:
Since Hn+1(RPn)=0, the five maps between the two long exact sequences are all isomorphisms except possibly the middle one. Then, by the Five Lemma, the middle map fn∗ is also an isomorphism.
Thus, f∗=id on Z2, so degf=1.
Final Proof
By Lemma 1, we want to prove that there does not exist any map f:Sn→Sn−1 such that f(−x)=−f(x).
We will prove this by contradiction. Assume that such a map f:Sn→Sn−1 exists with f(−x)=−f(x).
We can embed Sn into Rn+1 as the unit sphere ∑i=0nxi2=1, and embed Sn−1 as the equator of Sn given by x0=0,∑i=1nxi2=1.
Then we can restrict f to Sn−1 to obtain a map f∣Sn−1:Sn−1→Sn−1 satisfying f∣Sn−1(−x)=−f∣Sn−1(x). By Lemma 3, we know that degf∣Sn−1=1.
However, we can extend f∣Sn−1 to a map g:Dn→Sn−1, where Dn can be embedded as the upper hemisphere of Sn, {x∈Sn∣x0≥0}, by defining g(x1,…,xn)=f(1−∑i=1nxi2,x1,…,xn). Thus, degf∣Sn−1=0 by Lemma 2.
This yields a contradiction. Therefore, such a map f does not exist.
Existence
We can divide the sandwich.
A plane ∑i=1kcixi=−ck+1 in Rk can be represented by a point (c1,…,ck+1)∈Sk satisfying ∑i=1k+1ci2=1. Thus, we can define fi(c) as the volume of the set (Di×[i−1,i])∩{(x1,…,xk)∣(x1,…,xk,1)⋅(c1,…,ck+1)≥0}. Since ∑i=1k+1ci2=1, we obtain a map F:Sk→Rk, c↦(f1(c),…,fk(c)).
By the Borsuk–Ulam Theorem, we know that there exists a point c such that F(c)=F(−c), which means the plane ∑i=1kcixi=−ck+1 divides the k regions into two parts with equal volumes.
Setting k=3 yields the sandwich theorem, and setting k>3 yields the hyper-sandwich theorem.
Summary
We know we can divide it, but we still do not know how to do it. Sarcastic, right?