Understanding Mathematical Proof

The notion of proof is central to mathematics yet it is one of the most difficult aspects of the subject to teach and master. In particular, undergraduate mathematics students often experience difficulties in understanding and constructing proofs.Understanding Mathematical Proof describes the nature of mathematical proof, explores the various techn

The notion of proof is central to mathematics yet it is one of the most difficult aspects of the subject to teach and master. In particular, undergraduate mathematics students often experience difficulties in understanding and constructing proofs. Understanding Mathematical Proof describes the nature of mathematical proof, explores the various techniques that mathematicians adopt to prove their results, and offers advice and strategies for constructing proofs. It will improve students’ ability to understand proofs and construct correct proofs of their own. The first chapter of the text introduces the kind of reasoning that mathematicians use when writing their proofs and gives some example proofs to set the scene. The book then describes basic logic to enable an understanding of the structure of both individual mathematical statements and whole mathematical proofs. It also explains the notions of sets and functions and dissects several proofs with a view to exposing some of the underlying features common to most mathematical proofs. The remainder of the book delves further into different types of proof, including direct proof, proof using contrapositive, proof by contradiction, and mathematical induction. The authors also discuss existence and uniqueness proofs and the role of counter examples.

According to the great mathematician Paul Erdös, God maintains perfect mathematical proofs in The Book. This book presents the authors candidates for such "perfect proofs," those which contain brilliant ideas, clever connections, and wonderful observations, bringing new insight and surprising perspectives to problems from number theory, geometry, analysis, combinatorics, and graph theory. As a result, this book will be fun reading for anyone with an interest in mathematics.

In the four decades since Imre Lakatos declared mathematics a "quasi-empirical science," increasing attention has been paid to the process of proof and argumentation in the field -- a development paralleled by the rise of computer technology and the mounting interest in the logical underpinnings of mathematics. Explanantion and Proof in Mathematics assembles perspectives from mathematics education and from the philosophy and history of mathematics to strengthen mutual awareness and share recent findings and advances in their interrelated fields. With examples ranging from the geometrists of the 17th century and ancient Chinese algorithms to cognitive psychology and current educational practice, contributors explore the role of refutation in generating proofs, the varied links between experiment and deduction, the use of diagrammatic thinking in addition to pure logic, and the uses of proof in mathematics education (including a critique of "authoritative" versus "authoritarian" teaching styles). A sampling of the coverage: The conjoint origins of proof and theoretical physics in ancient Greece. Proof as bearers of mathematical knowledge. Bridging knowing and proving in mathematical reasoning. The role of mathematics in long-term cognitive development of reasoning. Proof as experiment in the work of Wittgenstein. Relationships between mathematical proof, problem-solving, and explanation. Explanation and Proof in Mathematics is certain to attract a wide range of readers, including mathematicians, mathematics education professionals, researchers, students, and philosophers and historians of mathematics.

This book is an introduction to the language and standard proof methods of mathematics. It is a bridge from the computational courses (such as calculus or differential equations) that students typically encounter in their first year of college to a more abstract outlook. It lays a foundation for more theoretical courses such as topology, analysis and abstract algebra. Although it may be more meaningful to the student who has had some calculus, there is really no prerequisite other than a measure of mathematical maturity.

This new edition of Daniel J. Velleman's successful textbook contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software.

"Proof" has been and remains one of the concepts which characterises mathematics. Covering basic propositional and predicate logic as well as discussing axiom systems and formal proofs, the book seeks to explain what mathematicians understand by proofs and how they are communicated. The authors explore the principle techniques of direct and indirect proof including induction, existence and uniqueness proofs, proof by contradiction, constructive and non-constructive proofs, etc. Many examples from analysis and modern algebra are included. The exceptionally clear style and presentation ensures that the book will be useful and enjoyable to those studying and interested in the notion of mathematical "proof."

An Introduction to Mathematical Proofs presents fundamental material on logic, proof methods, set theory, number theory, relations, functions, cardinality, and the real number system. The text uses a methodical, detailed, and highly structured approach to proof techniques and related topics. No prerequisites are needed beyond high-school algebra. New material is presented in small chunks that are easy for beginners to digest. The author offers a friendly style without sacrificing mathematical rigor. Ideas are developed through motivating examples, precise definitions, carefully stated theorems, clear proofs, and a continual review of preceding topics. Features Study aids including section summaries and over 1100 exercises Careful coverage of individual proof-writing skills Proof annotations and structural outlines clarify tricky steps in proofs Thorough treatment of multiple quantifiers and their role in proofs Unified explanation of recursive definitions and induction proofs, with applications to greatest common divisors and prime factorizations About the Author: Nicholas A. Loehr is an associate professor of mathematics at Virginia Technical University. He has taught at College of William and Mary, United States Naval Academy, and University of Pennsylvania. He has won many teaching awards at three different schools. He has published over 50 journal articles. He also authored three other books for CRC Press, including Combinatorics, Second Edition, and Advanced Linear Algebra.