Defining Sets, Schemes and Mind Maps of Calculus

The notation x ∈ X means that the object x is an element of the set X. The words collection and family are synonyms for set. In rigorous axiomatic developments ...

Typology: Schemes and Mind Maps

2022/2023

Uploaded on 03/01/2023

ehimay
ehimay 🇺🇸

4.8

(20)

268 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 134 Honors Calculus Fall 2016
Handout 4: Sets
All of mathematics uses set theory as an underlying foundation. Intuitively, a set is a collection of objects,
considered as a whole. The objects that make up the set are called its elements or its members. The
elements of a set may be any objects whatsoever, but for our purposes, they will usually be mathematical
objects such as numbers, functions, or other sets. The notation xXmeans that the object xis an element
of the set X. The words collection and family are synonyms for set.
In rigorous axiomatic developments of set theory, the words set and element are taken as primitive undefined
terms. (It would be very difficult to define the word “set” without using some word such as “collection,”
which is essentially a synonym for “set.”) Instead of giving a general mathematical definition of what it
means to be a set, or for an object to be an element of a set, mathematicians characterize each particular set
by giving a precise definition of what it means for an object to be a element of that set—this is called the set’s
membership criterion. The membership criterion for a set Xis a statement of the form xXP(x),”
where P(x) is some sentence that is true precisely for those objects xthat are elements of X, and no others.
For example, if Qis the set of all rational numbers, then the membership criterion for Qmight be expressed
as follows:
xQx=p/q for some integers pand qwith q6= 0.
The essential characteristic of sets is that two sets are equal if and only if they have the same elements. Thus
if Xand Yare sets, then X=Yif and only if every element of Xis an element of Y, and every element of
Yis an element of X. Symbolically,
X=Yif and only if x, x XxY.
If Xand Yare sets such that every element of Xis also an element of Y, then we say Xis a subset of Y,
written XY. Thus
XYif and only if x, x XxY.
The notation YX(“Yis a superset of X”) means the same as XY. Using the concept of subsets,
we can restate the criterion for two sets to be equal as follows:
X=Yif and only if XYand YX.
If XYbut X6=Y, we say that Xis a proper subset of Y(or Yis a proper superset of X). Some
authors use the notations XYand YXto mean that Xis a proper subset of Y; however, since
other authors use the symbol to mean any subset, not necessarily proper, we generally avoid using this
notation, and instead say explicitly when a subset is proper.
Defining Sets
We already know about the set Rof all real numbers, and its subset R+of all positive real numbers. Most
other sets we deal with will be built up from these in various ways. There are just a few ways to define new
sets. You will see that in each case, the set is completely determined by its membership criterion.
Defining a set by listing elements: Given any list of objects that can be explicitly named, the set
containing those objects and no others is denoted by listing the objects between braces: {c1, c2,...,cn}.
The membership criterion is easy to express:
a {c1, c2,...,cn} a=c1or a=c2or ... or a=cn.
For example, the set {0,1,2}contains the numbers 0, 1, and 2, and nothing else. Because a set is
completely determined by which elements it contains, it does not matter what order the elements are
listed in or whether they are repeated; the notations {0,1,2},{2,1,0}, and {0,0,1,2,1,1}all denote
the same set. A set containing exactly one element, such as {1}, is called a singleton. The set
containing no elements at all is called the empty set; it is usually denoted by , but it can also be
denoted by { }.
1
pf3

Partial preview of the text

Download Defining Sets and more Schemes and Mind Maps Calculus in PDF only on Docsity!

Math 134 Honors Calculus Fall 2016

Handout 4: Sets

All of mathematics uses set theory as an underlying foundation. Intuitively, a set is a collection of objects, considered as a whole. The objects that make up the set are called its elements or its members. The elements of a set may be any objects whatsoever, but for our purposes, they will usually be mathematical objects such as numbers, functions, or other sets. The notation x ∈ X means that the object x is an element of the set X. The words collection and family are synonyms for set.

In rigorous axiomatic developments of set theory, the words set and element are taken as primitive undefined terms. (It would be very difficult to define the word “set” without using some word such as “collection,” which is essentially a synonym for “set.”) Instead of giving a general mathematical definition of what it means to be a set, or for an object to be an element of a set, mathematicians characterize each particular set by giving a precise definition of what it means for an object to be a element of that set—this is called the set’s membership criterion. The membership criterion for a set X is a statement of the form “x ∈ X ⇔ P (x),” where P (x) is some sentence that is true precisely for those objects x that are elements of X, and no others. For example, if Q is the set of all rational numbers, then the membership criterion for Q might be expressed as follows: x ∈ Q ⇔ x = p/q for some integers p and q with q 6 = 0.

The essential characteristic of sets is that two sets are equal if and only if they have the same elements. Thus if X and Y are sets, then X = Y if and only if every element of X is an element of Y , and every element of Y is an element of X. Symbolically,

X = Y if and only if ∀x, x ∈ X ⇔ x ∈ Y.

If X and Y are sets such that every element of X is also an element of Y , then we say X is a subset of Y , written X ⊆ Y. Thus

X ⊆ Y if and only if ∀x, x ∈ X ⇒ x ∈ Y.

The notation Y ⊇ X (“Y is a superset of X”) means the same as X ⊆ Y. Using the concept of subsets, we can restate the criterion for two sets to be equal as follows:

X = Y if and only if X ⊆ Y and Y ⊆ X.

If X ⊆ Y but X 6 = Y , we say that X is a proper subset of Y (or Y is a proper superset of X). Some authors use the notations X ⊆ Y and Y ⊇ X to mean that X is a proper subset of Y ; however, since other authors use the symbol “⊆” to mean any subset, not necessarily proper, we generally avoid using this notation, and instead say explicitly when a subset is proper.

Defining Sets

We already know about the set R of all real numbers, and its subset R+^ of all positive real numbers. Most other sets we deal with will be built up from these in various ways. There are just a few ways to define new sets. You will see that in each case, the set is completely determined by its membership criterion.

  • Defining a set by listing elements: Given any list of objects that can be explicitly named, the set containing those objects and no others is denoted by listing the objects between braces: {c 1 , c 2 ,... , cn}. The membership criterion is easy to express:

a ∈ {c 1 , c 2 ,... , cn} ⇔ a = c 1 or a = c 2 or... or a = cn.

For example, the set { 0 , 1 , 2 } contains the numbers 0, 1, and 2, and nothing else. Because a set is completely determined by which elements it contains, it does not matter what order the elements are listed in or whether they are repeated; the notations { 0 , 1 , 2 }, { 2 , 1 , 0 }, and { 0 , 0 , 1 , 2 , 1 , 1 } all denote the same set. A set containing exactly one element, such as { 1 }, is called a singleton. The set containing no elements at all is called the empty set; it is usually denoted by ∅, but it can also be denoted by { }.

  • Defining a set by specification: Given a set D and an open sentence P (x) in which x represents an element of D, there is a set whose elements are precisely those x ∈ D for which P (x) is true. This set is denoted by either of the notations {x ∈ D : P (x)} or {x ∈ D | P (x)}. (This notation is often called set-builder notation.) Here is the membership criterion for this set:

a ∈ {x ∈ D : P (x)} ⇔ a ∈ D and P (a).

If the domain of x is understood, or is implicit in the condition P (x), the same set can be denoted by {x : P (x)}. For example, the set of all positive real numbers can be described by either of the following notations: {x ∈ R : x > 0 } or {x : x ∈ R and x > 0 }.

For some sets, there is a formula that represents a typical element of the set, as some variable or variables run through all elements of some predetermined domain. For example, the set of perfect squares can be described as the set of all numbers of the form n^2 as n runs through the integers. In this case, we often use the following variant of set-builder notation:

{n^2 : n ∈ Z}.

This is a shorthand notation for {x : x = n^2 for some n ∈ Z}.

  • Special Notations for Sets of Real Numbers And Integers For intervals in the real numbers, we have interval notations such as (a, b) and [0, ∞). There are eight types of intervals, defined on page 6 of the textbook. For integers, we typically use ellipses (... ) to designate ranges of integers. The Here are the definitions

Operations on Sets

There are three important operations that can be used to combine sets to obtain other sets.

  • Union: Given any sets X and Y , their union, denoted by X ∪ Y , is the set whose elements are all the objects that are elements of X or elements of Y (or both). The membership criterion is

x ∈ X ∪ Y if and only if x ∈ X or x ∈ Y.

Unions of more than two sets are defined similarly:

x ∈ X 1 ∪ · · · ∪ Xn if and only if x ∈ X 1 or... or x ∈ Xn.

  • Intersection: Given sets X and Y , their intersection, denoted by X ∩ Y , is the set whose elements are all the objects that are elements of both X and Y ; thus

x ∈ X ∩ Y if and only if x ∈ X and x ∈ Y.

Just as for unions, we can define intersections of more than two sets:

x ∈ X 1 ∩ · · · ∩ Xn if and only if x ∈ X 1 and... and x ∈ Xn.

Given two sets X and Y , we say that X and Y intersect if X ∩ Y 6 = ∅, meaning that they have at least one element in common. We say that X and Y are disjoint if X ∩ Y = ∅ (i.e., if they do not intersect), meaning that they have no elements in common. To say that more than two sets are disjoint means that each pair of sets are disjoint; in other words, there is no element that lies in more than one of the sets.

  • Set difference: If X and Y are sets, their difference, denoted by X r Y , is the set of all elements in X that are not in Y :

x ∈ X r Y if and only if x ∈ X and x /∈ Y.