Next: Proof of Theorem 6
Up: Appendix A
Previous: Proofsketch of Theorem 5
The proof of this lemma is quite straightforward, but we give it for completeness. can be rewritten as
with
where
. Suppose for contradiction that for some ,
. We simply permute the two values and , and we show that the new value of after,
, is not greater than before permuting,
. The difference between
and
can be easily decomposed using the notation
(
) as the value of (eq. (27)) in
, and
(
) as the value of (eq. (27)) in
. We also define:
|
|
|
(28) |
We define in the same way
. We obtain
Proving that
can be obtained as follows. First,
We also have
:
Here we have use the fact that
. This shows that
, and ends the proof of Lemma 1.
Next: Proof of Theorem 6
Up: Appendix A
Previous: Proofsketch of Theorem 5
©2002 AI Access Foundation and Morgan Kaufmann Publishers. All rights reserved.