Abstract¶
The conditions for one vector to majorisation another and for a function to be Schur-convex.
Keywords:Vectorsmajorisation.¶ Let x,y ∈ Rn with components (x1,x2,…,xn) and (y1,y2,…,yn) respectively.
If x majorises y, then y can be considered to be more mixed or closer to the maximally mixed vector, I=(1/n,1/n,…,1/n), then x.
If x majorises y then it is typically denoted by x≻y.
Majorisation Conditions¶
x majorises y:
i∑kxi↓≥i∑kyi↓ ∀ k=1,2,…,n−1 with i∑nxi=i∑nyi. where xi↓ and yi↓ are the components of x and y respectively, ordered in non-increasing order, such that xi≥xi+1 ∀ i.
Ax=y, AI=I. (where the second condition ensures A needs to be doubly stochastic).
Schur-convex Functions¶
A function f:Rn→R is called Schur-convex if and only if
x≻y⟹f(x)≥f(y). A function f:Rn→R is called Schur-concave if and only if
x≻y⟹f(x)≤f(y).