How To Prove It: A Structured Approach Daniel J. Velleman 2024 Scribd Download
How To Prove It: A Structured Approach Daniel J. Velleman 2024 Scribd Download
com
https://textbookfull.com/product/how-to-prove-it-a-
structured-approach-daniel-j-velleman/
OR CLICK BUTTON
DOWNLOAD NOW
https://textbookfull.com/product/how-to-prove-it-solutions-manual-
third-edition-daniel-velleman/
textboxfull.com
https://textbookfull.com/product/market-segmentation-how-to-do-it-and-
how-to-profit-from-it-mcdonald/
textboxfull.com
https://textbookfull.com/product/convinced-how-to-prove-your-
competence-win-people-over-1st-edition-jack-nasher/
textboxfull.com
https://textbookfull.com/product/convinced-how-to-prove-your-
competence-win-people-over-1st-edition-jack-nasher-2/
textboxfull.com
Prove It Do or Die Book 1 MM 1st Edition Stephanie Hoyt
https://textbookfull.com/product/prove-it-do-or-die-book-1-mm-1st-
edition-stephanie-hoyt/
textboxfull.com
https://textbookfull.com/product/public-health-what-it-is-and-how-it-
works-6th-edition-bernard-j-turnock/
textboxfull.com
https://textbookfull.com/product/the-it-support-handbook-a-how-to-
guide-to-providing-effective-help-and-support-to-it-users-mike-halsey/
textboxfull.com
https://textbookfull.com/product/a-critical-introduction-to-knowledge-
how-j-adam-carter/
textboxfull.com
https://textbookfull.com/product/how-to-analyze-people-1st-edition-
daniel-spade/
textboxfull.com
How To Prove It
HOW TO PROVE IT
A Structured Approach
Third Edition
Daniel J. Velleman
Department of Mathematics and Statistics
Amherst College
Department of Mathematics and Statistics
University of Vermont
University Printing House, Cambridge CB2 8BS, United Kingdom
One Liberty Plaza, 20th Floor, New York, NY 10006, USA
477 Williamstown Road, Port Melbourne, VIC 3207, Australia
314–321, 3rd Floor, Plot 3, Splendor Forum, Jasola District Centre, New Delhi – 110025, India
79 Anson Road, #06–04/06, Singapore 079906
Cambridge University Press is part of the University of Cambridge.
It furthers the University’s mission by disseminating knowledge in the pursuit of education, learning,
and research at the highest international levels of excellence.
www.cambridge.org
Information on this title: www.cambridge.org/9781108424189
DOI: 10.1017/9781108539890
© Daniel J. Velleman 2019
This publication is in copyright. Subject to statutory exception and to the provisions of relevant
collective licensing agreements, no reproduction of any part may take place without the written
permission of Cambridge University Press.
First published 1994
Second edition 2006
Third edition 2019
Printed in the United Kingdom by TJ International Ltd, Padstow Cornwall
A catalogue record for this publication is available from the British Library.
Library of Congress Cataloging-in-Publication Data
Names: Velleman, Daniel J., author.
Title: How to prove it : a structured approach / Daniel J. Velleman (Amherst College, Massachusetts).
Description: Third edition. | Cambridge ; New York, NY : Cambridge University Press, [2019] |
Includes index.
Identifiers: LCCN 2019013488| ISBN 9781108424189 (hardback : alk. paper) | ISBN
9781108439534 (pbk. : alk. paper)
Subjects: LCSH: Logic, Symbolic and mathematical–Textbooks. | Mathematics–Textbooks. | Proof
theory–Textbooks.
Classification: LCC QA9.V38 2019 | DDC 511.3–dc23
LC record available at https://lccn.loc.gov/2019013488
ISBN 978-1-108-42418-9 Hardback
ISBN 978-1-108-43953-4 Paperback
Cambridge University Press has no responsibility for the persistence or accuracy of URLs for
external or third-party internet websites referred to in this publication and does not guarantee that any
content on such websites is, or will remain, accurate or appropriate.
To Shelley
Contents
1 Sentential Logic
1.1 Deductive Reasoning and Logical Connectives
1.2 Truth Tables
1.3 Variables and Sets
1.4 Operations on Sets
1.5 The Conditional and Biconditional Connectives
2 Quantificational Logic
2.1 Quantifiers
2.2 Equivalences Involving Quantifiers
2.3 More Operations on Sets
3 Proofs
3.1 Proof Strategies
3.2 Proofs Involving Negations and Conditionals
3.3 Proofs Involving Quantifiers
3.4 Proofs Involving Conjunctions and Biconditionals
3.5 Proofs Involving Disjunctions
3.6 Existence and Uniqueness Proofs
3.7 More Examples of Proofs
4 Relations
4.1 Ordered Pairs and Cartesian Products
4.2 Relations
4.3 More About Relations
4.4 Ordering Relations
4.5 Equivalence Relations
5 Functions
5.1 Functions
5.2 One-to-One and Onto
5.3 Inverses of Functions
5.4 Closures
5.5 Images and Inverse Images: A Research Project
6 Mathematical Induction
6.1 Proof by Mathematical Induction
6.2 More Examples
6.3 Recursion
6.4 Strong Induction
6.5 Closures Again
7 Number Theory
7.1 Greatest Common Divisors
7.2 Prime Factorization
7.3 Modular Arithmetic
7.4 Euler’s Theorem
7.5 Public-Key Cryptography
8 Infinite Sets
8.1 Equinumerous Sets
8.2 Countable and Uncountable Sets
8.3 The Cantor-Schrӧder-Bernstein Theorem
Students of mathematics and computer science often have trouble the first
time they’re asked to work seriously with mathematical proofs, because
they don’t know the “rules of the game.” What is expected of you if you are
asked to prove something? What distinguishes a correct proof from an
incorrect one? This book is intended to help students learn the answers to
these questions by spelling out the underlying principles involved in the
construction of proofs.
Many students get their first exposure to mathematical proofs in a high
school course on geometry. Unfortunately, students in high school geometry
are usually taught to think of a proof as a numbered list of statements and
reasons, a view of proofs that is too restrictive to be very useful. There is a
parallel with computer science here that can be instructive. Early
programming languages encouraged a similar restrictive view of computer
programs as numbered lists of instructions. Now computer scientists have
moved away from such languages and teach programming by using
languages that encourage an approach called “structured programming.”
The discussion of proofs in this book is inspired by the belief that many of
the considerations that have led computer scientists to embrace the
structured approach to programming apply to proof writing as well. You
might say that this book teaches “structured proving.”
In structured programming, a computer program is constructed, not by
listing instructions one after another, but by combining certain basic
structures such as the if-else construct and do-while loop of the Java
programming language. These structures are combined, not only by listing
them one after another, but also by nesting one within another. For example,
a program constructed by nesting an if-else construct within a do-while loop
would look like this:
do
if [condition]
[List of instructions goes here.]
else
[Alternative list of instructions goes here.]
while [condition]
The indenting in this program outline is not absolutely necessary, but it is a
convenient method often used in computer science to display the underlying
structure of a program.
Mathematical proofs are also constructed by combining certain basic
proof structures. For example, a proof of a statement of the form “if P then
Q” often uses what might be called the “suppose-until” structure: we
suppose that P is true until we are able to reach the conclusion that Q is
true, at which point we retract this supposition and conclude that the
statement “if P then Q” is true. Another example is the “for arbitrary x
prove” structure: to prove a statement of the form “for all x, P(x),” we
declare x to be an arbitrary object and then prove P (x). Once we reach the
conclusion that P(x) is true we retract the declaration of x as arbitrary and
conclude that the statement “for all x, P(x)” is true. Furthermore, to prove
more complex statements these structures are often combined, not only by
listing one after another, but also by nesting one within another. For
example, to prove a statement of the form “for all x, if P(x) then Q(x)” we
would probably nest a “suppose-until” structure within a “for arbitrary x
prove” structure, getting a proof of this form:
Let x be arbitrary.
Suppose P(x) is true.
[Proof of Q(x) goes here.]
Thus, if P(x) then Q(x).
Thus, for all x, if P(x) then Q(x).
As before, we have used indenting to make the underlying structure of the
proof clear.
Of course, mathematicians don’t ordinarily write their proofs in this
indented form. Our aim in this book is to teach students to write proofs in
ordinary paragraphs, just as mathematicians do, and not in the indented
form. Nevertheless, our approach is based on the belief that if students are
to succeed at writing such proofs, they must understand the underlying
structure that proofs have. They must learn, for example, that sentences like
“Let x be arbitrary” and “Suppose P” are not isolated steps in proofs, but
are used to introduce the “for arbitrary x prove” and “suppose-until” proof
structures. It is not uncommon for beginning students to use these sentences
inappropriately in other ways. Such mistakes are analogous to the
programming error of using a “do” with no matching “while.”
Note that in our examples, the choice of proof structure is guided by the
logical form of the statement being proven. For this reason, the book begins
with elementary logic to familiarize students with the various forms that
mathematical statements take. Chapter 1 discusses logical connectives, and
quantifiers are introduced in Chapter 2. These chapters also present the
basics of set theory, because it is an important subject that is used in the rest
of the book (and throughout mathematics), and also because it serves to
illustrate many of the points of logic discussed in these chapters.
Chapter 3 covers structured proving techniques in a systematic way,
running through the various forms that mathematical statements can take
and discussing the proof structures appropriate for each form. The examples
of proofs in this chapter are for the most part chosen, not for their
mathematical content, but for the proof structures they illustrate. This is
especially true early in the chapter, when only a few proof techniques have
been discussed, and as a result many of the proofs in this part of the chapter
are rather trivial. As the chapter progresses, the proofs get more
sophisticated and more interesting, mathematically.
Chapters 4 and 5, on relations and functions, serve two purposes. First,
they provide subject matter on which students can practice the proof-
writing techniques from Chapter 3. And second, they introduce students to
some fundamental concepts used in all branches of mathematics.
Chapter 6 is devoted to a method of proof that is very important in both
mathematics and computer science: mathematical induction. The
presentation builds on the techniques from Chapter 3, which students
should have mastered by this point in the book.
After completing Chapter 6, students should be ready to tackle more
substantial mathematical topics. Two such topics are presented in Chapters
7 and 8. Chapter 7, new in this third edition, gives an introduction to
number theory, and Chapter 8 discusses infinite cardinalities. These
chapters give students more practice with mathematical proofs, and they
also provide a glimpse of what more advanced mathematics is like.
Every section of every chapter ends with a list of exercises. Some
exercises are marked with an asterisk; solutions or hints for these exercises
are given in the appendix. Exercises marked with the symbol PD can be done
using Proof Designer software, which is available free on the internet.
The biggest changes in this third edition are the addition of a new chapter
on number theory and also more than 150 additional exercises. The section
on reflexive, symmetric, and transitive closures of relations has been
deleted from Chapter 4 (although these topics are now introduced in some
exercises in Section 4.4); it has been replaced with a new section in Chapter
5 on closures of sets under functions. There are also numerous small
changes throughout the text.
I would like to thank all those who sent me comments about earlier
editions of this book. In particular, John Corcoran and Raymond Boute
made several helpful suggestions. I am also grateful for advice from
Jonathan Sands and several anonymous reviewers.
Introduction
Figure I.1.
Will this pattern continue? It is tempting to guess that it will, but this is
only a guess. Mathematicians call such guesses conjectures. Thus, we have
the following two conjectures:
Exercises
Note: Solutions or hints for exercises marked with an asterisk (*) are given
in the appendix.
*1. (a) Factor 215 − 1 = 32,767 into a product of two smaller positive
integers.
(b) Find an integer x such that 1 < x < 232,767 − 1 and 232,767 − 1 is
divisible by x.
2. Make some conjectures about the values of n for which 3n − 1 is
prime or the values of n for which 3n − 2n is prime. (You might start
by making a table similar to Figure I.1.)
*3. The proof of Theorem 3 gives a method for finding a prime number
different from any in a given list of prime numbers.
(a) Use this method to find a prime different from 2, 3, 5, and 7.
(b) Use this method to find a prime different from 2, 5, and 11.
4. Find five consecutive integers that are not prime.
5. Use the table in Figure I.1 and the discussion on p. 5 to find two more
perfect numbers.
6. The sequence 3, 5, 7 is a list of three prime numbers such that each
pair of adjacent numbers in the list differ by two. Are there any more
such “triplet primes”?
7. A pair of distinct positive integers (m, n) is called amicable if the sum
of all positive integers smaller than n that divide n is m, and the sum
of all positive integers smaller than m that divide m is n. Show that
(220, 284) is amicable.
1
Euclid phrased the theorem and proof somewhat differently. We have chosen to take a more
modern approach in our presentation.
1
Sentential Logic
Exercises
*1. Analyze the logical forms of the following statements:
(a) We’ll have either a reading assignment or homework problems, but
we won’t have both homework problems and a test.
(b) You won’t go skiing, or you will and there won’t be any snow.
(c)
2. Analyze the logical forms of the following statements:
(a) Either John and Bill are both telling the truth, or neither of them is.
(b) I’ll have either fish or chicken, but I won’t have both fish and mashed
potatoes.
(c) 3 is a common divisor of 6, 9, and 15.
3. Analyze the logical forms of the following statements:
(a) Alice and Bob are not both in the room.
(b) Alice and Bob are both not in the room.
(c) Either Alice or Bob is not in the room.
(d) Neither Alice nor Bob is in the room.
4. Analyze the logical forms of the following statements:
(a) Either both Ralph and Ed are tall, or both of them are handsome.
(b) Both Ralph and Ed are either tall or handsome.
(c) Both Ralph and Ed are neither tall nor handsome.
(d) Neither Ralph nor Ed is both tall and handsome.
5. Which of the following expressions are well-formed formulas?
(a) ¬(¬P ∨ ¬¬R).
(b) ¬(P, Q, ∧ R).
(c) P ∧ ¬ P.
(d) (P ∧ Q)(P ∨ R).
*6. Let P stand for the statement “I will buy the pants” and S for the
statement “I will buy the shirt.” What English sentences are
represented by the following formulas?
(a) ¬(P ∧ ¬S).
(b) ¬P ∧ ¬S.
(c) ¬P ∨ ¬S.
7. Let S stand for the statement “Steve is happy” and G for “George is
happy.” What English sentences are represented by the following
formulas?
(a) (S ∨ G) ∧ (¬ S ∨ ¬G).
(b) [S ∨ (G ∧ ¬S)] ∨ ¬G.
(c) S ∨ [G ∧ (¬ S ∨ ¬G)].
8. Let T stand for the statement “Taxes will go up” and D for “The
deficit will go up.” What English sentences are represented by the
following formulas?
(a) T ∨ D.
(b) ¬(T ∧ D) ∧ ¬(¬T ∧ ¬D).
(c) (T ∧ ¬ D)∨ (D ∧ ¬T).
9. Identify the premises and conclusions of the following deductive
arguments and analyze their logical forms. Do you think the reasoning
is valid? (Although you will have only your intuition to guide you in
answering this last question, in the next section we will develop some
techniques for determining the validity of arguments.)
(a) Jane and Pete won’t both win the math prize. Pete will win either the
math prize or the chemistry prize. Jane will win the math prize.
Therefore, Pete will win the chemistry prize.
(b) The main course will be either beef or fish. The vegetable will be
either peas or corn. We will not have both fish as a main course and
corn as a vegetable. Therefore, we will not have both beef as a main
course and peas as a vegetable.
(c) Either John or Bill is telling the truth. Either Sam or Bill is lying.
Therefore, either John is telling the truth or Sam is lying.
(d) Either sales will go up and the boss will be happy, or expenses will go
up and the boss won’t be happy. Therefore, sales and expenses will
not both go up.
Figure 1.1.
Figure 1.2.
The truth table for P ∨ Q is a little trickier. The first three lines should
certainly be filled in as shown in Figure 1.3, but there may be some
question about the last line. Should P ∨ Q be true or false in the case in
which P and Q are both true? In other words, does P ∨ Q mean “P or Q, or
both” or does it mean “P or Q but not both”? The first way of interpreting
Other documents randomly have
different content
President in the Philippines sufficed fully, it was contended,
for every purpose of temporary or provisional government
there, except in its lack of ability to grant franchises and
to dispose of the public lands. Hence it was freely charged
that the controlling influences which pressed this measure on
the government came from capitalists and speculators who were
reaching after valuable franchises, mining rights and land
grants in the archipelago. Said Senator Daniel in the debate:
"So far as any legislation which looks forward to the opening
of the way to civil government may be involved to the
softening of the conditions which exist, to the amelioration
of the distresses which are upon the Philippine people, I
would give most cheerful acquiescence. But because we desire
to do these things in a good spirit, in a resolute and
patriotic spirit, let us not permit the provocation of
difficult conditions to lead us into enacting any kind of
provision of law that is not necessary to these ends. Let us
not undertake to give to the President of the United States
any power of disposing of the permanent assets of the
Philippine people; let us not put him in the attitude of being
a franchise giver or a franchise seller or a franchise lessor.
The franchises of those islands—their rivers, their ferries,
their streets, their roads, the thousand and one privileges
which are granted by public authority—are as important and as
valuable to that people and as permanently associated with
their happiness and their prosperity as are their fields or
their mines or their fisheries or anything else which belongs
to their country. … It is true there is the reservation of the
right to alter, amend, or repeal, but while that is legally
broad enough for any remedial legislation whatsoever to
follow, we know that practically it is of very small
consequence. If capital goes in and invests itself in
improvements which are in themselves of a permanent nature, if
railroads are constructed, telegraph lines run, telephones
established, ferries built, steamers and boats, gas
establishments, electrical establishments—if those things are
disposed of, the man who once gets in will never be gotten
out. In all such affairs possession is nine points of the law
before they get into court, where it is generally made the
tenth."
Senator Hoar called attention "to the fact that the report of
the Taft commission urges that power be given to sell the
public lands at once, as it is necessary for their
development, and a large amount of capital is there now
clamoring to be invested," and he remarked: "So I suppose that
one of the chief purposes of this is that the public lands in
the Philippine Islands may be sold before the people of the
islands have any chance whatever to have a voice in their
sale." He then quoted the following passages from the report
of the Taft commission:
Congressional Record,
February 25-March 1, 1901.
{402}
The new tariff for the Islands, which the Commission had been
long engaged in framing, was submitted, in March, to the
government at Washington for approval. "In his letter of
transmittal Judge Taft says that the proposed bill follows
largely the classification of the Cuban tariff, 'but has been
considerably expanded by the introduction of articles
requiring special treatment here by reason of different
surroundings and greater distance from the markets.' Judge
Taft says also that the disposition of the business interests
of the islands is to accept any tariff the commission
proposes, provided only that the duties are specific and not
ad valorem. The question of revenue was kept steadily in view
in the preparation of the schedules, but it was not the only
consideration. Raw materials of Philippine industries, tools,
implements and machinery of production, materials of
transportation, the producers and transmitters of power and
food products are taxed as lightly as possible. … Export
duties are levied on only six articles—hemp, indigo, rice,
sugar, cocoanuts, fresh or as copra, and tobacco. The free
list admits natural mineral waters, trees, shoots and plants,
gold, copper and silver ores, fresh fruits, garden produce,
eggs, milk, ice and fresh meat, except poultry and game. There
is also a list of articles conditionally free of duty. The
importation of explosives is prohibited, but that of firearms
is not."
It is announced from Washington that "Judge Taft and General
MacArthur have agreed upon July 1 as the date for the
establishment of civil government in the Philippines. The
military regime in the islands will therefore cease on June
30, when General Chaffee will relieve General MacArthur of the
command, and Governor Taft will be inaugurated the next day
with considerable ceremony."
{403}
PHŒNICIANS, The:
Modified estimates of their influence upon early
European civilization.
"As soon as the plague broke out at Hong Kong, the great
Japanese bacteriologist Kitasato and the French doctor Yersin,
who is well known for his work with Roux on the serum
treatment of diphtheria, were already on the spot. Yersin
obtained from the English authorities permission to erect a
small straw hut in the yard of the chief hospital, and there
he began his researches. Both Kitasato and Yersin had no
difficulty in ascertaining that the plague buboes teemed with
special bacteria, which had the shape of tiny microscopic
sticklets, thickened at their ends. To isolate these bacteria,
to cultivate them in artificial media, and to ascertain the
deadly effects of these cultures upon animals, was soon done
by such masters in bacteriology as Kitasato and Yersin. The
cause of the plague was thus discovered. It was evident that
infected rats and swine—especially swine with the Chinese, who
keep them in their houses—were spreading the disease, in
addition to men themselves. The same bacteria teemed in the
dead animals. As to men, the discharges from their buboes, and
even, in many cases, their expectorations, were full of plague
bacteria. Besides, Yersin soon noticed that in his
'laboratory,' where he was dissecting animals killed by the
plague, the flies died in numbers. He found that they were
infested with the same bacteria, and carried them about:
inoculations of bacteria obtained from the flies at once
provoked the plague in guinea-pigs. Ants, gnats, and other
insects may evidently spread infection in the same way, while
in and round the infested houses the soil is impregnated with
the same bacteria. As soon as the pest microbe became known,
experiments were begun, at the Paris Institut Pasteur, for
finding the means to combat it; and in July 1895 Yersin,
Calmette, and Borel could already announce that some very
promising results had been obtained."
P. Kropotkin,
Recent Science
(Nineteenth Century, July, 1897).
{404}
{405}
PLURAL VOTING.
PLYMOUTH COLONY:
Return of the manuscript of Bradford's History to
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
textbookfull.com