next | next | up | down | Inhalt | Kommentar

all, section 4.7.

4.7.  Basic Set Operations

Definition 1.6 (Union)

The union of two sets A and B is denoted by: A ∪ B
and defined by the condition: for all x, x ∈ A ∪ B: x ∈ A or x ∈ B.

Equivalently, A ∪ B is given by: A ∪ B = { x | x ∈ A or x ∈ B }

Examples: numbers

→ Venn diagram

Definition 1.7 (Intersection)

The intersection of two sets A and B is denoted by: A ∩ B
and defined by the condition: for all x, x ∈ A ∩ B: x ∈ A and x ∈ B.

Equivalently, A ∩ B is given by: A ∩ B = { x | x ∈ A and x ∈ B }

Definition 1.8 (Disjoint)

Two sets that have no common members are called disjoint sets.

Examples: numbers


→ Venn diagram

Examples: functions

Definition 1.9 (Relative Complement)

The relative complement of two sets A and B is denoted by: A \ B
and defined by the condition: for all x, x ∈ A \ B: x ∈ A and x ∉ B.

Equivalently, A \ B is given by: A \ B = { x | x ∈ A and x ∉ B }

→ Venn diagram

Examples: numbers

Definition 1.10 (Complement)

Let A be a set. The complement of A, written ~A, is set set of all objects not belonging to A.

We write: ~A = { x | x ∉ A }

→ Venn diagram

Definition 1.11 (Powerset)

For any set S, the powerset of S is set Pow(S) defined by for all M, M ∈ Pow(S) if M ⊆ S

Equivalently, Pow(S) = { M | M ⊆ S }

Examples: numbers


back | next | up | down | Inhalt | Kommentar


Created by unroff & hp-tools. © by Hans-Peter Bischof. All Rights Reserved (1997).

Last modified 22/May/97