Difference between revisions of "Subsets"

From Grad Wiki
Jump to navigation Jump to search
Line 16: Line 16:
 
'''How to write a proof that <math>X\subseteq Y</math>''': In general, to show <math>X\subseteq Y</math> we wish to show that if <math>x\in X</math>, then <math>x\in Y</math>. This is done in the following format:
 
'''How to write a proof that <math>X\subseteq Y</math>''': In general, to show <math>X\subseteq Y</math> we wish to show that if <math>x\in X</math>, then <math>x\in Y</math>. This is done in the following format:
  
Let <math>x\in X</math>. ''(logical argument)'', thus <math>x\in Y</math>. This shows that <math>X\subseteq Y</math>.
+
'''Proof''' Let <math>x\in X</math>. ''(logical argument)'', thus <math>x\in Y</math>. This shows that <math>X\subseteq Y</math>.
 +
 
 +
=== Remark ===
  
 
The logical argument portion often begins by giving the definition of <math>x\in X</math> and ends with the definition of <math>x\in Y</math>.
 
The logical argument portion often begins by giving the definition of <math>x\in X</math> and ends with the definition of <math>x\in Y</math>.
Line 22: Line 24:
 
The following is a write-up of the solution of Example 1 as a formal proof:
 
The following is a write-up of the solution of Example 1 as a formal proof:
  
Let <math>x\in X</math>. That is, there exists some <math>k\in\mathbb{Z}</math> such that <math>x=6k</math>. We have <math>x=6k=2(3k)</math>. Since <math>3k\in\mathbb{Z}</math>, we also have that <math>x=2n</math> for an integer <math>n</math>, thus <math>x\in Y</math>. This shows that <math>X\subseteq Y</math>.
+
'''Proof''' Let <math>x\in X</math>. That is, there exists some <math>k\in\mathbb{Z}</math> such that <math>x=6k</math>. We have <math>x=6k=2(3k)</math>. Since <math>3k\in\mathbb{Z}</math>, we also have that <math>x=2n</math> for an integer <math>n</math>, thus <math>x\in Y</math>. This shows that <math>X\subseteq Y</math>.

Revision as of 12:36, 29 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 .

Writing Proofs

How to write a proof that : In general, to show we wish to show that if , then . This is done in the following format:

Proof Let . (logical argument), thus . This shows that .

Remark

The logical argument portion often begins by giving the definition of and ends with the definition of .

The following is a write-up of the solution of Example 1 as a formal proof:

Proof Let . That is, there exists some such that . We have . Since , we also have that for an integer , thus . This shows that .