<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Partition of a set - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=partition_of_a_set&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=partition_of_a_set&amp;p=5">3.Next</a>
</p>
<p>of any two distinct sets in P is empty (that is ). The elements of P are said to be <a href="page.php?w=pairwise_disjoint">pairwise disjoint</a> or mutually exclusive. See also <a href="page.php?w=mutual_exclusivity">mutual exclusivity</a>.</p>

<p>The sets in  are called the blocks, parts, or cells, of the partition.  If  then we represent the cell containing  by .  That is to say,  is notation for the cell in  which contains .  </p>

<p>Every partition  may be identified with an equivalence relation on , namely the relation  such that for any</p><p>
<a accesskey="1" href="page.php?w=partition_of_a_set&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=partition_of_a_set&amp;p=5">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
