View source for Mathematical Proof/Introduction/Notation

<noinclude>{{Mathematical Proof/navigation}}</noinclude>

While a comprehensive list of notation is included in the appendix, that is meant mostly as a reference tool to refresh the reader of what notation means.  This section is to introduce the notation to the reader and explain its usage.

== Basic Set Theory ==
This is not meant to be a comprehensive or rigorous definition of set theory.  We will define a minimal amount of set-theoretical objects, so that the concept of mathematical thinking can be understood. In this book, we will use capital letters for sets and lowercase letters for elements of sets.  This convention is not to discourage creativity or to bore your socks off, but to avoid confusion.

=== Axioms ===
An ''axiom'' is something that is assumed, or believed to be true.  It is where mathematical proof starts; you cannot ''prove'' the axioms, you merely believe them and use them to prove other things.  There are different sets of axioms, the most current and widely-used being [[w:Zermelo–Fraenkel set theory|Zermelo–Fraenkel set theory]].  I will give a list of axioms here that will suffice for the studies in this book.

#A set exists.  (A ''set'', for our purposes, will be a collection of objects that we will call ''elements''.  A set is said to ''contain'' its elements, and the elements are said to ''be contained in'' the set.)
#An empty set exists. This set will be denoted as <math>\varnothing</math> and will contain no elements.
#Two sets are equal if and only if they contain the same elements.
#If <math>A</math> and <math>B</math> are sets, then there is a set containing only the elements of <math>A</math> and <math>B</math>.  This is called the ''union'' of <math>A</math> and <math>B</math>.
#If <math>A</math> is a set and <math>P(x)</math> is a truth statement defined for all <math>x</math> contained in <math>A</math>, then there is a set <math>B</math> so that <math>x</math> is in <math>B</math> whenever <math>P(x)</math> is true.
#The set of counting numbers <math>(1,2,3,\dots)</math> exists; or, an infinite set exists.

Some of these are worded rather formally, which is a tendency for mathematicians.  First of all, let's explain why we need these axioms.

The first axiom says "a set exists."  So you might ask&mdash;don't we know that it exists?  Can't we just define it to exist?  The answer is, yes, and that's why it's an axiom.  Axioms are supposed to be self-evident truths.  Now that we've established the fact that sets exist, why would we want one with no elements?  Well, the empty set turns out to be both a very useful and a very annoying set.  You'll learn to be good friends with the empty set by the end of the text.

Axiom 3 could be considered a definition, rather than an axiom, of what we mean when we say that two sets are equal.  Axiom 4 just says that if we have two sets then we can get a new set with all of those elements in it.  For example, the set of all people and all dogs.

The fifth axiom is probably the most confusing.  All it says is that if we have a set and we want to pick out certain elements, we can do that.  For example, out of the set of all integers, we can choose the ones that are even, or the ones that are positive, or the ones that are [[w:perfect square|perfect square]]s.  

Finally, the infinity axiom is nice because we will do lots of things with infinite sets.

=== Definitions ===
As mentioned above, a ''set'' will be a collection of ''elements''.  For example, let <math>A</math> be the set of all cheesecakes, and let <math>B</math> be the set of all things that are chocolate.  Mathematically, this would be denoted as:
 <math>A = \{x|x \mbox{ is a cheesecake}\}</math>
 <math>B = \{x|x\mbox{ is chocolate}\}</math>

The vertical bar | is read "such that". We can select elements in that way by using [[#axiom5|Axiom 5]] from above. In the case of <math>A</math>, the predicate (truth statement) <math>P(x)</math> used to select elements is:
 <math>P(x)\ :\ x \mbox{ is a cheesecake}</math>

Note that we have implicitly assumed the existence of a ''universal set'' of all elements over which we are making a selection. In the example above, this universal set could be the set of all pastries. In general, if a universal set is not specified, we shall assume that we are talking about the real numbers <math>\mathbb{R}</math>. Thus, <math>C = \{x | x > 2\}</math> can be read as: "<math>C</math> is the set of all real numbers strictly greater than <math>2</math>."

To say that <math>x</math> is an element of <math>A</math> is equivalent to saying that <math>A</math> contains <math>x</math>.  These concepts are notated mathematically by <math>x\in A</math> (x belongs to the set A) and <math>A\ni x</math>.  If <math>x</math> is not a member of <math>A</math> then we write <math>x\notin A</math> (x does not belong to the set A).

The ''union'' of <math>A</math> and <math>B</math> is defined in axiom 4.  It consists of all the elements in <math>A</math> and <math>B</math> and is denoted <math>A\cup B</math>.  We can also use the | to say
 <math>A\cup B = \{x|x\in A \mbox{ or } x\in B\}=\{x|x \mbox{ is a cheesecake or is chocolate}\}</math>

The ''intersection'' of <math>A</math> and <math>B</math> is the set containing all things that are in ''both'' <math>A</math> and <math>B</math>.  The notation for this is <math>A\cap B</math>.  
 <math>A\cap B = \{x|x\in A \mbox{ and }x\in B\}=\{x|x\mbox{ is a chocolate cheesecake}\}</math>

If <math>A\cap B = \varnothing</math> then <math>A</math> and <math>B</math> are said to be ''disjoint''.  This means that there is nothing that is in both sets.  For example, if <math>A</math> is the set of all even integers and <math>B</math> is the set of all odd integers, then they are disjoint.  

Notice that the logical connectors <math>\lor,\land</math> coincide with the set operators <math>\cup, \cap</math>.  This is deliberate, since the concepts are related.  This is obvious when the two symbols are juxtaposed:
 <math>A\cup B = \{x|(x\in A) \lor (x\in B)\}</math>
 <math>A\cap B = \{x|(x\in A) \land (x\in B)\}</math>

== Quantifiers ==
Quantifiers are used to establish what elements are currently being discussed.  They are like adjectives in English&mdash;they tell ''how much'' or ''what kind'' of thing we're talking about.

=== For All ===
The most common quantifier is ''for all''.  This is written mathematically as <math>\forall</math>.  It is also "for each" or "for every."  It is used to make statements like "All humans have eyeballs."  That is, if <math>H</math> is the set of all humans and <math>E</math> is the set of all things with eyeballs, then
 <math>\forall x\in H, x\in E</math>
which is read "For all <math>x</math> in <math>H</math>, <math>x</math> is in <math>E</math>."  This introduces a special relationship between sets that is called a ''[[w:subset|subset]]''.  In this case, <math>H</math> is a subset of <math>E</math> since every element of <math>H</math> is also in <math>E</math>.  (For the sake of the logical argument, just assume there aren't any people without eyeballs.)  We write this as
 <math>H\subset E.</math> 
This notation, <math>A\subset B</math>, is ambiguous because some authors use it to mean just a subset, while others use it to mean a ''proper'' subset (meaning there is an element of <math>B</math> that is not in <math>A</math>, and thus <math>A</math> and <math>B</math> are not equal) and use <math>A\subseteq B</math> to denote that <math>A</math> is a subset of <math>B</math>.  In this book we will go with the convention that <math>A\subset B</math> could mean that <math>A</math> is a proper subset of <math>B</math> or that <math>A</math> = <math>B</math>, and we will use <math>A\subsetneq B</math> when we wish to emphasize that <math> A\ne B</math>.

=== There Exists ===
This is probably as common as ''for all'' and is equally useful.  Its mathematical symbol is <math>\exists</math>.  It is almost always followed by a "such that" statement.  For example, "There exists a computer that has 8GB of RAM."  <math>\forall</math> and <math>\exists</math> are often used in pairs, such as, "Everyone has a mother.", or, worded logically, "For each human, there exists a mother for that human.".  Let ''H'' be the set of all humans and ''M'' be the set of all mothers.  Then we have
 <math>\forall h \in H, \exists m \in M \mbox{ such that }m\mbox{ is the mother of }h. </math>
 
 or, when <math>H</math> and <math>M</math> are understood,
 
 <math>\forall h, \exists m \mbox{ such that }m\mbox{ is the mother of }h.</math>

This quantifier is also read as ''there is'' or ''there are''.  To signify that there is only one of something, we say "There exists a unique..." and place an exclamation point after the ''exists'' symbol: <math>\exists !</math>.

In the same way that "not and" gives "or", "not ''for all''" gives "there exists."  That is, the opposite of the statement "All cheesecakes are chocolate." is "There is a cheesecake that is ''not'' chocolate."  In logical terms,
 <math>\lnot (\forall x\in A, P(x))\mbox{ is equivalent to }\exists x\in A : \lnot P(x).</math>

The above statement is read "the negation of 'For all ''x'' in ''A'', ''P(x)'' is true.' is 'There is an ''x'' in ''A'' such that ''P(x)'' is false."

=== Such That ===
As we have seen, ''such that'' can be used in at least two cases: in conjunction with ''there exists'' and in picking out elements of a set.  Of course, if you think about it, these two are really the same application because the statement "there exists" gives you the set of all things that exist, and the ''such that'' statement decreases the size of that set to focus just on the things in which you are interested.  ''Such that'' is normally denoted as a colon(:) or as a vertical bar (|), and sometimes as "s.t."

=== [https://en.wikipedia.org/wiki/Without_loss_of_generality Without Loss of Generality] ===
This is a very helpful phrase in making proofs more concise and less redundant.  For example, assume we have two integers ''x'' and ''y'' and that we know one of them is odd and one of them is even.  Instead of trying to do two different parallel proofs, one where we assume that ''x'' is even and ''y'' is odd and another where we assume that ''y'' is even and ''x'' is odd, we simply say "Without loss of generality, assume ''x'' is even."  Then we continue with the proof.  This is done since the exact same argument applies if ''y'' actually was the even number, all we have to do is relabel ''x'' and ''y''.

== [https://en.wikipedia.org/wiki/Universe_(mathematics) The Universe] ==
Now, we're not going to begin a discussion of astronomy.  In mathematics, the ''universe'' is overall, the biggest set that your discussion is referring to.  For example, if the universe is not restricted, then the set of all things would truly be the set containing every single thing.  However, if your universe is the set of all things on Earth, then the "set of all things" would not include Jupiter, since Jupiter is not on Earth.  

=== Difference ===
In arithmetic, ''difference'' means the distance between two numbers&mdash;how far apart they are on the number line.  In set theory, ''difference'' means something slightly different, but the same notation is used.  (<math>A-B</math> denotes the difference of ''A'' and ''B''.)  The difference is the set of all things that are in ''A'' that are not in ''B''.
 <math>A-B = \{x\in A|x\notin B\}=\{x|x\in A\land x\notin B\}</math>
In normal English, we use this concept when we say things like "Everyone with no demerits gets an A in this course."

=== Complement ===
[[Image:Venn Diagram.png|thumb|right|A Venn Diagram of A, B, and U.]]
The [[w:Complement (set theory)|complement]] of a set contains everything that is not in the original set.  This definition only makes sense when a universe is understood.  The complement is usually denoted by <math>A^c</math>.  If ''U'' is the universe, then the complement of ''A'' is defined to be <math> A^c = U - A</math>.

The diagram to the right is a [[w:Venn diagram|Venn diagram]].  A Venn diagram shows the relationships of sets.  Note that in the figure, ''U'' is the universe, and ''A'' and ''B'' are sets in ''U''.  The blue portion is the complement of <math>A\cup B</math>.  This is a general drawing, since it is not known whether there are elements in ''A'' and ''B''.  If <math>A\cap B</math> is known to be empty, then they may be drawn disjoint.  

The complement of a set is essentially the same as the negation of a statement.  That is,
 if <math> A = \{x|P(x)\}</math>, then 
 <math>A^c = \{x|\lnot P(x)\}</math>.  
Thus, complements are used when saying what something is ''not''.

== Exercises ==
#Express the following statements in terms of sets, using difference or complement.
##All people that have two legs.
##All mythological creatures that are not Greek.
##All pudding pies that have no cream on top.
#Draw a Venn Diagram to illustrate the following.
##<math>A\cap B\cap C</math>
##<math>A\cup B - C</math>
##<math>(A^c\cap B^c)\cup C</math>
##<math>A\cap(B\cup C)</math>
##<math>A- (U-B)</math>
#Negate the following statements.
##<math>\forall x\in A, \exists y\in B: P(x,y)</math>
##All quick, brown foxes jump over some lazy dog.

<noinclude>{{Mathematical Proof/next|Mathematical Proof/Methods of Proof}}</noinclude>

{{BookCat}}