06.09.2021 Views

Mathematical Reasoning- Writing and Proof, Version 2.1, 2014a

Mathematical Reasoning- Writing and Proof, Version 2.1, 2014a

Mathematical Reasoning- Writing and Proof, Version 2.1, 2014a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Preface<br />

xiii<br />

students with a thorough underst<strong>and</strong>ing of conditional statements, quantifiers, <strong>and</strong><br />

logical equivalencies. Emphasis is placed on writing correct <strong>and</strong> useful negations<br />

of statements, especially those involving quantifiers. The logical equivalencies that<br />

are presented provide the logical basis for some of the st<strong>and</strong>ard proof techniques,<br />

such as proof by contrapositive, proof by contradiction, <strong>and</strong> proof using cases.<br />

The st<strong>and</strong>ard methods for mathematical proofs are discussed in detail in Chapter<br />

3. The mathematical content that is introduced to illustrate these proof methods<br />

includes some elementary number theory, including congruence arithmetic. These<br />

concepts are used consistently throughout the text as a way to demonstrate ideas in<br />

direct proof, proof by contrapositive, proof by contradiction, proof using cases, <strong>and</strong><br />

proofs using mathematical induction. This gives students a strong introduction to<br />

important mathematical ideas while providing the instructor a consistent reference<br />

point <strong>and</strong> an example of how mathematical notation can greatly simplify a concept.<br />

The three sections of Chapter 4 are devoted to proofs using mathematical induction.<br />

Again, the emphasis is not only on underst<strong>and</strong>ing mathematical induction<br />

but also on developing the ability to construct <strong>and</strong> write proofs that use mathematical<br />

induction.<br />

The last five chapters are considered “mathematical content” chapters. Concepts<br />

of set theory are introduced in Chapter 5, <strong>and</strong> the methods of proof studied<br />

in Chapter 3 are used to prove results about sets <strong>and</strong> operations on sets. The idea<br />

of an “element-chasing proof” is also introduced in Section 5.2.<br />

Chapter 6 provides a thorough study of functions. Functions are studied before<br />

relations in order to begin with the more specific notion with which students<br />

have some familiarity <strong>and</strong> move toward the more general notion of a relation. The<br />

concept of a function is reviewed but with attention paid to being precise with<br />

terminology <strong>and</strong> is then extended to the general definition of a function. Various<br />

proof techniques are employed in the study of injections, surjections, composition<br />

of functions, inverses of functions, <strong>and</strong> functions acting on sets.<br />

Chapter 7 introduces the concepts of relations <strong>and</strong> equivalence relations. Section<br />

7.4 is included to provide a link between the concept of an equivalence relation<br />

<strong>and</strong> the number theory that has been discussed throughout the text.<br />

Chapter 8 continues the study of number theory. The highlights include problems<br />

dealing with greatest common divisors, prime numbers, the Fundamental<br />

Theorem of Arithmetic, <strong>and</strong> linear Diophantine equations.<br />

Finally, Chapter 9 deals with further topics in set theory, focusing on cardinality,<br />

finite sets, countable sets, <strong>and</strong> uncountable sets.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!