Given random variables X ∈ {x 1 , ..., x m }, C ∈ {0, 1} and Y ∈ {0, 1}, if This theorem indicates that a perfect context feature for a given task is not necessarily the class label itself.
even if we have little information about Y , we still have the chance to know the information of P (Y |X) by P (C|X).