Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given, $$ 0<p_{i} ,q_{i} <1 $$ define ${E}{}_{k}$ as,

$$\begin{array}{l} {E_{1} =\min(p_{1} ,q_{1} )+\min(1-p_{1} ,1-q_{1} )} \\ {E_{2} =\min(p_{1} p_{2} ,q_{1} q_{2} )+\min(p_{1} (1-p_{2} ),q_{1} (1-q_{2} ))+} \\ {\quad \quad \; +\min((1-p_{1} )p_{2} ,(1-q_{1} )q_{2} )+\min((1-p_{1} )(1-p_{2} ),(1-q_{1} )(1-q_{2} ))} \\ {E_{3} =\min(p_{1} p_{2} p_{3} ,\; q_{1} q_{2} q_{3} )+\min(p_{1} p_{2} (1-p_{3} ),\; q_{1} q_{2} (1-q_{3} ))+\cdots \text{etc.}} \end{array}\ $$


Notice that ${E}{}_{k+1}$ is formed by splitting each summand of ${E}{}_{k}$ into two, using ${p}{}_{k+1}$ and ${q}{}_{k+1}$. Notice also that ${E}{}_{k}$ has 2${}^{k}$ terms.

${E}{}_{k}$ is actually twice the Bayes error from two classes with multivariate Bernoulli distributions.

I would like to prove that for any $1 \leq m \leq k$,

$$\forall \varepsilon \;,\; 0<\varepsilon <1-q_{m}, \;if \;\; q_{m} -p_{m} >0 \; then\;\; {E’}{}_{k} \leq {E}{}_{k} $$ where ${E’}{}_{k}$ takes $q_{m}+\varepsilon$ instead of $q_{m}$

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.