- Iverson bracket
In
mathematics , the Iverson bracket is a convenient 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 byKenneth E. Iverson in his programming language APL. [Ronald Graham ,Donald Knuth , andOren Patashnik . "Concrete Mathematics." Section 2.2: Sums and Recurrences.]Uses
The notation is useful in expressing sums or integrals without boundary conditions. For example: In the first sum, the index is limited to be in the range 0 to 10. The second sum is allowed to range over all integers, but where "i" is strictly less than 0 or strictly greater than 10, the summand is 0, contributing 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:
which is valid only for may be written
:
which is valid for all positive integer n.
pecial Cases
The
Kronecker delta notation is a specific case of Iverson notation when the condition is equality. That is,:The
indicator function , another specific case, has set membership as its condition::The
sign function is also easily expressed in this notation::References
External links
* Donald Knuth, "Two Notes on Notation", American Mathematical Monthly, Volume 99, Number 5, May 1992, pp. 403–422. ( [http://www-cs-faculty.stanford.edu/~knuth/papers/tnn.tex.gz TeX] , arxiv|math|9205211)
* Kenneth E. Iverson, "A Programming Language", New York: Wiley, p. 11, 1962.
Wikimedia Foundation. 2010.