Chapter 0 Flashcards
the union of a collection of sets {Bα : α ∈ Λ}
U {Bα : α ∈ Λ} = UB. There exists an α that is a member of Bα
the intersection of a collection of sets {Bα : α ∈ Λ}
The intersection of {Bα : α ∈ Λ}. There is a member of Bα for all α
DeMorgan’s Laws 1. Let U be a set, let {Bα : α ∈ Λ} be a collection of sets. The complement of the union is the
intersection of the complement
DeMorgan’s Laws 2. Let U be a set, let {Bα : α ∈ Λ} be a collection of sets. The complement of the intersection is the
union of the complement
Let A and B be sets, and let f : A → B. Let S ⊆ B. The inverse image of a set S ⊆ B under the function f : A → B is f-1[S]=
{a ∈ A: there exists b ∈ S st f(a)=b}
Let A and B be sets, and let f : A → B. Let T ⊆ A. The image of a set T ⊆ A under the function f : A → B is f[T]=
{f(t): t ∈ T}
totally ordered set
Let A be a set. We say that A is a ______ if there is a relation ≤ on A that satisfies the following properties:
- For all a ∈ A, a ≤ a.
- If a, b ∈ A, then either a ≤ b or b ≤ a.
- If a, b ∈ A with a ≤ b and b ≤ a then a = b.
- If a, b, c ∈ A with a ≤ b and b ≤ c, then a ≤ c.
Let A be a non-empty set. Any function s : N → A is called a _____ in A
sequence (sn)
Let (sn) be a sequence in a totally ordered set A.
1. (sn) is a sequence of distinct terms if si
does not = sj whenever i does not = j.
Let (ni) be a strictly increasing sequence of natural numbers. Then,
Then i ≤ ni for all i ∈ N.
Let A be a set. Let (sn) be a sequence in A. If (ni) is a strictly increasing sequence in N, then the sequence
sn1, sn2, sn3, . . .is a _________. We denote this by (sni).
subsequence of (sn)
There are three pieces of information in the notation (sni)
- sni is an element of A and gives the value of the term
- ni is a natural number and indicates the position of the term in the original sequence
- i is also a natural number and indicates the position of the term in the subsequence.
Complement of B in U
Let B⊆U. {x∈U: x/∈ B}
U\B
Theorem 0.2.7 about properties of an inverse. Let A and B be sets. Let f: A → B. TFAE
- f is injective and onto (bijective)
- There exists a function f-1: B→A st it has the properties of an inverse
(a) The composition of f inverse and f(x) is x
(b) the composition of f and f inverse(x) is x
Theorem 0.2.12 about families of subsets and inverses. Let A and B be sets and f: A → B be a function. Let {Sα : α ∈ Λ} be a family of subsets of B. Then 1. The inverse image of the union of Sα is equal to
the union of the pre-image of the Sα.