In this talk we will discuss about linear information inequalities, both discrete and continuous ones. We will prove that every discrete information inequality is associated with a “balanced” information inequality and a set of “residual weights.” To prove the inequality, it is necessary and sufficient to prove that its “balanced” version is valid and all its residual weights are nonnegative. For a continuous information inequality, we will prove that it is valid if and only if its discrete counterpart is balanced and valid.
