Let aij (1≤i≤n, 1≤j≤n) be numbers ≥0 such that for each index i one has ∑j=1naij=1 and, for each index j one has ∑i=1naij=1. Let xi (1≤i≤n) be n numbers > 0; put
yi=ai1x1+ai2x2+⋯+ainxn(1≤i≤n). Show that
y1y2…yn≥x1x2…xn (bound
logyi below for each index
i).