A Transition to Proof : An Introduction to Advanced Mathematics

Title:

Personal Author:

Nicholson, Neil R., author

Series:

Textbooks in Mathematics

Physical Description:

xiii, 450 pages : illustrations , 24 cm.

ISBN:

9780367201579

Subject Term:

Proof theory

Available:*

Library	Item Barcode	Call Number	Material Type	Item Category 1	Status
Searching... PSZ JB	30000010369589	QA9.54 N54 2019	Open Access Book	Book	Searching... Unknown

A Transition to Proof: An Introduction to Advanced Mathematicsdescribes writing proofs as a creative process. There is a lot that goes into creating a mathematical proof before writing it. Ample discussion of how to figure out the "nuts and bolts'" of the proof takes place: thought processes, scratch work and ways to attack problems. Readers will learn not just how to write mathematics but also how to do mathematics. They will then learn to communicate mathematics effectively.

The text emphasizes the creativity, intuition, and correct mathematical exposition as it prepares students for courses beyond the calculus sequence. The author urges readers to work to define their mathematical voices. This is done with style tips and strict "mathematical do's and don'ts", which are presented in eye-catching "text-boxes" throughout the text. The end result enables readers to fully understand the fundamentals of proof.

Features:

The text is aimed at transition courses preparing students to take analysis Promotes creativity, intuition, and accuracy in exposition The language of proof is established in the first two chapters, which cover logic and set theory Includes chapters on cardinality and introductory topology P>

Features:

Author Notes

Dr. Neil R. Nicholson is Associate Professor of Mathematics at North Central College. He holds a PhD in Mathematics from The University of Iowa, specializing in knot theory. His research interests have consistently been topics accessible to undergraduates; collaborating with them on original research is a fundamental goal of his professional development. In 2015, he earned the Clarence F. Dissinger Award for Junior Faculty Teaching at North Central College. He serves as the Faculty Athletic Representative to the NCAA for North Central College.

Preface	p. ix
1 Symbolic Logic	p. 1
1.1 Statements and Statement Forms	p. 2
1.2 Conditional and Biconditional Connective	p. 16
1.3 Arguments	p. 28
1.4 Logical Deductions	p. 37
2 Sets	p. 49
2.1 Set Theory Basics	p. 50
2.2 Properties of Sets	p. 63
2.3 Quantified Statements	p. 78
2.4 Multiple Quantifiers and Arguments with Quantifiers	p. 88
3 Introduction to Proofs	p. 103
3.1 What is Proof?	p. 105
3.2 Direct Proofs	p. 120
3.3 Direct Proofs: Set Element Method	p. 135
3.4 Proof by Contrapositive and Contradiction	p. 147
3.5 Proof by Cases	p. 159
4 Mathematical Induction	p. 171
4.1 Basics of Mathematical Induction	p. 172
4.2 Strong Mathematical Induction	p. 187
4.3 Applications of Induction: Number Theory	p. 203
5 Relations	p. 221
5.1 Mathematical Relations	p. 222
5.2 Equivalence Relations	p. 237
5.3 Order Relations	p. 250
5.4 Congruence Modulo in Relation	p. 262
8 Functions	p. 279
6.1 Functions Defined	p. 280
6.2 Properties of Functions	p. 298
6.3 Composition and Invertibility	p. 313
7 Cardinality	p. 327
7.1 The Finite	p. 328
7.2 The Infinite: Countable	p. 345
7.3 The Infinite: Uncountable	p. 358
8 Introduction to Topology	p. 371
8.1 Topologies and Topological Spaces	p. 372
8.2 Subspace and Product Topologies	p. 380
8.3 Closed Sets and Closure	p. 388
8.4 Continuous Functions	p. 398
Appendix A Properties of Real Number System	p. 409
Appendix B Proof Writing Tips	p. 413
Appendix C Selected Solutions and Hints	p. 421
Bibliography	p. 441
Index	p. 445

Available:*

On Order

Summary

Summary

Author Notes

Table of Contents