Mathematical Proofs: A Transition to Advanced Mathematics, 4th edition

Published by Pearson (October 27, 2017) © 2018

  • Gary Chartrand Western Michigan University
  • Albert D. Polimeni SUNY, College at Fredonia
  • Ping Zhang Western Michigan University

eTextbook

per month

  • Anytime, anywhere learning with the Pearson+ app
  • Easy-to-use search, navigation and notebook
  • Simpler studying with flashcards
from$127.99

  • Hardcover, paperback or looseleaf edition
  • Affordable rental option for select titles
  • Free shipping on looseleafs and traditional textbooks

For courses in Transition to Advanced Mathematics or Introduction to Proof.


Meticulously crafted, student-friendly text that helps build mathematical maturity

Mathematical Proofs: A Transition to Advanced Mathematics, 4th Edition introduces students to proof techniques, analyzing proofs, and writing proofs of their own that are not only mathematically correct but clearly written. Written in a student-friendly manner, it provides a solid introduction to such topics as relations, functions, and cardinalities of sets, as well as optional excursions into fields such as number theory, combinatorics, and calculus. The exercises receive consistent praise from users for their thoughtfulness and creativity.  They help students progress from understanding and analyzing proofs and techniques to producing well-constructed proofs independently. This book is also an excellent reference for students to use in future courses when writing or reading proofs.

Students learn to construct proofs of their own that are not only mathematically correct but clearly written.

  • Proof Strategies features precede proofs and encourage students to plan what is needed to present a proof of the result in question.

  • Proof Analysis features appear after presentations of proofs and discuss key details considered for the creation of the proof.

  • Communicating Mathematics (Chapter 0) provides a valuable reference for students as the course progresses. This chapter prepares students to write effective and clear exposition by emphasising the correct usage of mathematical symbols, mathematical expressions, and key mathematical terminology.

  • NEW! A Reviewing Proof Techniques chapter (Chapter 7) has been added to summarise all proof techniques presented to that point. This chapter provides many examples to solidify the understanding of these techniques, emphasising both how and when to use the techniques.

  • NEW! Presentation slides now accompany every chapter. These presentations provide examples and exposition on key topics. Students and instructors can access the presentations (as PDFs or LaTeX files) via short URLs that appear in the text at the end of each chapter.

  • Exercises for each section at the end of a chapter (Section Exercises) and additional exercises for the entire chapter (Chapter Supplemental Exercises).

    • Over 1000 exercises are available.

    • EXPANDED! More than 100 exercises, examples, and results have been added. Many of the new exercises are in the moderately challenging category.

    • Difficulty ranges from routine to medium to challenging

    • True/False exercises present statements and ask students to determine whether they are correct, asking for justification as part of the process.

    • Proposed proofs of statements ask students if an argument is valid.

    • Proofs without a statement ask students to supply a statement of what has been proved.

    • Exercises that call upon students to form conclusions of their own and possibly to provide proofs of these conclusions.

  • More than 100 exercises, examples, and results have been added, with many of the new exercises created to be moderately challenging.

  • Presentation slides now accompany every chapter. These presentations provide examples and exposition on key topics. Students and instructors can access the presentations (as PDFs or LaTeX files) via short URLs that appear in the text at the end of each chapter.


Content updates:

  • Chapter 7, Reviewing Proof Techniques, has been added to summarize all proof techniques presented to that point. This chapter provides many examples to solidify the understanding of these techniques, emphasizing both how and when to use the techniques.

  • Chapter 13, Proofs in Combinatorics, was added in response to user feedback. The new chapter presents results and examples for this important area of discrete mathematics. Numerous exercises are also included.

  • Online Chapter 18, Proofs with Real and Complex Numbers, covers these two classes of numbers—with many important classical results on real numbers as well as important results from complex variables. In each case, detailed proofs are given.

0. Communicating Mathematics

0.1 Learning Mathematics

0.2 What Others Have Said About Writing

0.3 Mathematical Writing

0.4 Using Symbols

0.5 Writing Mathematical Expressions

0.6 Common Words and Phrases in Mathematics

0.7 Some Closing Comments About Writing

1. Sets

1.1. Describing a Set

1.2. Subsets

1.3. Set Operations

1.4. Indexed Collections of Sets

1.5. Partitions of Sets

1.6. Cartesian Products of Sets

Chapter 1 Supplemental Exercises

2. Logic

2.1. Statements

2.2. The Negation of a Statement

2.3. The Disjunction and Conjunction of Statements

2.4. The Implication

2.5. More On Implications

2.6. The Biconditional

2.7. Tautologies and Contradictions

2.8. Logical Equivalence

2.9. Some Fundamental Properties of Logical Equivalence

2.10. Quantified Statements

2.11. Characterizations of Statements

Chapter 2 Supplemental Exercises

3. Direct Proof and Proof by Contrapositive

3.1. Trivial and Vacuous Proofs

3.2. Direct Proofs

3.3. Proof by Contrapositive

3.4. Proof by Cases

3.5. Proof Evaluations

Chapter 3 Supplemental Exercises

4. More on Direct Proof and Proof by Contrapositive

4.1. Proofs Involving Divisibility of Integers

4.2. Proofs Involving Congruence of Integers

4.3. Proofs Involving Real Numbers

4.4. Proofs Involving Sets

4.5. Fundamental Properties of Set Operations

4.6. Proofs Involving Cartesian Products of Sets

Chapter 4 Supplemental Exercises

5. Existence and Proof by Contradiction

5.1. Counterexamples

5.2. Proof by Contradiction

5.3. A Review of Three Proof Techniques

5.4. Existence Proofs

5.5. Disproving Existence Statements

Chapter 5 Supplemental Exercises

6. Mathematical Induction

6.1 The Principle of Mathematical Induction

6.2 A More General Principle of Mathematical Induction

6.3 Proof By Minimum Counterexample

6.4 The Strong Principle of Mathematical Induction

Chapter 6 Supplemental Exercises

7. Reviewing Proof Techniques

7.1 Reviewing Direct Proof and Proof by Contrapositive

7.2 Reviewing Proof by Contradiction and Existence Proofs

7.3 Reviewing Induction Proofs

7.4 Reviewing Evaluations of Proposed Proofs

Chapter 7 Supplemental Exercises

8. Prove or Disprove

8.1 Conjectures in Mathematics

8.2 Revisiting Quantified Statements

8.3 Testing Statements

Chapter 8 Supplemental Exercises

9. Equivalence Relations

9.1 Relations

9.2 Properties of Relations

9.3 Equivalence Relations

9.4 Properties of Equivalence Classes

9.5 Congruence Modulo n

9.6 The Integers Modulo n

Chapter 9 Supplemental Exercises

10. Functions

10.1 The Definition of Function

10.2 The Set of All Functions From A to B

10.3 One-to-one and Onto Functions

10.4 Bijective Functions

10.5 Composition of Functions

10.6 Inverse Functions

10.7 Permutations

Chapter 10 Supplemental Exercises

11. Cardinalities of Sets

11.1 Numerically Equivalent Sets

11.2 Denumerable Sets

11.3 Uncountable Sets

11.4 Comparing Cardinalities of Sets

11.5 The Schröder - Bernstein Theorem

Chapter 11 Supplemental Exercises

12. Proofs in Number Theory

12.1 Divisibility Properties of Integers

12.2 The Division Algorithm

12.3 Greatest Common Divisors

12.4 The Euclidean Algorithm

12.5 Relatively Prime Integers

12.6 The Fundamental Theorem of Arithmetic

12.7 Concepts Involving Sums of Divisors

Chapter 12 Supplemental Exercises

13. Proofs in Combinatorics

13.1 The Multiplication and Addition Principles

13.2 The Principle of Inclusion-Exclusion

13.3 The Pigeonhole Principle

13.4 Permutations and Combinations

13.5 The Pascal Triangle

13.6 The Binomial Theorem

13.7 Permutations and Combinations with Repetition

Chapter 13 Supplemental Exercises

14. Proofs in Calculus

14.1 Limits of Sequences

14.2 Infinite Series

14.3 Limits of Functions

14.4 Fundamental Properties of Limits of Functions

14.5 Continuity

14.6 Differentiability

Chapter 14 Supplemental Exercises

15. Proofs in Group Theory

15.1 Binary Operations

15.2 Groups

15.3 Permutation Groups

15.4 Fundamental Properties of Groups

15.5 Subgroups

15.6 Isomorphic Groups

Chapter 15 Supplemental Exercises

16. Proofs in Ring Theory (Online)

16.1 Rings

16.2 Elementary Properties of Rings

16.3 Subrings

16.4 Integral Domains

16.5 Fields

Chapter 16 Supplemental Exercises

17. Proofs in Linear Algebra (Online)

17.1 Properties of Vectors in 3-Space

17.2 Vector Spaces

17.3 Matrices

17.4 Some Properties of Vector Spaces

17.5 Subspaces

17.6 Spans of Vectors

17.7 Linear Dependence and Independence

17.8 Linear Transformations

17.9 Properties of Linear Transformations

Chapter 17 Supplemental Exercises

18. Proofs with Real and Complex Numbers (Online)

18.1 The Real Numbers as an Ordered Field

18.2 The Real Numbers and the Completeness Axiom

18.3 Open and Closed Sets of Real Numbers

18.4 Compact Sets of Real Numbers

18.5 Complex Numbers

18.6 De Moivre's Theorem and Euler's Formula

Chapter 18 Supplemental Exercises

19. Proofs in Topology (Online)

19.1 Metric Spaces

19.2 Open Sets in Metric Spaces

19.3 Continuity in Metric Spaces

19.4 Topological Spaces

19.5 Continuity in Topological Spaces

Chapter 19 Supplemental Exercises

Answers and Hints to Odd-Numbered Section Exercises

References

Index of Symbols

Index


Gary Chartrand is Professor Emeritus of Mathematics at Western Michigan University. He received his Ph.D. in mathematics from Michigan State University. His research is in the area of graph theory. Professor Chartrand has authored or co-authored more than 275 research papers and a number of textbooks in discrete mathematics and graph theory as well as the textbook on mathematical proofs. He has given over 100 lectures at regional, national and international conferences and has been a co-director of many conferences. He has supervised 22 doctoral students and numerous undergraduate research projects and has taught a wide range of subjects in undergraduate and graduate mathematics. He is the recipient of the University Distinguished Faculty Scholar Award and the Alumni Association Teaching Award from Western Michigan University and the Distinguished Faculty Award from the State of Michigan. He was the first managing editor of the Journal of Graph Theory. He is a member of the Institute of Combinatorics and Its Applications, the American Mathematical Society, the Mathematical Association of America and the editorial boards of the Journal of Graph Theory and Discrete Mathematics.

Albert D. Polimeni is an Emeritus Professor of Mathematics at the State University of New York at Fredonia. He received his Ph.D. degree in mathematics from Michigan State University. During his tenure at Fredonia he taught a full range of undergraduate courses in mathematics and graduate mathematics. In addition to the textbook on mathematical proofs, he co-authored a textbook in discrete mathematics. His research interests are in the area of finite group theory and graph theory, having published several papers in both areas. He has given addresses in mathematics to regional, national and international conferences. He served as chairperson of the Department of Mathematics for nine years.


Ping Zhang is Professor of Mathematics at Western Michigan University. She received her Ph.D. in mathematics from Michigan State University. Her research is in the area of graph theory and algebraic combinatorics. Professor Zhang has authored or co-authored more than 200 research papers and four textbooks in discrete mathematics and graph theory as well as the textbook on mathematical proofs. She serves as an editor for a series of books on special topics in mathematics. She has supervised 7 doctoral students and has taught a wide variety of undergraduate and graduate mathematics courses including courses on introduction to research. She has given over 60 lectures at regional, national and international conferences. She is a council member of the Institute of Combinatorics and Its Applications and a member of the American Mathematical Society and the Association of Women in Mathematics.

Need help? Get in touch

Pearson+

All in one place. Pearson+ offers instant access to eTextbooks, videos and study tools in one intuitive interface. Students choose how they learn best with enhanced search, audio and flashcards. The Pearson+ app lets them read where life takes them, no wi-fi needed. Students can access Pearson+ through a subscription or their MyLab or Mastering course.

Video
Play
Privacy and cookies
By watching, you agree Pearson can share your viewership data for marketing and analytics for one year, revocable by deleting your cookies.

Pearson eTextbook: What’s on the inside just might surprise you

They say you can’t judge a book by its cover. It’s the same with your students. Meet each one right where they are with an engaging, interactive, personalized learning experience that goes beyond the textbook to fit any schedule, any budget, and any lifestyle.