Chapter 1 SETS Flashcards

1
Q

Set

A

Set – A set is a collection of objects

Example: J = {2,4,1,3,7}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Order Set

A

Order Set – A ordered set is a collection objects in an order

Example: J = {1,2,3,4,5}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Elements

A

Elements – The objects that make up a set are called its elements

  • If a is an element of a set A, then we write a ∈ A
  • If a is not an element of a set A, then we write a ∈/ A

Ex.1 The set S = {1, 2, 3, 4, 5} has 5 elements. Also it can be written as S = {2, 3, 4, 5, 1}. (Note that the order in which the elements are listed does not matter.)

Ex 2 The set of all positive even integers less than 10 is S = {2, 4, 6, 8}. In this case, 2 is an element of S, or 2 ∈ S. Also 3 ∈/ S

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Empty Set

A

Empty Set - The set which contains no elements is called the empty set and denoted by ∅.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Cardinality

A

Cardinality - The number of elements of a set S is called cardinality of S and denoted by |S|.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Finite(in terms of sets)

A

Finite - A set S is finite if |S| = n for some nonnegative integer n.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Infinite(in terms of sets)

A

Infinite - A Set S is infinite if it is not finite and denoted by |S| = ∞.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Subset

A

Subset - A Set A is called a subset of B if every element of A also belongs to B. In this case, we write A ⊆ B.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Universal Set

A

Universal Set - In a typical discussion of sets, we are ordinarily concerned with subsets of some specific set U, called the universal set.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Equal (in terms of sets)

A

Equal (in terms of sets) - Two Sets A and B are said to be equal if they have exactly the same elements. In this case, we write A = B. In other words, A = B if and only if A ⊆ B and B ⊆ A.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Proper Subset

A

Proper Subset- If A is a subset of B but A does not quals B, then A is a proper is a proper subset of B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Proposition of Subsets

A

Proposition of Subsets

Let A, B, and C be sets.

(1) A ⊆ A
(2) If A ⊆ B and B ⊆ C, then A ⊆ C.
(3) ∅ ⊆ A.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Power Set

A

Power Set - the set of all subsets of a set A is called a power set of A and denoted by P(A) where A is the set.

the cardinailty of the power set is the number of 2 ^ number of elements in the set A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Intersection

A

Intersection - The intersection of A and B, denoted by A ∩ B, is the set of all elements belonging to both A and B.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Disjoint

A

Disjoint - Two Sets A and B are said to be disjoint if A ∩ B = ∅

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Union

A

Union - The union of two sets A and B, denoted by A ∪ B, is the set of all elements belong to A or B.

17
Q

Difference

A

Difference - Let A and B be sets. The difference of two sets A and B is

A − B = {x | x ∈ A and x ∈/ B}.

It is also written as A \ B.

18
Q

Complement

A

Complement- Let U be the universal set that is all sets being discussed are subsets of U.For set A, the difference of U - A is called the complement of A and denoted A(over line on top)

19
Q

Pairwise Disjoint

A

Pairwise Disjoint- A Collection S of subsets of a set A is called pairwise disjoint if every two distinct subsets that belong to S are disjoint.

Example: Let A = {1, 2, 3, 4, 5, 6} and S the collection of nonempty subsets of A:

S = {{1, 3, 6}, {2, 4}, {5}}

20
Q

Partition

A

Partition - Let A be a set. A partition of A is a collection S of nonempty pairwise disjoint subsets of A whose union is A.

21
Q

Cartesian product

A

Cartesian product - Let A and B be sets. The Cartesian product A × B is the set of all ordered pairs

A × B = {(a, b) | a ∈ A, and b ∈ B}.

22
Q

Union & Interception of Sets

A
23
Q

Index Sets & Index Collection of Sets

A