  Let $X_1$, $X_2$, $\ldots$, $X_n$ be a sequence of coherent random variables,
i.e., satisfying the equalities $$ X_j=\mathbb{P}(A|\mathcal{G}_j),\qquad
j=1,\,2,\,\ldots,\,n,$$ almost surely for some event $A$. The paper contains
the proof of the estimate $$\mathbb{P}\Big(\max_{1\le i < j\le n}|X_i-X_j|\ge
\delta\Big) \leq \frac{n(1-\delta)}{2-\delta} \wedge 1,$$ where $\delta\in
(\frac{1}{2},1]$ is a given parameter. The inequality is sharp: for any
$\delta$, the constant on the right cannot be replaced by any smaller number.
The argument rests on several novel combinatorial and symmetrization arguments,
combined with dynamic programming. Our result generalizes the two-variate
inequality of K. Burdzy and S. Pal and in particular provides its alternative
derivation.
