2.1 The Algebraic and Order Properties of R >>

For brevity, we implicitly let for all sections in this page

  • : Element
  • : Set

Basic set notations

NotationMeaning
is in ;
is a member of ;
belongs to
not in ;
;
Every element of also belongs to ;
is a subset of
;
contains some element of , but not all of ;
is a proper subset of

1.1.1 Definition: Set equality

Definition

Let : Set

If contains the same elements

Then

  • We say and are equal
  • We write

Thus, to prove that the sets and are equal, we must show that and .

1.1.3 Definition: Set union, intersection, complement

Definition

We say the set is the union of and

Let . : Infinite collection of sets. Their union is the set of elements that belong to at least one of the sets :

Definition

We say the set is the intersection of and

Let . : Infinite collection of sets. Their union is the set of elements that belong to all of these sets : $ \bigcap_{n=1}^\infty A_{n} := { x:x \subset A_{n} } $$

Definition

If $ A - B:={ x:x \in A\text{ and } x \not \in B } $$

Then we say set is the complement of relative to

Remark

It is also often denoted by .

Or simply:

  • Union: All elements existing in , but not existing in
  • Intersection: All elements existing in either or
  • Complement: All elements existing in both and at the same time

Definition: Empty set

Definition: Disjoint sets

1.1.4 Theorem

See also