The winding number records how many net turns a closed piecewise smooth curve makes around a chosen point . Counterclockwise turns contribute positively, clockwise turns negatively. It measures a traversal, including repeated visits; a drawing of the curve's outline alone can lose that information. For a closed curve avoiding ,
Equivalently, continuously follow an argument of along one journey and divide its total change by . The start and endpoint agree as complex numbers, so the change is an integer number of full turns. The principal argument at the endpoints cannot retain those turns; a continuous choice along the parametrized path can.[ref]
For , , the winding number about zero is one. Traversing the same unit circle twice makes it two; reversing its orientation of a contour makes it negative. The winding number about is zero: the same journey now stays to one side of the point being measured. Joining one counterclockwise loop and one clockwise loop around zero gives net winding number zero even though both loops encircle zero.
The winding number does not change during a homotopy of closed curves avoiding . This is why it is useful: complicated curves can often be deformed to simple ones whose count is obvious. The argument principle transfers that robust geometric integer to a count of zeros of a function and poles. The example in boundary sampling can miss winding shows why finite samples of a curve need control between samples before they can certify the same winding number.
If is continuous and closed, choose a continuous lift such that
Then . This agrees with the contour-integral definition when the path is piecewise smooth.
On a locally path-connected space, on each path component choose a value of a complex logarithm of at a base point. Continue it along paths using local logarithms. Independence of the path is exactly vanishing of the winding number of a continuous closed path for all loops. This constructs a continuous function with . The implication from a logarithm to zero winding requires no local connectivity. For applications to arbitrary planar compact sets, apply the criterion on polygonal neighborhoods rather than assuming the compact set is locally path-connected.

Ancestors (5)

  1. Complex analysis
  2. Analysis
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)