previous
Previous: Return to notes

Regions in a Venn diagram

Why does a Venn diagram with n sets divide the universe into tex2html_wrap_inline34 regions? The number tex2html_wrap_inline34 comes from the fact that each region can be written as an intersection of n sets. Consider this Venn diagram with n=3. There are tex2html_wrap_inline42 regions as predicted. Each region consists of those points in some of the subsets and not in others. For example, region 3 contains points in A and in B but not in C. That's the set tex2html_wrap_inline50 . Region 8 is tex2html_wrap_inline52 since it contains points not in A, not in B and in C. So any triple intersection involving A or tex2html_wrap_inline62 , B or tex2html_wrap_inline66 and C or tex2html_wrap_inline70 corresponds to one of the regions. How many such triple intersections are there? We have 2 choices for the first set (A or tex2html_wrap_inline62 ), 2 choices for the second and 2 for the third. That makes a total of tex2html_wrap_inline76 triple intersections. Here is the list of all 8.

displaymath30

There is nothing special about using 3 sets. The same reasoning applies to n sets. If we have n sets tex2html_wrap_inline98 and form intersections of n sets by picking tex2html_wrap_inline102 or tex2html_wrap_inline104 , tex2html_wrap_inline106 or tex2html_wrap_inline108 and so on up to tex2html_wrap_inline110 or tex2html_wrap_inline112 we will tex2html_wrap_inline34 such intersections.



Dan Rinne
Sun Aug 25 12:27:46 PDT 1996