Chapter 1 Flashcards
(39 cards)
Set
A collection of some items
Ordering does not matter
Notion: A = {1, 2}
Subset
Set A is a subset of set B if every element of A is also an element of B. We write A⊂B, where “⊂” indicates “subset.”
Superset
B is a superset of A, or B ⊃ A, if every element of A is also in B
Universal set
the set of all things that we could possibly consider in the context
we are studying. (denoted by S)
Venn diagram
any set is depicted by a closed region, its drawn like a circle where the elements of A are within the circle of A and if elements are in both A and B the circles overlap
Union
a set containing all elements that are in A or in B
{1,2} ∪ {2,3} = {1,2,3}
Intersection
denoted by A ∩ B, consists of all elements thatare both in A and B
{1,2} ∩ {2,3} = {2}
Complement
The complement of a set A, denoted by Ac or
¯
A, is the set of all elements that are in the universal set S but are not in A
difference (subtraction)
The set A − B consists of elements that are in A but not in B
if A = {1,2,3} and B = {3,5}, then A−B={1,2}
A −B = A ∩ Bc
mutually exclusive or disjoint
Two sets A and B are mutually exclusive or disjoint if they do not have any shared elements; i.e., their intersection is the empty set,
A ∩ B = ∅.
More generally, several
sets are called disjoint if they are pairwise disjoint, i.e., no two of them share a common elements
Partition
a collection of nonempty sets A1,A2,⋯ is a partition of a set A if they are disjoint and their union is
A
De Morgan’s law
(keep in mind the c is the complement)
For any sets A1, A2, ⋯ ,An, we have:
(A1 ∪ A2 ∪ A3 ∪ ⋯ An)c =Ac1 ∩ Ac2 ∩ Ac3 ⋯ ∩ Acn
(A1 ∩A2 ∩A3 ∩⋯An)c =Ac1 ∪ Ac2 ∪ Ac3 ⋯ ∪ Acn
Distributive law
For any sets A, B, and C we have
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
cartesian product
A Cartesian product of two sets A and B, written as A × B, is the set containing ordered pairs from A and B. That is, if C = A ×B, then each element of C is of the form (x,y) , where x ∈ A and y ∈ B:
A×B={(x,y)|x ∈ A and y ∈ B}.
For example, if A = {1,2,3} and B = {H,T}, then A×B={(1,H),(1,T),(2,H),(2,T),(3,H),(3,T)}.
Note that here the pairs are ordered, so for example, (1,H) ≠ (H,1). Thus A × B is not the same as
B ×A
multiplication principle
If you have two finite sets A and B, where A has M elements and B has N elements, then A ×B has M ×N elements.
cardinality
the size of a set
The cardinality of a set is denoted by |A|
In a finite set the cardinality is how many elements it contains
inclusion-exclusion principle (also counts for probability)
- |A ∪ B| = |A|+|B|−|A∩B|,
- |A ∪ B∪C| =|A|+|B|+|C| −|A∩B|−|A∩C|−|B∩C|+|A∩B∩C|
countable vs uncountable set (2 types of infinite set)
you can list the elements of a countable set A, i.e., you can write
A = {a1,a2,⋯}, but you cannot list the elements in an uncountable
set.
definition countable (and uncountable)
Set A is called countable if one of the following is true:
a. if it is a finite set, ∣A∣<∞ ; or
b. it can be put in one-to-one correspondence with natural numbers N, in which case the set is said to be countably infinite.
A set is called uncountable if it is not countable.
guidelines to remember is a set is countable or uncountable
- N,Z,Q, and any of their subsets are countable.
- Any set containing an interval on the real line such as [a,b],(a,b],[a,b), or (a,b), where a<b is uncountable.
- Any subset of a countable set is countable.
- Any superset of an uncountable set is uncountable.
- If A1,A2,… is a list of countable sets, then the set UiAi = A1∪A2∪A3… is also countable
- if A and B are countable, then A x B is also countable
domain and co-domain in functions
A function f is a rule that takes an input from a specific set, called the domain, and produces an output from another set, called co-domain. Thus, a function maps elements from the domain set to elements in the co-domain with the property that each input is mapped to exactly one output.
If A is the domain and B is the co-domain for the function f, we use the following notation:
f : A→B.
range
the set containing all the possible values of f(x). Thus, the range of a function is always a subset of its co-domain.
random experiment
a process by which we observe
something uncertain (you do not know what the result is gonna be)
outcome
a result of a random experiment