Subsets

From Grad Wiki
Jump to navigation Jump to search


Definition

Let and be sets. We say that is a subset of if every element of is also an element of , and we write or . Symbolically, means .

Two sets and are said to be equal, Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle X=Y} , if both and . Note that some authors use the symbol in place of the symbol .

Example

Show that the set is a subset of

Solution

We want to show that for any we also have . To do this we will let be an arbitrary element of the set . This means that can be written as for some integer . Now we wish to show that is an element of the set . To do this, we need to show that our satisfies the definition of being an element of ; that is, must look like for some integer . This can be seen by writing and declaring .