<< Chapter < Page Chapter >> Page >

There are finite numbers of elements in finite set. This allows us to analyze numbers of elements in different sets that results from the operations carried on them. In this module, we shall study different operations on sets in the context of practical applications. However, we shall limit ourselves to the interaction, involving two sets. The interaction, involving three sets, will be dealt in a separate module.

We use a specific notation to represent the numbers of elements in a set. For example, the numbers in set "A" is represented as "n(A)", whereas we denote numbers of elements in the union as "n( A B )".

Elements in the union of two sets

The area, demarcated with solid line, in the Venn’s diagram, shows the union of two sets denoted by ( A B ). We want to know the numbers of elements in this union in terms of numbers of elements in individual sets.

Union of two sets

The common elements in the union set is counted only once.

The sum of the numbers in the individual sets is generally greater than the numbers in the union. The reason is that union includes common elements only once. On the other hand, sum of the numbers of individual sets counts common elements once with each set – in total two times. Clearly, it is required that we deduct the numbers of elements, which are common to each set, from the sum of numbers of elements in individual sets. Hence,

n A B = n A + n B n A B

Here, n( A B ) represents the numbers of elements common to two sets. As reminder only, we note that plus (+) operation is not a valid set operation. We, however, use this algebraic operation here as we are now dealing with the numbers in set - not the set.

Alternatively, we can approach this expansion in yet another way. See the representation of intersection of two sets. The union of two sets can be considered to comprise of three distinct regions. Three regions shown with different colors represent three “disjoint” sets. Clearly,

Union of two sets

The region representing union consists of three distinct or disjointed region.

n A B = n A B + n A B + n B A

However, we observe that if we add n( A B ) to either of the two difference sets, then we get the complete individual set.

n A = n A B + n A B

n A B = n A n A B

and

n B = n B A + n A B

n B A = n B n A B

Substituting for the numbers of the difference set in the equation for the numbers in the union set, we have :

n A B = n A n A B + n A B + n B n A B

n A B = n A + n B n A B

Numbers of elements in the union of “disjoint” sets

Since there are no common elements between two disjoint sets, the intersection between disjoint sets is an empty set. Hence,

n A B = n A + n B

Application

Application of set theory to real situation is keyed to the interpretation of wordings and description. In order to efficiently employ the concepts of set theory to real world situations, we need to interpret description of collection appropriately.

Once collections are interpreted correctly, rest is easy. There are indeed fewer mathematical operations involved here. Most of these relate to determination of numbers of elements in a set. In this section, we shall first recapitulate or reinterpret different collections and then work with few representative situations for analysis (if we are confident then we can skip the recapitulation part).

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Functions. OpenStax CNX. Sep 23, 2008 Download for free at http://cnx.org/content/col10464/1.64
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Functions' conversation and receive update notifications?

Ask