Difference between revisions of "Subsets"
Jump to navigation
Jump to search
Scott Roby1 (talk | contribs) |
Scott Roby1 (talk | contribs) |
||
Line 1: | Line 1: | ||
+ | |||
== Definition == | == Definition == | ||
Line 4: | Line 5: | ||
Two sets <math>X</math> and <math>Y</math> are said to be equal, <math>X=Y</math>, if both <math>X\subseteq Y</math> and <math>Y\subseteq X</math>. Note that some authors use the symbol <math>\subset</math> in place of the symbol <math>\subseteq</math>. | Two sets <math>X</math> and <math>Y</math> are said to be equal, <math>X=Y</math>, if both <math>X\subseteq Y</math> and <math>Y\subseteq X</math>. Note that some authors use the symbol <math>\subset</math> in place of the symbol <math>\subseteq</math>. | ||
+ | |||
+ | == Example == | ||
+ | |||
+ | Show that the set <math>X=\lbrace 6k : k\in\mathbb{Z} \rbrace</math> is a subset of <math>Y=\lbrace 2n : n\in\mathbb{Z} \rbrace</math> | ||
+ | |||
+ | === Solution === | ||
+ | |||
+ | We want to show that for any <math>x\in X</math> we also have <math>x\in Y</math>. To do this we will let <math>x</math> be an arbitrary element of the set <math>X</math>. This means that <math>x</math> can be written as <math>x=6k</math> for some integer <math>k</math>. Now we wish to show that <math>x=6k</math> is an element of the set <math>Y</math>. To do this, we need to show that our <math>x</math> satisfies the definition of being an element of <math>Y</math>; that is, <math>x</math> must look like <math>2n</math> for some integer <math>n</math>. This can be seen by writing <math>x=6k=2(3k)=2n</math> and declaring <math>3k=n</math>. |
Revision as of 20:01, 27 June 2015
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, , 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 .