The following theorem is based on (Dasgupta et al., 2001).
theorem 4 If view independence is satisfied, and if F and G are rules based on different views, then one of the following holds: for a given binary rule F , a pessimistic estimate of the number of errors made by F is δ/(µ − δ) times the number of instances labeled by F , plus the number of instances left unlabeled by F .