










Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Notes; Class: Mathematical Structures; Subject: Mathematics; University: Arizona State University - Tempe; Term: Unknown 1989;
Typology: Study notes
1 / 18
This page cannot be seen from the preview
Don't miss anything!











Definition 1Sets
A set is an unordered collection of objects.
Definition 2
Objects in a set are called elements or members
Definition 3of the set. A set is said to contain its elements.
Two sets are equal if they contain the same ele-
Definition 4ments.
The set
is a subset of
if and only if every
element of
is also an element of
We will denote this by
Russell’s Paradox
Let
If
then by definition of
If
then by definition of
Operations on Sets
Union:
Let
be sets. Then
B = { x | x ∈ A
x
∈
B
} .
Intersection:
Let
be sets. Then
A ∩ B = { x | x ∈ A
x
∈
Difference:
Let
be sets. Then
A \ B = { x | x ∈ A ∧ x 6
Complement:
Let
be the universal set.
The complement
of the set
Theorem 5Commutative laws
For any sets
Theorem 6Distributive laws
For any sets
Theorem 7De Morgan laws
For any subsets
of a universal set
Theorem 8The complementation and self-inverse laws
For any subset
of a universal set
Theorem 9
For any subsets
A
B
C
D
If
is a family of sets then
⋃
a |∃
F (^) ∈F
(^) a
∈
F (^) } ,
⋂
a |∀
F (^) ∈F
(^) a
∈
F (^) } .
Theorem 10
Let
{ A i | i ∈ I }
be an indexed family of sets.
For
every
i 0 ∈ I , A i 0 ⊆
i∈ ⋃
I A
i , i∈ ⋂
I A i ⊆ A i 0.
Theorem 11
Let
i | i ∈
I }
be an indexed family of sets and let
be a set.
B ∪ A i ) ,
B ∪ A i ) ,
B ∩ A i ) ,
B ∩ A i ) ,
i ′
i ′
, a
{ x ∈ R | x ≤ a }
a,
(^) ∞
x
∈
R
| a < x
a,
(^) ∞
{ x ∈ R | a ≤ x }
Absolute value
For any real number
a , | a | = √ a 2.
For any real numbers
a, b
a
· (^) b | =
a | · |
b | .
Triangle Inequality:
For any real numbers
a, b,
a
b | ≤ |
a | + | b |.
f (^) ( x ) | ≤
if and only if
f (^) ( x )
and
f (^) ( x ) ≤
f (^) (
x
) | ≥
if and only if
f (^) (
x
)
or
f (^) (
x
)
≤ −