Sign function

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Signum function y = sgn x

In mathematics, the sign function or signum function (from signum, Latin for "sign") is an odd mathematical function that extracts the sign of a real number. In mathematical expressions the sign function is often represented as sgn. To avoid confusion with the sine function, this function is usually called the signum function.[1]


The signum function of a real number x is a piecewise function which is defined as follows:[1]


The sign function is not continuous at x = 0.

Any real number can be expressed as the product of its absolute value and its sign function:

It follows that whenever x is not equal to 0 we have

Similarly, for any real number x,

We can also ascertain that:
The signum function is the derivative of the absolute value function, up to (but not including) the indeterminacy at zero. More formally, in integration theory it is a weak derivative, and in convex function theory the subdifferential of the absolute value at 0 is the interval [−1, 1], "filling in" the sign function (the subdifferential of the absolute value is not single-valued at 0). Note, the resultant power of x is 0, similar to the ordinary derivative of x. The numbers cancel and all we are left with is the sign of x.

The signum function is differentiable with derivative 0 everywhere except at 0. It is not differentiable at 0 in the ordinary sense, but under the generalised notion of differentiation in distribution theory, the derivative of the signum function is two times the Dirac delta function, which can be demonstrated using the identity [2]

where H(x) is the Heaviside step function using the standard H(0) = 1/2 formalism. Using this identity, it is easy to derive the distributional derivative:[3]

The Fourier transform of the signum function is[4]

where p. v. means Cauchy principal value.

The signum can also be written using the Iverson bracket notation:

The signum can also be written using the floor and the absolute value functions:

The signum function has very simple definition If 0^0 is accepted to be equal to 1. Then signum can be written for all real numbers as
The signum function coincides with the limits

For k ≫ 1, a smooth approximation of the sign function is

Another approximation is
which gets sharper as ε → 0; note that this is the derivative of x2 + ε2. This is inspired from the fact that the above is exactly equal for all nonzero x if ε = 0, and has the advantage of simple generalization to higher-dimensional analogues of the sign function (for example, the partial derivatives of x2 + y2).

See Heaviside step function – Analytic approximations.

Complex signum[edit]

The signum function can be generalized to complex numbers as:

for any complex number z except z = 0. The signum of a given complex number z is the point on the unit circle of the complex plane that is nearest to z. Then, for z ≠ 0,
where arg is the complex argument function.

For reasons of symmetry, and to keep this a proper generalization of the signum function on the reals, also in the complex domain one usually defines, for z = 0:

Another generalization of the sign function for real and complex expressions is csgn,[5] which is defined as:

where Re(z) is the real part of z and Im(z) is the imaginary part of z.

We then have (for z ≠ 0):

Generalized signum function[edit]

At real values of x, it is possible to define a generalized function–version of the signum function, ε(x) such that ε(x)2 = 1 everywhere, including at the point x = 0, unlike sgn, for which (sgn 0)2 = 0. This generalized signum allows construction of the algebra of generalized functions, but the price of such generalization is the loss of commutativity. In particular, the generalized signum anticommutes with the Dirac delta function[6]

in addition, ε(x) cannot be evaluated at x = 0; and the special name, ε is necessary to distinguish it from the function sgn. (ε(0) is not defined, but sgn 0 = 0.)

Generalization to matrices[edit]

Thanks to the Polar decomposition theorem, a matrix ( and ) can be decomposed as a product where is a unitary matrix and is a self-adjoint, or Hermitian, positive definite matrix, both in . If is invertible then such a decomposition is unique and plays the role of 's signum. A dual construction is given by the decomposition where is unitary, but generally different than . This leads to each invertible matrix having a unique left-signum and right-signum .

In the special case where and the (invertible) matrix , which identifies with the (nonzero) complex number , then the signum matrices satisfy and identify with the complex signum of , . In this sense, polar decomposition generalizes to matrices the signum-modulus decomposition of complex numbers.

See also[edit]


  1. ^ a b "Signum function - Maeckes".{{cite web}}: CS1 maint: url-status (link)
  2. ^ Weisstein, Eric W. "Sign". MathWorld.
  3. ^ Weisstein, Eric W. "Heaviside Step Function". MathWorld.
  4. ^ Burrows, B. L.; Colwell, D. J. (1990). "The Fourier transform of the unit step function". International Journal of Mathematical Education in Science and Technology. 21 (4): 629–635. doi:10.1080/0020739900210418.
  5. ^ Maple V documentation. May 21, 1998
  6. ^ Yu.M.Shirokov (1979). "Algebra of one-dimensional generalized functions". TMF. 39 (3): 471–477. doi:10.1007/BF01017992. Archived from the original on 2012-12-08.