3 6 introduction to sets-optional
Transcript of 3 6 introduction to sets-optional
![Page 1: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/1.jpg)
Introduction to Sets (Optional)
Frank Ma © 2011
![Page 2: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/2.jpg)
![Page 3: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/3.jpg)
A set is a backpack which may or may not contains any items. Introduction to Sets
![Page 4: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/4.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets.
Introduction to Sets
![Page 5: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/5.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Introduction to Sets
![Page 6: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/6.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Note that we use “{ }” to symbolize the backpack and also that a set may contain infinitely many items.
Introduction to Sets
![Page 7: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/7.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Note that we use “{ }” to symbolize the backpack and also that a set may contain infinitely many items. Each item of a set is called an element of that set.
Introduction to Sets
![Page 8: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/8.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Note that we use “{ }” to symbolize the backpack and also that a set may contain infinitely many items. Each item of a set is called an element of that set. We write x ϵ S if x is an element the set S.
Introduction to Sets
![Page 9: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/9.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Note that we use “{ }” to symbolize the backpack and also that a set may contain infinitely many items. Each item of a set is called an element of that set. We write x ϵ S if x is an element the set S. Hence from the above sets we’ve that
Introduction to Sets
my car–keyϵ B
![Page 10: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/10.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Note that we use “{ }” to symbolize the backpack and also that a set may contain infinitely many items. Each item of a set is called an element of that set. We write x ϵ S if x is an element the set S. Hence from the above sets we’ve that
Introduction to Sets
my car–keyϵ B my car–keyϵ C
![Page 11: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/11.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Note that we use “{ }” to symbolize the backpack and also that a set may contain infinitely many items. Each item of a set is called an element of that set. We write x ϵ S if x is an element the set S. Hence from the above sets we’ve that
Introduction to Sets
my car–keyϵ B my car–keyϵ C my car–keyϵ A
![Page 12: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/12.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Note that we use “{ }” to symbolize the backpack and also that a set may contain infinitely many items. Each item of a set is called an element of that set. We write x ϵ S if x is an element the set S. Hence from the above sets we’ve that
Introduction to Sets
my car–keyϵ B my car–keyϵ C my car–keyϵ A
Note that C is not an element of B because C is just anotherbackpack whose content part (or all) of B’s content.
![Page 13: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/13.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Note that we use “{ }” to symbolize the backpack and also that a set may contain infinitely many items. Each item of a set is called an element of that set. We write x ϵ S if x is an element the set S. Hence from the above sets we’ve that
Introduction to Sets
my car–keyϵ B my car–keyϵ C my car–keyϵ A
Note that C is not an element of B because C is just anotherbackpack whose content part (or all) of B’s content. In generalT is a subset of S if every element of T is also an element of S and we write this as T S.
![Page 14: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/14.jpg)
A set is a backpack which may or may not contains any items. We use capital letters as names of sets. For example, A = { } ≡ Ф (phi) – which is the empty setB = {wallet, my car–key, math–book} C = {my car–key}D = {1, 2, 3, ….} = {all positive integer}
Note that we use “{ }” to symbolize the backpack and also that a set may contain infinitely many items. Each item of a set is called an element of that set. We write x ϵ S if x is an element the set S. Hence from the above sets we’ve that
Introduction to Sets
my car–keyϵ B my car–keyϵ C my car–keyϵ A
Note that C is not an element of B because C is just anotherbackpack whose content part (or all) of B’s content. In generalT is a subset of S if every element of T is also an element of S and we write this as T S. So we’ve C but C B.ϵ B
![Page 15: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/15.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa.
Introduction to Sets
![Page 16: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/16.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.
Introduction to Sets
![Page 17: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/17.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
![Page 18: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/18.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
![Page 19: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/19.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
Example A. Graph the following sets.a. A = {all the x where –2 < x ≤ 6}
![Page 20: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/20.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
Example A. Graph the following sets.a. A = {all the x where –2 < x ≤ 6}
x–2 6
![Page 21: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/21.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
Example A. Graph the following sets.a. A = {all the x where –2 < x ≤ 6}
x–2 6
b. B = {all the x where | x | ≤ 4}
![Page 22: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/22.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
Example A. Graph the following sets.a. A = {all the x where –2 < x ≤ 6}
x–2 6
b. B = {all the x where | x | ≤ 4}
This is the same as { x where –4 ≤ x ≤ 4}
![Page 23: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/23.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
Example A. Graph the following sets.a. A = {all the x where –2 < x ≤ 6}
x–2 6
b. B = {all the x where | x | ≤ 4}
x–4 4
This is the same as { x where –4 ≤ x ≤ 4}
![Page 24: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/24.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
Example A. Graph the following sets.a. A = {all the x where –2 < x ≤ 6}
x–2 6
b. B = {all the x where | x | ≤ 4}
x–4 4
This is the same as { x where –4 ≤ x ≤ 4}
Intersection and Union
![Page 25: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/25.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
Example A. Graph the following sets.a. A = {all the x where –2 < x ≤ 6}
x–2 6
b. B = {all the x where | x | ≤ 4}
x–4 4
This is the same as { x where –4 ≤ x ≤ 4}
Intersection and UnionLet S and T be two sets, S T, read as S intersects T, is the set of common elements of S and T.
![Page 26: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/26.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
Example A. Graph the following sets.a. A = {all the x where –2 < x ≤ 6}
x–2 6
b. B = {all the x where | x | ≤ 4}
x–4 4
This is the same as { x where –4 ≤ x ≤ 4}
Intersection and UnionLet S and T be two sets, S T, read as S intersects T, is the set of common elements of S and T. Hence {a, b} {b, c} = {b}.
![Page 27: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/27.jpg)
Two sets S and T are the same if they have exactly the same content, that is, every element in S is also an element of T and vice versa. Hence if S = {a, b} and that T = {b ,a} then S = T.Note that the order of the elements is not important.
Introduction to Sets
Some sets of numbers may be represented graphically.
Example A. Graph the following sets.a. A = {all the x where –2 < x ≤ 6}
x–2 6
b. B = {all the x where | x | ≤ 4}
x–4 4
This is the same as { x where –4 ≤ x ≤ 4}
Intersection and UnionLet S and T be two sets, S T, read as S intersects T, is the set of common elements of S and T. Hence {a, b} {b, c} = {b}.Note that the intersection is a set, not just the element “b”.
![Page 28: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/28.jpg)
Introduction to SetsLet S and T be two sets, S U T , read as S unions T, is the merge–set of the two sets.
![Page 29: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/29.jpg)
Introduction to SetsLet S and T be two sets, S U T , read as S unions T, is the merge–set of the two sets. For the union operation, duplicated items is only counted once.
![Page 30: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/30.jpg)
Introduction to SetsLet S and T be two sets, S U T , read as S unions T, is the merge–set of the two sets. For the union operation, duplicated items is only counted once. Hence {a, b} U {b, c} = {a, b, c}.
![Page 31: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/31.jpg)
Introduction to Sets
Example B. Find and draw A B and A U B given that
A = {all the x where –2 < x ≤ 6}B = {all the x where | x | ≤ 4}
Let S and T be two sets, S U T , read as S unions T, is the merge–set of the two sets. For the union operation, duplicated items is only counted once. Hence {a, b} U {b, c} = {a, b, c}.
![Page 32: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/32.jpg)
Introduction to Sets
Example B. Find and draw A B and A U B given that
A = {all the x where –2 < x ≤ 6}
x–2 6
B = {all the x where | x | ≤ 4}
x–4 4
Let S and T be two sets, S U T , read as S unions T, is the merge–set of the two sets. For the union operation, duplicated items is only counted once. Hence {a, b} U {b, c} = {a, b, c}.
A
B
We have graphically
![Page 33: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/33.jpg)
Introduction to Sets
Example B. Find and draw A B and A U B given that
A = {all the x where –2 < x ≤ 6}
x–2 6
B = {all the x where | x | ≤ 4}
x–4 4
Let S and T be two sets, S U T , read as S unions T, is the merge–set of the two sets. For the union operation, duplicated items is only counted once. Hence {a, b} U {b, c} = {a, b, c}.
A
B
We have graphically
A B is the common or overlapped segment of A with B.–2 4
A B
![Page 34: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/34.jpg)
Introduction to Sets
Example B. Find and draw A B and A U B given that
A = {all the x where –2 < x ≤ 6}
x–2 6
B = {all the x where | x | ≤ 4}
x–4 4
Let S and T be two sets, S U T , read as S unions T, is the merge–set of the two sets. For the union operation, duplicated items is only counted once. Hence {a, b} U {b, c} = {a, b, c}.
A
B
We have graphically
A B is the common or overlapped segment of A with B. A = { B = {–2 < x ≤ 4}
–2 4
A B
![Page 35: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/35.jpg)
Introduction to Sets
x–2 6
x–4 4
A
B
Given that
![Page 36: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/36.jpg)
Introduction to Sets
x–2 6
x–4 4
A
B
A U B consists both portions of either color
Given that
![Page 37: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/37.jpg)
Introduction to Sets
x–2 6
x–4 4
A
B
A U B consists both portions of either color = {–4 < x ≤ 6}.6–4
A U B
Given that
![Page 38: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/38.jpg)
Introduction to Sets
x–2 6
x–4 4
A
B
A U B consists both portions of either color = {–4 < x ≤ 6}.6–4
A U B
Given that
Let’s extend this to the x&y coordinate system.
![Page 39: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/39.jpg)
Introduction to Sets
x–2 6
x–4 4
A
B
A U B consists both portions of either color = {–4 < x ≤ 6}.6–4
A U B
Given that
Let’s extend this to the x&y coordinate system. The basic 2D regions are half–planes and strips.
![Page 40: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/40.jpg)
Introduction to Sets
x–2 6
x–4 4
A
B
A U B consists both portions of either color = {–4 < x ≤ 6}.6–4
A U B
Given that
Let’s extend this to the x&y coordinate system. The basic 2D regions are half–planes and strips.
Example. C. Shade the following sets in the rectangular system. a. A = {(x, y) where x > 0}
![Page 41: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/41.jpg)
Introduction to Sets
x–2 6
x–4 4
A
B
A U B consists both portions of either color = {–4 < x ≤ 6}.6–4
A U B
Given that
Let’s extend this to the x&y coordinate system. The basic 2D regions are half–planes and strips.
Example. C. Shade the following sets in the rectangular system. a. A = {(x, y) where x > 0}Note that there is no mention of y means that y may take on any value.
![Page 42: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/42.jpg)
Introduction to Sets
x–2 6
x–4 4
A
B
A U B consists both portions of either color = {–4 < x ≤ 6}.6–4
A U B
Given that
Let’s extend this to the x&y coordinate system. The basic 2D regions are half–planes and strips.
{(x, y) where x > 0}
Example. C. Shade the following sets in the rectangular system. a. A = {(x, y) where x > 0}Note that there is no mention of y means that y may take on any value.
![Page 43: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/43.jpg)
Introduction to Sets
x–2 6
x–4 4
A
B
A U B consists both portions of either color = {–4 < x ≤ 6}.6–4
A U B
Given that
Let’s extend this to the x&y coordinate system. The basic 2D regions are half–planes and strips.
{(x, y) where x > 0}
Example. C. Shade the following sets in the rectangular system. a. A = {(x, y) where x > 0}Note that there is no mention of y means that y may take on any value. The open region is called a half–plane and the dash–line means exclusion.
![Page 44: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/44.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
![Page 45: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/45.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
![Page 46: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/46.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
![Page 47: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/47.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
The open region we obtained is called a strip.
![Page 48: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/48.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
The open region we obtained is called a strip. Note that the solid represent inclusion.
![Page 49: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/49.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
The open region we obtained is called a strip. Note that the solid represent inclusion.
c. Let C = {(x, y) where –3 < x < 3 and 0 < y ≤ 4} draw B C.
![Page 50: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/50.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
The open region we obtained is called a strip. Note that the solid represent inclusion.
c. Let C = {(x, y) where –3 < x < 3 and 0 < y ≤ 4} draw B C. This is the overlap of two strips.
![Page 51: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/51.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
The open region we obtained is called a strip. Note that the solid represent inclusion.
c. Let C = {(x, y) where –3 < x < 3 and 0 < y ≤ 4} draw B C. This is the overlap of two strips.B is the same as the above.
B
![Page 52: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/52.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
The open region we obtained is called a strip. Note that the solid represent inclusion.
c. Let C = {(x, y) where –3 < x < 3 and 0 < y ≤ 4} draw B C. This is the overlap of two strips.B is the same as the above.
BC is the vertical strip where–3 < x < 3.
C
![Page 53: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/53.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
The open region we obtained is called a strip. Note that the solid represent inclusion.
c. Let C = {(x, y) where –3 < x < 3 and 0 < y ≤ 4} draw B C. This is the overlap of two strips.B is the same as the above.
BC is the vertical strip where–3 < x < 3. The overlap is the rectangular region. B C
C
![Page 54: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/54.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
The open region we obtained is called a strip. Note that the solid represent inclusion.
c. Let C = {(x, y) where –3 < x < 3 and 0 < y ≤ 4} draw B C. This is the overlap of two strips.B is the same as the above.C is the vertical strip where–3 < x < 3. The overlap is the rectangular region. Note that all the cornersare excluded.
B
B C
C
![Page 55: 3 6 introduction to sets-optional](https://reader036.fdocuments.net/reader036/viewer/2022062514/5591f4a71a28ab6d0b8b458e/html5/thumbnails/55.jpg)
Introduction to Setsb. B = {(x, y) where 0 < y ≤ 4}
There is no restriction on x so x may take on any value.
{(x, y) where 0 < y ≤ 4}
The open region we obtained is called a strip. Note that the solid represent inclusion.
c. Let C = {(x, y) where –3 < x < 3 and 0 < y ≤ 4} draw B C. This is the overlap of two strips.B is the same as the above.C is the vertical strip where–3 < x < 3. The overlap is the rectangular region. Note that all the cornersare excluded. You Do: Label the corners.
B
C
B C