Preply — Study more efficiently by working with a personal tutor. Get 50% off.Affiliate

Wikipedia

Lusternik–Schnirelmann theorem

Lusternik–Schnirelmann theorem

In mathematics, the Lusternik–Schnirelmann theorem, aka Lusternik–Schnirelmann–Borsuk theorem or LSB theorem gives a sufficient condition for the inclusion of antipodal points in a cover of a sphere. It is named after Lazar Lyusternik and Lev Schnirelmann, who published it in 1930.

Statement The sphere or hypersphere S n {\displaystyle S^{n}} is an n {\displaystyle n} -dimensional surface, conventionally embedded as the set of unit vectors in the ( n + 1 ) {\displaystyle (n+1)} -dimensional space R n + 1 {\displaystyle \mathbb {R} ^{n+1}} . In this embedding, the pairs of unit vectors ( x , − x ) {\displaystyle (x,-x)} are antipodal (polar opposites). A cover is a family of subsets of the sphere whose union is the entire sphere. Intuitively, a subset of the sphere is a closed set if it includes all of its boundary points, or more formally if it contains all limits of sequences of points in the subset. The Lusternik–Schnirelmann theorem can then be stated as:

The related Lusternik–Schnirelmann category of a topological space is the minimum number of subsets in a cover for which each subset is topologically simple (in a technical sense). It is at most two for a sphere, which can be covered by two hemispheres. However, the sphere can be used to construct a more complicated projective space R P n {\displaystyle \mathbb {RP} ^{n}} , the quotient space obtained by treating each pair of antipodal points as a single point. The Lusternik–Schnirelmann theorem implies that the Lusternik–Schnirelmann category of R P n {\displaystyle \mathbb {RP} ^{n}} is at least n + 1 {\displaystyle n+1} , and it turns out to equal n + 1 {\displaystyle n+1} .

Proof The theorem can be proved by leveraging the relationship between S n {\displaystyle S^{n}} and R P n {\displaystyle \mathbb {RP} ^{n}} , and the Borsuk-Ulam theorem in higher dimensions. Real Projective Space R P n {\displaystyle \mathbb {RP} ^{n}} is defined as the quotient space of S n {\displaystyle S^{n}} by the antipodal map, where each point x ∈ S n {\displaystyle x\in S^{n}} is identified with its antipodal point − x ∈ S n {\displaystyle -x\in S^{n}} . In other words, R P n = S n / ∼ {\displaystyle \mathbb {RP} ^{n}=S^{n}/\sim } , where x ∼ − x {\displaystyle x\sim -x} . A pair of antipodal points in S n {\displaystyle S^{n}} corresponds to a single point in R P n {\displaystyle \mathbb {RP} ^{n}} . The concept of "containing a pair of antipodal points" in a subset of S n {\displaystyle S^{n}} is equivalent to that subset having a non-empty intersection with the pre-image of some point in R P n {\displaystyle \mathbb {RP} ^{n}} under the projection map π : S n → R P n {\displaystyle \pi :S^{n}\to \mathbb {RP} ^{n}} . The Borsuk-Ulam theorem states that for any continuous map f : S n → R n {\displaystyle f:S^{n}\to \mathbb {R} ^{n}} , there exists at least one pair of antipodal points { x , − x } {\displaystyle \{x,-x\}} in S n {\displaystyle S^{n}} such that f ( x ) = f ( − x ) {\displaystyle f(x)=f(-x)} . Consider S n {\displaystyle S^{n}} expressed as the union of n + 1 {\displaystyle n+1} closed sets A 1 , A 2 , … , A n + 1 {\displaystyle A_{1},A_{2},\ldots ,A_{n+1}} . Define distance functions d i ( x ) = inf y ∈ A i | x − y | {\displaystyle d_{i}(x)=\inf _{y\in A_{i}}|x-y|} for i = 1 , … , n {\displaystyle i=1,\ldots ,n} . These are continuous functions. Construct a map F : S n → R n {\displaystyle F:S^{n}\to \mathbb {R} ^{n}} given by F ( x ) = ( d 1 ( x ) , d 2 ( x ) , … , d n ( x ) ) {\displaystyle F(x)=(d_{1}(x),d_{2}(x),\ldots ,d_{n}(x))} . By the Borsuk-Ulam theorem, there exists a pair of antipodal points { x 0 , − x 0 } {\displaystyle \{x_{0},-x_{0}\}} such that F ( x 0 ) = F ( − x 0 ) {\displaystyle F(x_{0})=F(-x_{0})} , meaning d i ( x 0 ) = d i ( − x 0 ) {\displaystyle d_{i}(x_{0})=d_{i}(-x_{0})} for all i = 1 , … , n {\displaystyle i=1,\ldots ,n} . If any d i ( x 0 ) = 0 {\displaystyle d_{i}(x_{0})=0} , then x 0 ∈ A i {\displaystyle x_{0}\in A_{i}} . Since d i ( x 0 ) = d i ( − x 0 ) = 0 {\displaystyle d_{i}(x_{0})=d_{i}(-x_{0})=0} , then − x 0 ∈ A i {\displaystyle -x_{0}\in A_{i}} as well (because A i {\displaystyle A_{i}} is closed). Thus, A i {\displaystyle A_{i}} contains a pair of antipodal points. If d i ( x 0 ) > 0 {\displaystyle d_{i}(x_{0})>0} for all i = 1 , … , n {\displaystyle i=1,\ldots ,n} , then x 0 ∉ A i {\displaystyle x_{0}\notin A_{i}} for i = 1 , … , n {\displaystyle i=1,\ldots ,n} . Since S n = ⋃ j = 1 n + 1 A j {\displaystyle S^{n}=\bigcup _{j=1}^{n+1}A_{j}} , it must be that x 0 ∈ A n + 1 {\displaystyle x_{0}\in A_{n+1}} . Similarly, since d i ( − x 0 ) > 0 {\displaystyle d_{i}(-x_{0})>0} for all i = 1 , … , n {\displaystyle i=1,\ldots ,n} , then − x 0 ∉ A i {\displaystyle -x_{0}\notin A_{i}} for i = 1 , … , n {\displaystyle i=1,\ldots ,n} , implying − x 0 ∈ A n + 1 {\displaystyle -x_{0}\in A_{n+1}} . Therefore, A n + 1 {\displaystyle A_{n+1}} contains a pair of antipodal points.

Equivalent results There are several fixed-point theorems which come in three equivalent variants: an algebraic topology variant, a combinatorial variant and a set-covering variant. Each variant can be proved separately using totally different arguments, but each variant can also be reduced to the other variants in its row. Additionally, each result in the top row can be deduced from the one below it in the same column.

References

Tags

  • Fixed-point theorems
  • Topology stubs