Subsets

From Grad Wiki
Jump to navigation Jump to search

Definition

An example of a set and its subset

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 Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle x=6k} for some integer . Now we wish to show that Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle x=6k} 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 Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle 2n} for some integer Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle n} . This can be seen by writing Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle x=6k=2(3k)=2n} and declaring Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle 3k=n} .

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 Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle x=6k} . We have Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle x=6k=2(3k)} . Since Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle 3k\in \mathbb {Z} } , we also have that Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle x=2n} for an integer Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle n} , thus . This shows that .