Discrete Mathematics and its Applications (8th Edition)
2021/03/31 - Set Operations
2 Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
2.2
2.2.1 Introduction
Union ( ∪ \cup ∪)
Intersection ( ∩ \cap ∩)
Note if the intersection is empty, then A A A and B B B are said to be disjoint.
Complement
Difference ( − - −)
It is also known as the complement of B B B with respect to A A A.
Cardinality of the Union of Two Sets
∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ |A\cup B|=|A|+|B|-|A\cap B| ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣
Symmetric Difference ( ⊕ \oplus ⊕)
A ⊕ B = ( A − B ) ∪ ( B − A ) A\oplus B=(A-B)\cup(B-A) A⊕B=(A−B)∪(B−A) If A ⊕ B = A ⊕ C , then B = C . \text{If }A\oplus B=A\oplus C\text{, then }B=C. If A⊕B=A⊕C, then B=C.
2.2.2 Set Identities
2.2.3 Generalized Unions and Intersections
2.3 Functions
Give a function
f
:
A
→
B
f:A\rightarrow B
f:A→B,
A
A
A is called the domain of
f
f
f.
B
B
B is called the codomain of
f
f
f.
If
f
(
a
)
=
b
f(a)=b
f(a)=b,
then
b
b
b is called the image of a under
f
f
f,
a
a
a is called the preimage of
b
b
b.
range
equal: codomain should also be the same!
Assignment
Section 2.2
3, 21, 41, 51
ALL RIGHTS RESERVED © 2021 Teddy van Jerry
This blog is licensed under the CC 4.0 Licence.
See also
Teddy van Jerry’s CSDN Homepage
Teddy van Jerry’s GitHub Homepage