Topological complexity

From HandWiki
Short description: Concept in topology

In mathematics, topological complexity of a topological space X (also denoted by TC(X)) is a topological invariant closely connected to the motion planning problem[further explanation needed], introduced by Michael Farber in 2003.

Definition

Let X be a topological space and PX={γ:[0,1]X} be the space of all continuous paths in X. Define the projection π:PXX×X by π(γ)=(γ(0),γ(1)). The topological complexity is the minimal number k such that

  • there exists an open cover {Ui}i=1k of X×X,
  • for each i=1,,k, there exists a local section si:UiPX.

Examples

  • The topological complexity: TC(X) = 1 if and only if X is contractible.
  • The topological complexity of the sphere Sn is 2 for n odd and 3 for n even. For example, in the case of the circle S1, we may define a path between two points to be the geodesic between the points, if it is unique. Any pair of antipodal points can be connected by a counter-clockwise path.
  • If F(m,n) is the configuration space of n distinct points in the Euclidean m-space, then
TC(F(m,n))={2n1formodd2n2formeven.

References

  1. Cohen, Daniel C.; Vandembroucq, Lucile (2016). "Topological complexity of the Klein bottle". Journal of Applied and Computational Topology 1 (2): 199–213. doi:10.1007/s41468-017-0002-0. 
  • Farber, M. (2003). "Topological complexity of motion planning". Discrete & Computational Geometry 29 (2): pp. 211–221. 
  • Armindo Costa: Topological Complexity of Configuration Spaces, Ph.D. Thesis, Durham University (2010), online
  • Topological complexity on nLab


ko:단면 범주#위상 복잡도