|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png) Viewing Message
|
|
|
| ``Re: explaination''
by rspuzio on 2005-01-04 13:34:15 |
|
| There's a neat way of recovering a and b from {{a},{a,b}} using Boolean operations which can be used to prove this assertion. To make things clearer, let P denote the set {{a},{a,b}}. Then note that the intersection of P is {a} and the union of P is {a,b}. Thus, we have already recovered a and it only remains to recover b. In the case where the intersection equals the union, a=b, so find b as a. Otherwise, we take the set difference of the union minus the intersection to obtain b.
|
| | [ reply | up | top ] |
|
|
|
|
|
|
