Majorization
From Wikipedia, the free encyclopedia
In mathematics, majorization is a partial order over vectors of real numbers. Given , we say that majorizes , and we write , if and for all ,
where and are the elements of and , respectively, sorted in decreasing order. Equivalently, we say that dominates , or that is majorized (or dominated) by .
The following statements are true if and only if :
- for some doubly stochastic matrix D.
- From we can produce by a finite sequence of "Robin Hood operations" where we replace two elements ai and aj < ai with and , respectively, for some .
- For every convex function , . This result is known as Karamata's theorem.[citation needed]
A function is said to be Schur convex when implies . Similarly, is Schur concave when implies .
The majorization partial order on finite sets can be generalized to the Lorenz ordering, a partial order on distribution functions.
[edit] In linear algebra
- Suppose that for two real vectors , v majorizes v'. Then it can be shown that there exists a set of probabilities and a set of permutations such that . Alternatively it can be shown that there exists a doubly stochastic matrix D such that vD = v'
- We say that a hermitian operator, H, majorizes another, H', if the set of eigenvalues of H majorizes that of H'.
[edit] References
- Quantum Computation and Quantum Information, (2000) Michael A. Nielsen and Isaac L. Chuang, Cambridge University Press
- Majorization and its applications to quantum information theory, (1999) Michael A, Nielsen, personal notes
- Majorization in Mathworld
- Barry C. Arnold. "Majorization and the Lorenz Order: A Brief Introduction". Springer-Verlag Lecture Notes in Statistics, vol. 43, 1987.
- J. Karamata. Sur une inegalite relative aux fonctions convexes. Publ. Math. Univ. Belgrade 1, 145-158, 1932.