Rotation number (mathematics)

from Wikipedia, the free encyclopedia

The number of turns (also called number of turns or index ) is a topological invariant that plays a decisive role in function theory .

Preview

The number of revolutions of a curve in relation to a point represents the number of turns in counterclockwise direction when following the course of the curve. A turn around in clockwise direction results in the negative number of turns −1.

Number of turns
1 −1 0 1 2
Number of turns = 1 (circle counterclockwise) .svg Number of turns = −1 Number of turns = 0 Number of turns = 1 Number of turns = 2

definition

If a closed curve is in and if there is also a point that does not lie on, then the revolution number of is defined in relation to :

The circulation number (according to the English index ) is often referred to in the literature as or . The number of revolutions of a closed curve is always an integer regardless of the reference point.

calculation

Number of turns = 2
Number of turns = 0

The number of turns can be determined intuitively using

Number of revolutions from um counterclockwise - number of revolutions from um clockwise

to calculate. The calculation via the definition is often not easily possible. As an example we choose the unit circle

as a curve. According to the intuitive rule is for all points in its interior and for all points outside of the closed circular disk . The latter follows immediately from Cauchy's integral theorem and the definition. Be now

It applies

Interchanging differentiation and integration results in

and because a primitive of the integrand is, is because coherently is, so for all

Application in function theory

The number of revolutions is mainly used in the calculation of curve integrals in the complex number plane. Be

a meromorphic function with singularities then one can after the residue theorem , the integral of a (by any of the singularities extending) curve by

to calculate.

algorithm

Number of turns of the surfaces of a nontrivial polygon: The number of turns for the surface in which the point is located is −1, i.e. This means that it lies within the polygon (the gray area). Each surface has a fixed number of turns.

In algorithmic geometry , the revolution number is used to determine whether a point is outside or inside a non-simple polygon (a polygon whose edges intersect). For simple polygons the algorithm for the even-odd rule is simplified.

For polygons (closed edges) the following algorithm is used to calculate the number of revolutions:

  1. Find a half-line (starting at the point to be examined outwards ) that does not contain any corner points of the polygon.
  2. Set
  3. For all intersections of the half-line with the polygon:
    • If the half-line intersects a polygon edge that is oriented "from right to left" (if the point is on the left side of the edge), increase by 1.
    • If the half-line intersects a polygon edge that is oriented "from left to right" (if the point is on the right side of the edge), reduce by 1.
  4. is now the number of revolutions of the point.

If the rotation number is 0, the point lies outside the polygon, otherwise inside.

In the example opposite, the half-line that starts with is the vertical arrow. It cuts three edges of the polygon. With regard to the red edge, the point is to the right. With regard to the next edge, the point is also to the right and, with regard to the last edge, the point is to the left. The point lies within the polygon. The polygon area has a gray background.

An analogous algorithm also gives the number of revolutions around one point for non-straight (closed) curves, but checking the intersection points is not so easy to implement there.

Generalization for n -dimensional manifolds

A generalization for -dimensional manifolds comes from Nikolai Nikolajewitsch Bogolyubov : Using the general Stokes' theorem for one can

write. is the unit sphere im is the considered -dimensional closed manifold on which to integrate.

See also

literature

  • Eberhard Freitag, Rolf Busam: Theory of functions 1. Springer-Verlag, Berlin, ISBN 3-540-67641-4 .