Iverson bracket

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, the Iverson bracket, named after Kenneth E. Iverson, is a notation that denotes a number that is 1 if the condition in square brackets is satisfied, and 0 otherwise. More exactly,

where P is a statement that can be true or false. This notation was introduced by Kenneth E. Iverson in his programming language APL,[1][2] while the specific restriction to square brackets was advocated by Donald Knuth to avoid ambiguity in parenthesized logical expressions.[3]

Uses[edit]

The Iverson bracket converts a Boolean value to an integer value through the natural map , which allows counting to be represented as summation. For instance, the Euler phi function that counts the number of positive integers up to n which are coprime to n can be expressed by

More generally the notation allows moving boundary conditions of summations (or integrals) as a separate factor into the summand, freeing up space around the summation operator, but more importantly allowing it to be manipulated algebraically. For example,

In the first sum, the index i is limited to be in the range 1 to 10. In the second sum, i is allowed to range over all integers, but the summand is 0 if i is strictly less than 1 or strictly greater than 10, so these terms contribute nothing to the sum. Such use of the Iverson bracket can permit easier manipulation of these expressions.

Another use of the Iverson bracket is to simplify equations with special cases. For example, the formula

is valid for n > 1 but is off by 1/2 for n = 1. To get an identity valid for all positive integers n (i.e., all values for which is defined), a correction term involving the Iverson bracket may be added:

Expressing common functions[edit]

Many common functions, especially those with a natural piecewise definition, may be expressed in terms of the Iverson bracket. The Kronecker delta notation is a specific case of Iverson notation when the condition is equality. That is,

The indicator function, often denoted , or , is an Iverson bracket with set membership as its condition:

.

The Heaviside step function, sign function,[1] and absolute value function and are also easily expressed in this notation:

,
,

and

The comparison functions max and min (returning the larger or smaller of two arguments) may be written as

and
.

The floor and ceiling functions can be expressed as

and

where the index of summation is understood to range over all the integers.

The ramp function can be expressed

Finally, the trichotomy of the reals is equivalent to the following identity:

References[edit]

  1. ^ a b Kenneth E. Iverson (1962). A Programming Language. Wiley. p. 11. Retrieved 7 April 2016. 
  2. ^ Ronald Graham, Donald Knuth, and Oren Patashnik. Concrete Mathematics, Section 2.2: Sums and Recurrences.
  3. ^ Donald Knuth, "Two Notes on Notation", American Mathematical Monthly, Volume 99, Number 5, May 1992, pp. 403–422. (TeX, arXiv:math/9205211).