Scribd Logo
Upload

Welcome to Scribd!

  • Proofs and Fundamentals (1ed) - Ethan D. Bloch PDF

    Uploaded by

    Andres Torres
    1K views444 pages

    Original Title

    Proofs and fundamentals (1Ed) - Ethan D. Bloch.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    1K views444 pages

    Proofs and Fundamentals (1ed) - Ethan D. Bloch PDF

    Uploaded by

    Andres Torres

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 444
    Ethan D. Bloch Proofs and Fundamentals A First Course in Abstract Mathematics Birkhéuser Boston * Basel * Berlin Ethan D. Bloch Department of Mathematics and Computer Science (949.54 BST Bard College Deer LDRARY “Annandale-on-Hudson, NY 12504 ca ‘Profs an fundamental; aes iA anzotensst 311089 Library of Congress Cataloging-in-Publication Data Bloch, Ethan D, 1856+ Proofs and fundamentals fst couse In abstact mathematics / Ethan D, Bloch. pcm. Includes bibliographical references and indexes. ISBN 08176-4111-4 (lk paper) ISBN 3-7643-4111-4 (atk. paper) 1. roof theory. 2 Set heory. 1 Tile (0A9.54.857 2000, siis-eeat 0.023309 ce PREECE EEE eee eee ‘Math Subject Clasificatlons 2000: Primary O0A35; Secondary 00-01, Printed on acid-free paper at 12000 Biss Beton irknduser IB “Allright reserved, This work may notte translated or copied in whole orin part without the writen armbxionof he poblster (aikhiser Boston, cf Springer-Verlag New Yotk Inc 17S FiRh Avenue, Rigi vos NY 100t0, USA), excep forbrieFexcertsinconnection withreviewsor schelaiy analysis ‘ari connection with any form of information storage and retrieval, electronic adaptation, computer ‘Software, or by sia o similar methodotogy now known or hereafter developed is forbade, Fa uss ot gener descriptive names, tiade names, uademarks, et, inthis publication, even if the {omer ate aot especially ienlfied nt be ken assign that uch names, es understood by he ‘Trade Marks and Merchancise Macks Act, may accordingly be used ely by anyone spr o.g176-4111-4 SPIN 10741129, ISBN 3-76434115-8 ‘Refrmated from te ethor' files by TeXniques, ne, Cambridge, MA. Figure recreated by Marty Stock, Watertoer, MA. ‘Cover design by Jeff Casloy, Newon, MA. Pented and bound by Hamlin Printing, Rensselaer, NY. Printed in the United States of America, gs7654321 Contents Introduction To the Student ‘To the Instructor PartI_ PROOFS 1. Informal Logic 11 Introduction... 12. Statements... . . : 13 Relations Between Statements. 1.4 Valid Arguments... . 1.5 Quantifiers 2. Strategies for Proofs 2.1. Mathematical Proofs — What Trey Are and Why We Need Them . . . Bee 2.2 Direct Proofs ...... 23. Proofs by Contrapositive and Contradiction... . 24 Cases, andIfand Only If... ... ix xii xix vi Contents 2.5 Quantifers in Theorems... sec vere recess BL 2,6 Writing Mathematics aac 93 Part 11 FUNDAMENTALS 105 3 Sets 107 3. Intyoduction 6... ee eee ee Se SeeeeerlO: 3.2 Sets—Basic Definitions»... 0.60 eee eee ees 109 33. Set Operations... +0. eee eee ee Ae 34 Indexed Families of Sets. zl See ictee 29) 4° Funetions 135 4A Functions... . 002.5 ee oscar feet s0o 4.2. Image and Inverse Image . - wee 145 43. Composition and Inverse Fu 2. 152 4.4 Injectivity, Surjectivity and : = 161 45° Setsof Functions 0... es ee eee eee 170 5 Relations 7 SL Relations... ss + Sect ested 5.2 Congnuence »..- +--+ REECE EH feet ree 0 5.3 Equivalence Relations - Rae EEE tod 6 Infinite and Finite Sets 203 —~ 61 Cardinality of Sets. eet - 203 62 Cardinalty of the Number Systems... ve eee e+ 218 63. Mathematical Induction... . « : cE 64 Recursion... sere eee ee = 236 Part II EXTRAS 249 7 Selected Topics 7.1 Binary Operations . . . 7.2 Groups. . « : 73 Homomorphisms and Isomorphisms « .. « 714 Partially Ordered Sets . 75. Lattices. . « ae 716 Counting: Products and Sums... 4:7 Counting: Permutations and Combinations . 8 Number Systems 81 82 83 84 85 86 87 Back to the Beginning 0.0... 0.0.00. ‘The Natural Numbers... . Further Properties of the Natural Numbers The Integers... 2... 6. ee ee The Rational Numbers .......... ‘The Real Numbers and the Complex Numbers Appendix: Proof of Theorem 8.2.1... . 9 Explorations 4 92 93 94 95 9.6 97 Introduction... . . tae Greatest Common Divisors . . - Divisibility Tests... .. 2. Real-Valued Functions... . Iterations of Functions»... 0.4... Fibonacci Numbers and Lucas Numbers. [Peay Sets-teeiele serteie ses cere Appendix: Properties of Numbers Hints for Selected Exercises References Index Contents vii 323 323 . 324 - 333 338 » 348 352 - 361 363 363 - 364 » 366 367 - 368 369 an 375 379 405 413 Introduction In an effort to make advanced mathematics accessible to a wide variety of students, and to give even the most mathematically inclined students a solid basis upon which to build their continuing study of mathematics, there has been a tendency in recent years to introduce students to the for- ‘mulation and writing of rigorous mathematical proofs, and to teach topics such as sets, functions, relations and countability, in a “transition” course, rather than in traditional courses such as linear algebra. A transition course functions as a bridge between computational courses such as Calculus, and ‘more theoretical courses such as linear algebra and abstract algebra. This text contains core topics that I believe any transition course should cover, as well as some optional material intended to give the instructor some flexibility in designing a course, The presentation is straightforward and focuses on the essentials, without being too elementary, foo exces- sively pedagogical, and too full to distractions. Some of features of this text are the following: (1) Symbolic logic and the use of logical notation are kept to @ minimum. We discuss only what is absolutely necessary — as is the case in most advanced mathematics courses that are not focused on logic per se. (2) We distinguish between truly general techniques (for example, direct proof and proof by contradiction) and specialized techniques, such as math- ‘ematical induction, which are particular mathematical tools rather than _general proof techniques. x Introduction (3) We avoid an overemphasis on “fun” topics such as number theory, com- binatorics or computer science related topics, since they are not as central as a thorough treatment of sets, functions and relations for core mathe- matics courses such as linear algebra, abstract algebra and real enalysis. ven the two sections on combinatorics in Chapter 7 were written with a focus on reinforcing the use of sets, functions and relations, rather than emphasizing clever counting arguments. (4) The material is presented in the way that mathematicians actually use it rather than in the most axiomatically direct way. For example, a function is a special type of a relation, and from a strictly axiomatic point of view, it would make sense to treat relations first, and then develop functions as 1 special case of relations, I believe most mathematicians do not think of functions in this way (except perhaps for some combinatorialists), and we cover functions before relations, offering clearer treatments of each topic. (5) A section devoted to the proper writing of mathematics has been in- cluded, to help remind students and instructors of the importance of good writing, Outline of the text ‘The book is divided into three parts: Proofs, Fundamentals and Extras, re~ spectively. At the end of the book is a brief appendix summarizing a few basic properties of the standard number systems (integers, rational num- bers, real numbers) that we use, a section of hints for selected exercises, ‘an index and a bibliography. The core material in this text, which should be included in any course, consists of Parts I and Il (Chapters 1-6). A one- semester course can comfortably include all the core material, together with a small amount of material from Part III, chosen according to the taste of the instructor. Part 1, Proofs, consists of Chapters 1-2, covering informal logic and proof techniques, respectively. These two chapters discuss the‘how” of modern mathematics, namely the methodology of rigorous proofs as is currently practiced by mathematicians. Chapter 1 is a precursor to rigorous proofs, and is not about mathematical proofs per se. The exercises in this chapter are all informal, in contrast to the rest of the book. Chapter 2, while including some real proofs, also has 2 good bit of informal discussion, Part Il, Fundamentals, consists of Chapters 3-6, covering sets, functions, relations and cardinality. This material is basic to all of modern mathemat- Introduction xi ics, In contrast to Part J, this materi nn in a more straightforward

    You might also like