Download Notes on Notation and more Exercises Mathematics in PDF only on Docsity!
Notes on Notation
Dylan Zwick
Summer, 2009
These notes address some common forms of mathematical notation that you’re likely to see in this and future math classes, but you may not have seen before. I won’t guarantee that these notes are exhaustive or free from typos, but I hope they help.
1 Set Theory
The basic object in mathematics is a set. A set is, loosely speaking, a col- lection of elements, and these elements can be “anything”. I say anything in quotation marks because there are some caveats you have to worry about, but we don’t need to discuss them here. For information about these caveats, look up Russel’s paradox. As an example of a set let’s say that A is the set of positive even num- bers less than 10. We’d write:
A = { 2 , 4 , 6 , 8 }.
This indicates that A is the set consisting of the four elements 2 , 4 , 6 , 8. You can express a set by listing off its elements in parentheses. You can also use ellipsis if the number of elements in your set is large, and it’s obvious what you mean. For example, if B is the set of positive even numbers less than 100000 we could write:
B = { 2 , 4 , 6 , 8 ,... , 99996 , 99998 }.
Now, sets can also consist of an infinite number of elements, and we can represent this with a ellipsis at the end or the beginning (or both) of our enumeration of the elements. So, if C is the set of all positive even numbers we would write:
C = { 2 , 4 , 6 ,.. .}.
1.1 Set Relations
Now, with sets there are two main relations. One is a relation between a set and an element, and the other is a relation between a set and another set.
The relation between a set and an element is represented by ∈, and can be loosely translated as the word “in”. So, for example, a ∈ A would mean that the element a is a member of the set A. In our set A constructed above, we could write 4 ∈ A to indicate 4 is one of the elements in A. If we want to indicate an element is not in a set, we use the symbol ∈ /, which can be loosely translated as the words “not in”. So if we write b /∈ A, this means the element b is not in the set A. In our set A constructed above, we could write 5 ∈/ A to indicate 5 is not one of the elements in A.
The important relation between sets and other sets is the relation of inclusion. This relation is used to indicate if a set contains all the elements in another one. The symbol used for this relation is ⊂. So, for example, if we write A ⊂ B this would imply that every element in A is also in B. This would be true for our sets A and B constructed above. We would say that A is a “subset” of the set B. This notation can also go the other way, and we could write B ⊃ A, which just means the same thing, namely that A is a subset of B. It’s kind of like being able to write both < and > when we’re talking about inequality relations. We don’t always have to make sure the smaller number, for example, is on the left. We could write 3 < 5 or 5 > 3. Both convey the same information. Now, usually the symbol ⊂ means that A is strictly contained in B. That means every element in A is in B, but not every element in B is in A. If we wanted to leave open the possibility that the two sets could be equal (could consist of exactly the same elements) we’d write A ⊆ B. This
U ∩ V = { 2 , 3 }.
The intersection of U and V would be the set consisting of just the ele- ments 2 and 3.
Finally, the difference between two sets, say U − V , would be the set consisting of all the elements in U, except those that are also in V. So, for our example we’d have:
U − V = { 1 }.
The difference would be the set consisting of only the element 1. Now unlike union and intersection the difference operation is not symmetric, and U − V is not necessarily the same as V − U. In our example we’d have:
V − U = { 4 , 6 }.
This is clearly not the same as U − V.
1.3 Special Sets
There are some sets that come up so often we give them their own special symbols. One of these is the integers, to which we give the symbol Z. The Z is for “zahlen”, the German word for “numbers”. The font is called “blackboard bold”, and it’s used for most of these number sets. So,
Z = {... , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 ,.. .}.
If we want to represent the non-negative integers we’d use the symbol Z+. So,
Z+^ = { 0 , 1 , 2 , 3 ,.. .}.
If we want to represent just the positive integers we’d use the symbol P. So,
P = { 1 , 2 , 3 ,.. .}.
Note that this symbol is not used very often, and its meaning is not as universal as the other symbols mentioned here.
Finally, as you might imagine, the symbol for the nonpositive integers is Z−. I’m unaware of any symbol for the strictly negative integers, but you could write them as Z−^ − { 0 }.
Now, a rational number is a number that can be written as one integer divided by another. The set of rational numbers is represented as Q. The use of the letter Q is because it’s a “ q uotient” of two integers. The set of nonnegative rational numbers is represented as Q+, and the set of nonpos- itive rational numbers is represented as Q−. So, using the notation we’ve learned so far we’d say:
r ∈ Q means that r =
a b
with a, b ∈ Z.
The set of real numbers is represented by R, while the set of nonneg- ative real numbers is represented by R+, and the set of nonpositive real numbers is represented by R−. I’ll let you figure out why the letter R is used for r eal numbers. The set of complex numbers is represented by C. For complex numbers the idea of positive and negative doesn’t make as much sense, and so we wouldn’t write C+, for example, as it’s unclear what that would mean.
Finally, it’s important to note that we can talk about the set consisting of no elements. This is called the empty set , and it’s denoted by the symbol ∅. In our earlier example we said that we’d call F the set of all even inte- gers, and G the set of all odd integers. In this case we’d write:
F ∩ G = ∅.
There are no integers that are both odd and even, and so the intersec- tion of F and G would be empty.
proof is complete. In many modern math textbooks the end of a proof is marked with a square:. The symbol is sometimes called a “tombstone” or a “halmos”. The “halmos” terminology comes from the mathematician Paul Halmos, who first started using it to mark the end or proofs.
So, for example, we could write: Theorem - The number of prime numbers is infinite. PROOF - Suppose the number of prime numbers is finite, and enu- merate them as p 1 , p 2 ,... , pn. Construct a number n by multiplying all the prime numbers together and adding one:
n = p 1 p 2... pn + 1.
This number n cannot be a prime number, as it must be larger than all the prime numbers. So n must be composite, and it’s therefore divisible by a prime. Call such a prime pk. The first term in the definition of n would be divisible by pk by construction, but the second term would be 1 /pk, which is not an integer and must be less than 1. So, n/pk could not be an integer, and therfore n is not divisible by pk. This is a contradiction, and so our initial assumption, that there are a finite number of primes, must be false.
