Analysis with an introduction to proof.

Fifth Edition, Pearson New International

Edition Steven R. Lay
Visit to download the full and correct content document:
https://ebookmass.com/product/analysis-with-an-introduction-to-proof-fifth-edition-pea
rson-new-international-edition-steven-r-lay/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Introduction to Biotechnology: Pearson New

International Edition William J Thieman

https://ebookmass.com/product/introduction-to-biotechnology-
pearson-new-international-edition-william-j-thieman/

Human Communication Disorders: Pearson New

International Edition: An Introduction 8th Edition,
(Ebook PDF)

https://ebookmass.com/product/human-communication-disorders-
pearson-new-international-edition-an-introduction-8th-edition-
ebook-pdf/

Biostatistical Analysis: Pearson New International

Edition Jerrold H Zar

https://ebookmass.com/product/biostatistical-analysis-pearson-
new-international-edition-jerrold-h-zar/

The New Statistics with R: An Introduction for

Biologists 2nd Edition Andy Hector

https://ebookmass.com/product/the-new-statistics-with-r-an-
introduction-for-biologists-2nd-edition-andy-hector/
An Introduction to Statistical Learning with
Applications in R eBook

https://ebookmass.com/product/an-introduction-to-statistical-
learning-with-applications-in-r-ebook/

Exploring Ethics: An Introductory Anthology Fifth

Edition Steven M. Cahn

https://ebookmass.com/product/exploring-ethics-an-introductory-
anthology-fifth-edition-steven-m-cahn/

An Introduction to Genetic Analysis 11th Edition,

(Ebook PDF)

https://ebookmass.com/product/an-introduction-to-genetic-
analysis-11th-edition-ebook-pdf/

An Introduction to Proof Theory: Normalization, Cut-

Elimination, and Consistency Proofs 1st Edition Paolo
Mancosu

https://ebookmass.com/product/an-introduction-to-proof-theory-
normalization-cut-elimination-and-consistency-proofs-1st-edition-
paolo-mancosu/

An Introduction to Correspondence Analysis 1st Edition

Eric J. Beh

https://ebookmass.com/product/an-introduction-to-correspondence-
analysis-1st-edition-eric-j-beh/
 Pearson New International Edition

Analysis with an Introduction to Proof

Steven R. Lay
Fifth Edition

International_PCL_TP.indd 1 7/29/13 11:23 AM

 Pearson Education Limited
Edinburgh Gate
Harlow
Essex CM20 2JE
England and Associated Companies throughout the world

Visit us on the World Wide Web at: www.pearsoned.co.uk

© Pearson Education Limited 2014

All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted
in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without either the
prior written permission of the publisher or a licence permitting restricted copying in the United Kingdom
issued by the Copyright Licensing Agency Ltd, Saffron House, 6–10 Kirby Street, London EC1N 8TS.

All trademarks used herein are the property of their respective owners. The use of any trademark
in this text does not vest in the author or publisher any trademark ownership rights in such
trademarks, nor does the use of such trademarks imply any affiliation with or endorsement of this
book by such owners.

ISBN 10: 1-292-04024-6

ISBN 10: 1-269-37450-8
ISBN 13: 978-1-292-04024-0
ISBN 13: 978-1-269-37450-7

British Library Cataloguing-in-Publication Data

A catalogue record for this book is available from the British Library

Printed in the United States of America

Copyright_Pg_7_24.indd 1 7/29/13 11:28 AM

 P E A R S O N C U S T O M L I B R A R Y

Table of Contents

1. Logic and Proof

Steven R. Lay 1
2. Sets and Functions
Steven R. Lay 41
3. The Real Numbers
Steven R. Lay 111
4. Sequences
Steven R. Lay 171
5. Limits and Continuity
Steven R. Lay 207
6. Differentiation
Steven R. Lay 251
7. Integration
Steven R. Lay 291
8. Infinite Series
Steven R. Lay 319
Glossary of Key Terms
Steven R. Lay 345
Index 359

I
 Logic and Proof

To understand mathematics and mathematical arguments, it is necessary to

have a solid understanding of logic and the way in which known facts can be
combined to prove new facts. Although many people consider themselves to
be logical thinkers, the thought patterns developed in everyday living are
only suggestive of and not totally adequate for the precision required in
mathematics. In this chapter we take a careful look at the rules of logic and
the way in which mathematical arguments are constructed. Section 1
presents the logical connectives that enable us to build compound statements
from simpler ones. Section 2 discusses the role of quantifiers. Sections 3
and 4 analyze the structure of mathematical proofs and illustrate the various
proof techniques by means of examples.

Section 1 LOGICAL CONNECTIVES

The language of mathematics consists primarily of declarative sentences. If a
sentence can be classified as true or false, it is called a statement. The truth
or falsity of a statement is known as its truth value. For a sentence to be a
statement, it is not necessary that we actually know whether it is true or false,
but it must clearly be the case that it is one or the other.

From Chapter 1 of Analysis with an Introduction to Proof, Fifth Edition. Steven R. Lay. Copyright © 2014 by
Pearson Education, Inc. All rights reserved.

1
 Logic and Proof

1.1 EXAMPLE Consider the following sentences.

(a) Two plus two equals four.
(b) Every continuous function is differentiable.
(c) x2 – 5x + 6 = 0.
(d) A circle is the only convex set in the plane that has the same width in
each direction.
(e) Every even number greater than 2 is the sum of two primes.

Sentences (a) and (b) are statements since (a) is true and (b) is false.
Sentence (c), on the other hand, is true for some x and false for others. If we
have a particular context in mind, then (c) will be a statement. In Section 2
we shall see how to remove this ambiguity. Sentences (d) and (e) are more
difficult. You may or may not know whether they are true or false, but it is
certain that each sentence must be one or the other. Thus (d) and (e) are both
statements. [It turns out that (d) can be shown to be false, and the truth value
of (e) has not yet been established.†]

1.2 PRACTICE Which of the sentences are statements?

(a) If x is a real number, then x2 ≥ 0.
(b) Seven is a prime number.
(c) Seven is an even number.
(d) This sentence is false.

In studying mathematical logic we shall not be concerned with the truth

value of any particular simple statement. To be a statement, it must be either
true or false (and not both), but it is immaterial which condition applies.
What will be important is how the truth value of a compound statement is
determined by the truth values of its simpler parts.
In everyday English conversation we have a variety of ways to change or
combine statements. A simple statement‡ like
It is windy.
can be negated to form the statement
It is not windy.

†
Sentence (e) is known as the Goldbach conjecture after the Prussian mathematician
Christian Goldbach, who made this conjecture in a letter to Leonhard Euler in 1742.
Using computers it has been verified for all even numbers up to 1014 but has not yet been
proved for every even number. For a good discussion of the history of this problem, see
Hofstadter (1979). Recent results are reported in Deshouillers et al. (1998).
‡
It may be questioned whether or not the sentence “It is windy” is a statement, since
the term “windy” is so vague. If we assume that “windy” is given a precise definition,
then in a particular place at a particular time, “It is windy” will be a statement. It is
customary to assume precise definitions when we use descriptive language in an example.
This problem does not arise in a mathematical context because the definitions are precise.

2
 Logic and Proof

The compound statement

It is windy and the waves are high.
is made up of two parts: “It is windy” and “The waves are high.” These two
parts can also be combined in other ways. For example,
It is windy or the waves are high.
If it is windy, then the waves are high.
It is windy if and only if the waves are high.
The italicized words above (not, and, or, if . . . then, if and only if ) are
called sentential connectives. Their use in mathematical writing is similar to
(but not identical with) their everyday usage. To remove any possible ambi-
guity, we shall look carefully at each and specify its precise mathematical
meaning.
Let p stand for a given statement. Then ~ p (read not p) represents the
logical opposite (negation) of p. When p is true, ~ p is false; when p is false,
~ p is true. This can be summarized in a truth table:

p ~p
T F
F T

where T stands for true and F stands for false.

1.3 EXAMPLE Let p, q, and r be given as follows:

p : Today is Monday.
q : Five is an even number.
r : The set of integers is countable.
Then their negations can be written as
~ p : Today is not Monday.
~ q : Five is not an even number.
or
Five is an odd number.
~ r : The set of integers is not countable.
or
The set of integers is uncountable.

The connective and is used in logic in the same way as it is in ordinary

language. If p and q are statements, then the statement p and q (called the
conjunction of p and q and denoted by p ∧ q) is true only when both p and q
are true, and it is false otherwise.

3
 Logic and Proof

1.4 PRACTICE Complete the truth table for p ∧ q. Note that we have to use four lines in this
table to include all possible combinations of truth values of p and q.

p q p∧q
T T
T F
F T
F F

The connective or is used to form a compound statement known as a

disjunction. In common English the word or can have two meanings. In the
sentence
We are going to paint our house yellow or green.
the intended meaning is yellow or green, but not both. This is known as the
exclusive meaning of or. On the other hand, in the sentence
Do you want cake or ice cream for dessert?
the intended meaning may include the possibility of having both. This
inclusive meaning is the only way the word or is used in logic. Thus, if we
denote the disjunction p or q by p ∨ q, we have the following truth table:

p q p∨q
T T T
T F T
F T T
F F F

A statement of the form

If p, then q.
is called an implication or a conditional statement. The if-statement p in the
implication is called the antecedent and the then-statement q is called the
consequent. To decide on an appropriate truth table for implication, let us
consider the following sentence:
If it stops raining by Saturday, then I will go to the football game.
If a friend made a statement like this, under what circumstances could you
call him a liar? Certainly, if the rain stops and he doesn’t go, then he did not
tell the truth. But what if the rain doesn’t stop? He hasn't said what he will
do then, so whether he goes or not, either is all right.

4
 Logic and Proof

Although it might be argued that other interpretations make equally good

sense, mathematicians have agreed that an implication will be called false
only when the antecedent is true and the consequent is false. If we denote the
implication “if p, then q” by p ⇒ q, we obtain the following table:

p q p⇒q

T T T
T F F
F T T
F F T

It is important to recognize that in mathematical writing the conditional

statement can be disguised in several equivalent forms. Thus the following
expressions all mean exactly the same thing:
if p, then q q provided that p
p implies q q whenever p
p only if q p is a sufficient condition for q
q if p q is a necessary condition for p

1.5 PRACTICE Identify the antecedent and the consequent in each of the following statements.
(a) If n is an integer, then 2n is an even number.
(b) You can work here only if you have a college degree.
(c) The car will not run whenever you are out of gas.
(d) Continuity is a necessary condition for differentiability.

One way to visualize an implication R ⇒ S is to picture two sets R and S,

with R inside S. Figure 1 shows several objects of different shapes. Some
are round and some are not round. Some are solid and some are not solid.
Objects that are round are in set R and objects that are solid are in set S.

S
□ ▲
♦
R
•
• ▼
■ •
♦

Figure 1 R ⇒ S

5
 Logic and Proof

We see that the relationship between R and S in Figure 1 can be stated in

several equivalent ways:
• If an object is round (R), then it is solid (S).
• An object is solid (S) whenever it is round (R).
• An object is solid (S) provided that it is round (R).
• Being round (R) is a sufficient condition for an object to be solid (S).
(It is sufficient to know that an object is round to conclude that it is
solid.)
• Being solid (S) is a necessary condition for an object to be round (R).
(It is necessary for an item to be solid in order for it to be round.)

1.6 PRACTICE In Figure 1, which of the following is correct?

(a) An object is solid (S) only if it is round (R).
(b) An object is round (R) only if it is solid (S).

The statement “p if and only if q” is the conjunction of the two con-

ditional statements p ⇒ q and q ⇒ p. A statement in this form is called a
biconditional and is denoted by p ⇔ q. In written form the abbreviation
“iff ” is sometimes used instead of “if and only if.” The truth table for the
biconditional can be obtained by analyzing the compound statement ( p ⇒ q)
∧ ( q ⇒ p) a step at a time.

p q p⇒q q⇒p ( p ⇒ q) ∧ ( q ⇒ p)

T T T T T
T F F T F
F T T F F
F F T T T

Thus we see that p ⇔ q is true precisely when p and q have the same truth
values.

1.7 PRACTICE Construct a truth table for each of the following compound statements.
(a) ~ ( p ∧ q) ⇔ [(~ p) ∨ (~ q)]
(b) ~ ( p ∨ q) ⇔ [(~ p) ∧ (~ q)]
(c) ~ ( p ⇒ q) ⇔ [ p ∧ (~ q)]

In Practice 1.7 we find that each of the compound statements is true in all
cases. Such a statement is called a tautology. When a biconditional
statement is a tautology, it shows that the two parts of the biconditional are

6
 Logic and Proof

logically equivalent. That is, the two component statements have the same
truth tables.
We shall encounter many more tautologies in the next few sections.
They are very useful in changing a statement from one form into an
equivalent statement in a different (one hopes simpler) form. In 1.7(a) we see
that the negation of a conjunction is logically equivalent to the disjunction of
the negations. Similarly, in 1.7(b) we learn that the negation of a disjunction
is the conjunction of the negations. In 1.7(c) we find that the negation of an
implication is not another implication, but rather it is the conjunction of the
antecedent and the negation of the consequent.

1.8 EXAMPLE Using Practice 1.7(a), we see that the negation of

The set S is compact and convex.

can be written as

The set S is not compact or it is not convex.

This example also illustrates that using equivalent forms in logic does not
depend on knowing the meaning of the terms involved. It is the form of the
statement that is important. Whether or not we happen to know the definition
of “compact” and “convex” is of no consequence in forming the negation
above.

1.9 PRACTICE Use the tautologies in Practice 1.7 to write out a negation of each of the
following statements.
(a) Seven is prime or 2 + 2 = 4.
(b) If M is bounded, then M is compact.
(c) If roses are red and violets are blue, then I love you.

Review of Key Terms in Section 1

Statement Implication Biconditional
Negation Conditional Tautology
Conjunction Antecedent
Disjunction Consequent

ANSWERS TO PRACTICE PROBLEMS

1.2 (a), (b), and (c)

7
 Logic and Proof

1.4 p q p∧q
T T T
T F F
F T F
F F F

1.5 (a) Antecedent: n is an integer

Consequent: 2n is an even number
(b) Antecedent: you can work here
Consequent: you have a college degree
(c) Antecedent: you are out of gas
Consequent: the car will not run
(d) Antecedent: differentiability
Consequent: continuity

1.6 Statement (b) is correct. If one of the objects is not solid, then it cannot
possibly be round.
1.7 Sometimes we condense a truth table by writing the truth values under the
part of a compound expression to which they apply.
(a) p q ~ ( p ∧ q) ⇔ [(~ p) ∨ (~ q)]
T T F T T F F F
T F T F T F T T
F T T F T T T F
F F T F T T T T

(b) p q ~ ( p ∨ q) ⇔ [(~ p) ∧ (~ q)]

T T F T T F F F
T F F T T F F T
F T F T T T F F
F F T F T T T T

(c) p q ~ ( p ⇒ q) ⇔ [ p ∧ (~ q)]
T T F T T T F F
T F T F T T T T
F T F T T F F F
F F F T T F F T

8
 Logic and Proof

1.9 (a) Seven is not prime and 2 + 2 ≠ 4.

(b) M is bounded and M is not compact.
(c) Roses are red and violets are blue, but I do not love you.

1 EXERCISES

Exercises marked with * are used in later sections, and exercises marked with œ
have hints or solutions in the back of the chapter.

1. Mark each statement True or False. Justify each answer.

(a) In order to be classified as a statement, a sentence must be true.
(b) Some statements are both true and false.
(c) When statement p is true, its negation ~p is false.
(d) A statement and its negation may both be false.
(e) In mathematical logic, the word “or” has an inclusive meaning.

2. Mark each statement True or False. Justify each answer.

(a) In an implication p ⇒ q, statement p is referred to as the proposition.
(b) The only case where p ⇒ q is false is when p is true and q is false.
(c) “If p, then q” is equivalent to “p whenever q.”
(d) The negation of a conjunction is the disjunction of the negations of the
individual parts.
(e) The negation of p ⇒ q is q ⇒ p.

3. Write the negation of each statement. œ

(a) The 3 × 3 identity matrix is singular.
(b) The function f (x) = sin x is bounded on R.
(c) The functions f and g are linear.
(d) Six is prime or seven is odd.
(e) If x is in D, then f (x) < 5.
(f ) If (an) is monotone and bounded, then (an) is convergent.
(g) If f is injective, then S is finite or denumerable.
4. Write the negation of each statement.
(a) The function f (x) = x2 – 9 is continuous at x = 3.
(b) The relation R is reflexive or symmetric.
(c) Four and nine are relatively prime.
(d) x is in A or x is not in B.
(e) If x < 7, then f (x) is not in C.
(f ) If (an) is convergent, then (an) is monotone and bounded.
(g) If f is continuous and A is open, then f – 1(A) is open.

9
 Logic and Proof

5. Identify the antecedent and the consequent in each statement. œ

(a) M has a zero eigenvalue whenever M is singular.
(b) Linearity is a sufficient condition for continuity.
(c) A sequence is Cauchy only if it is bounded.
(d) x < 3 provided that y > 5.
6. Identify the antecedent and the consequent in each statement.
(a) A sequence is convergent if it is Cauchy.
(b) Convergence is a necessary condition for boundedness.
(c) Orthogonality implies invertability.
(d) K is closed and bounded only if K is compact.
7. Construct a truth table for each statement.
(a) p ⇒ ~ q œ
(b) [ p ∧ ( p ⇒ q)] ⇒ q
(c) [ p ⇒ ( q ∧ ~ q)] ⇔ ~ p œ
8. Construct a truth table for each statement.
(a) p ∨ ~ q
(b) p ∧ ~ p
(c) [(~ q) ∧ ( p ⇒ q)] ⇒ ~ p
9. Indicate whether each statement is True or False. œ
(a) 3 ≤ 5 and 11 is odd.
(b) 32 = 8 or 2 + 3 = 5.
(c) 5 > 8 or 3 is even.
(d) If 6 is even, then 9 is odd.
(e) If 8 < 3, then 22 = 5.
(f ) If 7 is odd, then 10 is prime.
(g) If 8 is even and 5 is not prime, then 4 < 7.
(h) If 3 is odd or 4 > 6, then 9 ≤ 5.
( i ) If both 5 – 3 = 2 and 5 + 3 = 2, then 9 = 4.
( j ) It is not the case that 5 is even or 7 is prime.
10. Indicate whether each statement is True or False.
(a) 2 + 3 = 5 and 5 is even.
(b) 3 + 4 = 5 or 4 + 5 = 6.
(c) 7 is even or 6 is not prime.
(d) If 4 + 4 = 8, then 9 is prime.
(e) If 6 is prime, then 8 < 6.
(f) If 6 < 2, then 4 + 4 = 8.
(g) If 8 is prime or 7 is odd, then 9 is even.
(h) If 2 + 5 = 7 only if 3 + 4 = 8, then 32 = 9.
( i ) If both 5 – 3 = 2 and 5 + 3 = 8, then 8 – 3 = 4.
( j) It is not the case that 5 is not prime and 3 is odd.

10
 Logic and Proof

11. Let p be the statement “The figure is a polygon,” and let q be the statement
“The figure is a circle.” Express each of the following statements in
symbols. œ
(a) The figure is a polygon, but it is not a circle.
(b) The figure is a polygon or a circle, but not both.
(c) If the figure is not a circle, then it is a polygon.
(d) The figure is a circle whenever it is not a polygon.
(e) The figure is a polygon iff it is not a circle.
12. Let m be the statement “x is perpendicular to M,” and let n be the statement
“x is perpendicular to N.” Express each of the following statements in
symbols.
(a) x is perpendicular to N but not perpendicular to M.
(b) x is not perpendicular to M, nor is it perpendicular to N.
(c) x is perpendicular to N only if x is perpendicular to M.
(d) x is not perpendicular to N provided it is perpendicular to M.
(e) It is not the case that x is perpendicular to M and perpendicular to N.
13. Define a new sentential connective ∇, called nor, by the following truth
table.
p q p∇q

T T F

T F F

F T F

F F T

(a) Use a truth table to show that p ∇ p is logically equivalent to ~ p.

(b) Complete a truth table for ( p ∇ p) ∇ ( q ∇ q).
(c) Which of our basic connectives ( p ∧ q, p ∨ q, p ⇒ q, p ⇔ q) is logically
equivalent to ( p ∇ p) ∇ ( q ∇ q) ?
14. Use truth tables to verify that each of the following is a tautology. Parts (a)
and (b) are called commutative laws, parts (c) and (d) are associative laws,
and parts (e) and (f) are distributive laws.
(a) ( p ∧ q) ⇔ ( q ∧ p)
(b) ( p ∨ q) ⇔ ( q ∨ p)
(c) [ p ∧ ( q ∧ r)] ⇔ [( p ∧ q) ∧ r]
(d) [ p ∨ ( q ∨ r)] ⇔ [( p ∨ q) ∨ r]
(e) [ p ∧ ( q ∨ r)] ⇔ [( p ∧ q) ∨ ( p ∧ r)]
(f ) [ p ∨ ( q ∧ r)] ⇔ [( p ∨ q) ∧ ( p ∨ r)]

11
 Logic and Proof

Section 2 QUANTIFIERS
In Section 1 we found that the sentence

x2 − 5x + 6 = 0
needed to be considered within a particular context in order to become a
statement. When a sentence involves a variable such as x, it is customary to
use functional notation when referring to it. Thus we write

p (x) : x2 – 5x + 6 = 0
to indicate that p (x) is the sentence “x2 − 5x + 6 = 0.” For a specific value
of x, p (x) becomes a statement that is either true or false. For example, p (2)
is true and p (4) is false.
When a variable is used in an equation or an inequality, we assume that
the general context for the variable is the set of real numbers, unless we are
told otherwise. Within this context we may remove the ambiguity of p (x) by
using a quantifier. The sentence

For every x, x2 − 5x + 6 = 0.
is a statement since it is false. In symbols we write

∀ x, p (x),
where the universal quantifier ∀ is read, “For every…,” “For all…,” “For
each…,” or a similar equivalent phrase. The sentence

There exists an x such that x2 − 5x + 6 = 0.

is also a statement, and it is true. In symbols we write

∃x p (x),

where the existential quantifier ∃ is read, “There exists…,” “There is at

least one...,” or something equivalent. The symbol is just a shorthand
notation for the phrase “such that.”

2.1 EXAMPLE The statement

There exists a number less than 7.
can be written
∃x x<7

12
 Logic and Proof

or in the abbreviated form

∃ x < 7,
where it is understood that x is to represent a real number. Sometimes the
quantifier is not explicitly written down, as in the statement

If x is greater than 1, then x2 is greater than 1.

The intended meaning is

∀ x, if x > 1, then x2 > 1.

In general, if a variable is used in the antecedent of an implication without

being quantified, then the universal quantifier is assumed to apply.

2.2 PRACTICE Rewrite each statement using ∃, ∀, and , as appropriate.

(a) There exists a positive number x such that x2 = 5.
(b) For every positive number M, there is a positive number N such that
N < 1/M.
(c) If n ≥ N, then | fn (x) − f (x) | ≤ 3 for all x in A.
(d) No positive number x satisfies the equation f (x) = 5.

Having seen several examples of how existential and universal

quantifiers are used, let us now consider how quantified statements are
negated. Consider the statement

Everyone in the room is awake.

What condition must apply to the people in the room in order for the
statement to be false? Must everyone be asleep? No, it is sufficient that at
least one person be asleep. On the other hand, in order for the statement

Someone in the room is asleep.

to be false, it must be the case that everyone is awake. Symbolically, if

p (x): x is awake,
then

~ [ ∀ x, p (x)] ⇔ [∃ x ~ p (x)],

where the symbol “ ~ ” represents negation. Similarly,

~ [∃ x p (x)] ⇔ [∀ x, ~ p (x)].

13
 Logic and Proof

2.3 EXAMPLE Let us look at several more quantified statements and derive their negations.
Notice in part (b) that the inequality “0 < g ( y) ≤ 1” is a conjunction of two
inequalities “0 < g ( y)” and “g ( y) ≤ 1.” Thus its negation is a disjunction. In
part (c), note that the “and” between x and y is not a logical connective that
needs to be negated. That is, the negation of “for all x and y in A” is “there
exist x and y in A.” In a complicated statement like (d), it is helpful to work
through the negation one step at a time. Fortunately, (d) is about as messy as
it will get.

(a) Statement: For every x in A, f (x) > 5.

∀ x in A, f (x) > 5.
Negation: ∃ x in A f (x) ≤ 5.
There is an x in A such that f (x) ≤ 5.

(b) Statement: There exists a positive number y such that 0 < g ( y) ≤ 1.

∃ y>0 0 < g ( y) ≤ 1.
Negation: ∀ y > 0, g ( y) ≤ 0 or g ( y) > 1.
For every positive number y, g ( y) ≤ 0 or g ( y) > 1.
(c) Statement: For all x and y in A, there exists z in B such that x + y = z.
∀ x and y in A, ∃ z in B x + y = z.
Negation: ∃ x and y in A ∀ z in B, x + y ≠ z.
There exist x and y in A such that for all z in B, x + y ≠ z.

(d) Statement:
∀ε > 0 ∃N ∀ n, if n ≥ N, then ∀ x in S, | fn (x) − f (x) | < ε .
Negation:
∃ε >0 ~ [∃ N ∀ n, if n ≥ N, then ∀ x in S, | fn (x) − f (x) | < ε ],
or
∃ε >0 ∀ N, ~ [∀ n, if n ≥ N, then ∀ x in S, | fn (x) − f (x) | < ε ],
or
∃ε >0 ∀N∃n ~ [if n ≥ N, then ∀ x in S, | fn (x) − f (x) | < ε ],
or
∃ε >0 ∀N∃n n ≥ N and ~ [∀ x in S, | fn (x) − f (x) | < ε ],
or
∃ε >0 ∀N∃n n ≥ N and ∃ x in S | fn (x) − f (x) | ≥ ε .

14
 Logic and Proof

2.4 PRACTICE Write the negation of each statement in Practice 2.2.

It is important to realize that the order in which quantifiers are used

affects the truth value. For example, when talking about real numbers, the
statement
∀x∃ y y>x
is true. That is, given any real number x there is always a real number y that
is greater than that x. But the statement
∃y ∀ x, y > x
is false, since there is no fixed real number y that is greater than every real
number. Thus care must be taken when reading (and writing) quantified
statements so that the order of the quantifiers is not inadvertently changed.

2.5 PRACTICE Determine the truth value of each statement. Assume that x and y are real
numbers. Justify your answers.
(a) ∀ x ∃ y x + y = 3.
(b) ∃ x ∀ y, x + y ≠ 3.

Review of Key Terms in Section 2

Universal quantifier “ ∀ ” Existential quantifier “ ∃ ” Such that “ ”

ANSWERS TO PRACTICE PROBLEMS

2.2 (a) ∃ x > 0 x2 = 5.

(b) ∀ M > 0 ∃ N > 0 N < 1/ M.
(c) ∀ n, if n ≥ N, then ∀ x in A, | fn (x) − f (x) | ≤ 3.
(d) The words “no” and “none” are universal quantifiers in a negative
sense. In general, the statement “None of them are P(x)” is
equivalent to “All of them are not P(x).” Thus the statement can be
written as “∀ x > 0, f (x) ≠ 5.”
2.4 (a) ∀ x > 0, x2 ≠ 5.
(b) ∃ M > 0 ∀ N > 0, N ≥ 1/M.
(c) ∃ n n ≥ N and ∃ x in A | fn (x) − f (x) | > 3.
(d) ∃ x > 0 f (x) = 5.
2.5 (a) The statement says, “For every x, there exists a y such that x + y = 3.”
We want to know if given any x, can we find a y that makes x + y
equal to 3. The answer is “yes,” because the equation can be solved
for y in terms of x. So the statement is true, and we can justify it by

15
 Logic and Proof

saying, “Given any x, let y = 3 – x.” This not only states that there is
such a y, but it identifies what y is.
(b) The statement says, “There exists an x such that for all y, x + y ≠ 3.”
To show this is true, we might try to find an x that had the desired
property. But this is hard to do since given any x, there is always a y
that makes x + y = 3, namely y = 3 – x. So statement (b) is false.
And the justification for this is the sentence “Given any x, let y =
3 – x.” Note that statement (b) is the negation of statement (a). So it
should come as no surprise that (a) being true means (b) is false, and
the justification for both conclusions is the same.

2 EXERCISES
Exercises marked with * are used in later sections, and exercises marked with œ
have hints or solutions in the back of the chapter.

1. Mark each statement True or False. Justify each answer.

(a) The symbol “ ∀ ” means “for every.”
(b) The negation of a universal statement is another universal statement.
(c) The symbol “ ” is read “such that.”
2. Mark each statement True or False. Justify each answer.
(a) The symbol “ ∃ ” means “there exist several.”
(b) If a variable is used in the antecedent of an implication without being
quantified, then the universal quantifier is assumed to apply.
(c) The order in which quantifiers are used affects the truth value.
3. Write the negation of each statement. œ
(a) Some pencils are red.
(b) All chairs have four legs.
(c) No one on the basketball team is over 6 feet 4 inches tall.
(d) ∃ x > 2 f (x) = 7.
(e) ∀ x in A, ∃ y > 2 0 < f ( y) < f (x).
(f ) If x > 3, then ∃ ε > 0 x2 > 9 + ε.
4. Write the negation of each statement.
(a) Everyone likes Robert.
(b) Some students work part-time.
(c) No square matrices are triangular.
(d) ∃ x in B f (x) > k.
(e) If x > 5, then f (x) < 3 or f (x) > 7.
(f ) If x is in A, then ∃ y in B f (x) < f (y).

16
Another random document with
no related content on Scribd:
Sonneck also gives a “Hunting Song” set to music by Mr. Roth in
1790. Sonneck credits Phile with the following compositions.
1787

1. Violin Concerto by Mr. Phile.

1790

2. Harmony Music, Phile.[259]

In addition to these we have:

1791

3. Overture by P. to be played at Vauxhall Concert, May 27.[260]

4. Concerto Violin by Mr. Phile. At Vauxhall Sept. 2.[261]

FOOTNOTES:
[233] Sonneck, Early Secular American Music, Index.
[234] See Above, p. 54.
[235] Cf. City Directory of Philadelphia, 1785.
[236] Peter Markoe (1768-1792) born at Santa Cruz, West Indies,
educated in Eng., died at Phila.
[237] Son of Francis Hopkinson mentioned above as an important
figure in Phila. musical development, Cf. Above, pp. ff.
[238] Poulson’s Daily Advertiser, Jan. 13, 1829.
[239] Cf. Above, p. 54.
[240] Pa. Jour., Sept. 10, 1788.
[241] Pa. Jour., Jan. 7, 1789.
[242] City Directory, 1791, p. 110.
[243] City Directory, 1795, p. 81.
[244] Cf. Above p. 77.
[245] Cf. Above, p. 89.
[246] City Directory, 1806.
[247] Cf. Letters of Administration, Book K, No. 156, p. 178 in
office of Recorder of Wills, City Hall, Philadelphia.
[248] Pa. Packet, Mar. 6, 1784.
[249] Durang, History of the Stage in Phila., Chapter 12, [A rare
book].
[250] Sonneck, Early Secular American Music, p. 189.
[251] N. Y. Packet, Jul. 13, 1786.
[252] Pa. Packet, Jan. 13, 1787.
[253] See Above, Note to 72.
[254] Sonneck, Article in Sammelbände (1901), p. 156.
[255] Baltimore Clipper, 1841.
[256] G. W. Custis, Recollections and Private Memoirs of
Washing. p. 368. Also Diary of Geo. Wash. 1789-1791, (ed. B. J.
Lossing, 1860), p. 56.
[257] Sammelbände der Internationalen Musikgesellschaft, 1901.
[258] Many writers have expressed an opinion, but evidently their
information consisted of a knowledge of only one claim.
[259] Cf. Sonneck, Early Sec. Am. Music for these compositions.
[260] Am. Daily Adv., May 25, 1791.
[261] Am. Daily Adv., Sept. 2, 1791.
 CONCLUSION.
We have tried to show the gradual growth of musical taste in
Philadelphia, especially the taste for German music. As before
mentioned this taste was undoubtedly stimulated mostly by the
English musicians, at least until the last period. In that period the
English, and German musicians, seem to have worked in
conjunction to keep up the standard set by their predecessors. It
must not be thought that German music alone ruled in Philadelphia.
During the French Revolution, especially, many refugees arrived in
Philadelphia and concerts of French music were given and great
enthusiasm was aroused among the American citizens. However, on
looking over the whole century, German music seems to
predominate over the music of other nations in Philadelphia. Musical
taste in Philadelphia after the Revolution will compare favorably with
the taste shown in Europe at the same period.
 APPENDIX.
Works of Alexander Reinagle.
Unless otherwise noted this list has been taken from O. G.
Sonneck’s “Early Secular American Music.” They are given here
according to date of production.
1787.
1. Overture.
2. “A Select Collection of the most favorite Scots tunes. With
variations for the pianoforte or harpsichord.”
3. A song (newly composed).
1788.
4. “Federal March, as performed in the grand procession in
Philadelphia, the 4th of July, 1788. Composed and adapted for the
pianoforte, violin, or German flute.”
1789.
5. Song.
“Adieu thou dreary pile.”
Arranged for pianoforte or harpsichord by Reinagle.
6. Chorus, sung before Gen. Washington, as he passed under the
triumphal arch on Trenton Bridge, April 21, 1789. “Set to music and
dedicated by permission to Mrs. Washington.”
7. Song. “In vain fond youth you would conceal.”
8. Song. “My soul is thine, sweet Nora.”
9. Song. “The Soldier tried, etc.”
10. Song. “Tantive back forward.”
11. Song. “Tis not the bloom on Damon’s cheek.”
(These songs were arranged by R. for pianoforte or harpsichord.)
12. Overture. “La Schiava” (Piccini.)
13. Overture to opera “Maria” (Shield).
(These overtures arranged for pf. by R.)
1791.
14. Song. “Winter.” Set to music by R. with pf. acc.
15. Miscellaneous Quartet. Played at the “City Concert” Mar. 5, 1791
and often the remainder of the season.[262] This composition is
dated by Sonneck 1793.
16. New Miscellaneous Quartet. To be played at the “City Concert”
Dec. 17, 1791.[263]
1794.
17. Song. “America, Commerce and Freedom.” By. R.
18. “La Chasse” (Rosetti). Arranged for pianoforte or Harpsichord by
R.
19. “Concerto On the Improved Pianoforte with Additional keys.”
20. “La Foret Noire (serious pantomime. Overture, etc., entirely new,
composed by Mr. Reinagle.”)
21. Occasional Overture.
22. “Preludes in three classes, for the improvement of practitioners
on the pianoforte.”
23. “Robin Hood” (comic opera,) original overture by Baumgarten,
additional airs by R.
24. “Slaves in Algiers” (play interspersed with songs), Music by R.
25. “Spanish Barber” (opera translated from Beaumarchais, by G.
Colemann), additional airs by Reinagle and Carr.
1795.
26. “Harlequin shipwreck’d” (Pantomime). New music by R.
27. “Harlequins invasion” (Pantomime.) New medley overture by R.
28. “Volunteers” (comic opera). Music and overture entirely new.
29. “The Purse” (musical drama by J. J. Cross), accompaniments
and new airs by R.
30. “Auld Robin Gray” (opera), new music and a Scottish medley
overture by R.
1796.
31. “Mountaineers” (comic opera), accompaniments by R.
32. “Pierre de Province and La Belle Magulone” new music by R.
This was also called “The Rival Knights” or La “Belle Magalone” a
pantomime.[264] Probably this was the same thing as “Pierre de
Province” although the latter was advertised as a “ballet.”
33. “Grand Divertisement in the Temple of Liberty taken from the
celebrated Ballet, called, Warriors Welcome Home. The Overture
and Music compiled by Mr. Reinagle in which is introduced a number
of Irish and Scotch Airs.”[265]
34. “The Shamrock” (Irish dance), Irish medley Overture by R.[266]
35. “Witches of the rocks or Harlequin everywhere” (Pantomime),
“with an entire new overture, songs, choruses, and recitations
composed by Mr. Reinagle.”
1797.
36. “Columbus” (historical play), incidental music by R.
37. Savoyard (musical farce), music by R.
1798.
38. “‘The Gentle Shepherd’, written by Allan Ramsay. With original
airs and the accompaniment by Mr. Reinagle.” This was called “the
favorite comical Scot’s Pastoral” and was to be performed at the
New Theatre.[267]
39. “Italian Monk” (opera), music and accompaniment by R.
1799.
40. Monody. “On the Death of the much lamented, the late
Lieutenant-General of the Armies of the United States. The Music
composed by R. Taylor, and Mr. Reinagle.” To be given at the New
Theatre.[268]
41. “Blue Beard” (opera accompaniments by R.)
42. “The Arabs of the desert, or Harlequins flight from Egypt,” with a
new Overture and Music, composed by Mr. Reinagle.[269]
Probably before 1800 (date not known).
43. “Collection of favorite songs, divided into books. The basses
rendered easy and natural for the pianoforte or harpsichord by Alex.
Reinagle.”
1800.
44. Masonic overture.
45. “Naval pillar” (musical entertainment), accompaniments by R.
46. “Pizarro,” by Kotzebue; adapted by R. B. Sheridan; music by
Reinagle and Raynor Taylor.

FOOTNOTES:
[262] Cf. Am. Daily Adv., Mar. 4, 1791. Also programs given in this
book for 1791.
[263] Cf. Am. Daily Adv., Dec. 15, 1791.
[264] Cf. Am. Daily Adv., Jun. 27, 1796.
[265] Cf. Am. Daily Adv., Mar. 28, 1796.
[266] Perhaps the same as advertised in Am. Daily Adv., May 7,
1794.
[267] Am. Daily Adv., Apr. 16, 1798.
[268] Am. Daily Adv., Dec. 23, 1799.
[269] Cf. Am. Daily Adv., Apr. 13, 1799.
 Americana Germanica
NEW SERIES

MONOGRAPHS DEVOTED TO THE COMPARATIVE STUDY OF

THE

Literary, Linguistic and Other Cultural Relations

of Germany and America

EDITOR

MARION DEXTER LEARNED

University of Pennsylvania

CONTRIBUTING EDITORS
H. C. G. Brandt
W. H. Carpenter
W. H. Carruth
Hermann Collitz
Starr W. Cutting
Daniel K. Dodge
A. B. Faust
Kuno Francke
Adolph Gerber
Julius Goebel
J. T. Hatfield
W. T. Hewett
A. R. Hohlfeld
Hugo K. Schilling
H. Schmidt-Wartenberg
 Hermann Schoenfeld
Calvin Thomas
H. S. White
Henry Wood

PHILADELPHIA

AMERICANA GERMANICA PRESS

Berlin
MAYER & MÜLLER
New York
CARL A. STERN
Leipzig
F. A. BROCKHAUS
London
KEGAN, PAUL, TRENCH, TRÜBNER & CO., Ltd.
Paris
H. Le SOUDIER
 Transcriber’s note
Minor punctuation errors have been changed
without notice. Inconsistencies in hyphenation have
been standardized.
The spelling of the surnames was standardized. The
exception is Tannenberger/Tannenberg which was
left as published because a footnote refers to the
alternate spelling.
Page 58: Dashes were removed from the table for
readability purposes.
Page 68: For the “VAUXHALL CONCERT, SEPT. 2”
section. Duplicate #3 and #4 were removed.
The following printer errors have been changed.
Page “The Influencs of “The Influence of
Ads: Salomon” Salomon”
Page “Hymnology and the “Hymnology and the
Ads: Souces” Sources”
Page
“anfangs ein sternger” “anfangs ein strenger”
7:
Page “Scylla Theologiae, “Scylla Theologica,
7: aliquot” aliquot”
Page “of the Bohemian “of the Bohemian
10: Bretheren” Brethren”
Page
“Unparteysche Lieder” “Unparteiische Lieder”
10:
Page “Neues und “Neues und
10: vesbessertes” verbessertes”
Page
“services, epecially” “services, especially”
13:
Page “Christina, Dlaware, to” “Christiana, Delaware,
13: to”
Page
“on the Wissakickon” “on the Wissahickon”
18:
Page “court of arms “coat of arms
41: containing” containing”
Page “of musical “of musical
42: merchandise” merchandize”
Page “was popular, and “was popular, and
46: prabably” probably”
Page “and in 1763 recieved “and in 1763 received
47: the” the”
Page
“Provinicial Council of” “Provincial Council of”
47:
Page “Pepush (Alex’s a “Pepush (Alexis a
49: Cantata!)” Cantata!)”
Page
“least a semi-worldy” “least a semi-worldly”
52:
Page
“ji suis et serai” “je suis et serai”
59:
Page “très humble
“trés humble Serviteur.”
59: Serviteur.”
Page
“mois de Fevrier” “mois de Février”
59:
Page “öffenthich kundthun; “öffentlich kundthun;
60: und” und”
Page “Sie noch nene “Sie noch neue
60: Rondos” Rondos”
Page “niemand etwas “niemand etwas
60: nachgedcrukt” nachgedruckt”
Page “einen solchen “einen solchen
60: Nachdrucken” Nachdrucker”
Page
“Eerlaubnis zu Ihrem” “Erlaubnis zu Ihrem”
60:
Page
“4. Quartete, Clarinet” “4. Quartette, Clarinet”
64:
Page “evidentally not “evidentially not
78: personally” personally”
“Sammelbaende der “Sammelbände der
Page
Internationalen Musik- Internationalen
80:
Gesellschaft” Musikgesellschaft”
Page “states that Philip
“states that Philp Roth”
80: Roth”
Page
“24. “Spanish Barber”” “25. “Spanish Barber””
86:
Footnote Corrections:
Italics for Footnotes 158-162, 164 were
standardized.
“Sasche, Justus “Sachse, Justus
32:
Falckner” Falckner”
55: “Hist., XVI” “Hist., Vol. XVI”
“The Voyage, Shiprack “The Voyage,
76:
and” Shipwreck and”
78: “March 5-14, 172-7/8” “March 5-14, 1727-8”
80: “Hist. of Phita.” “Hist. of Phila.”
88: “Haendel & Haydn” “Handel & Haydn”
112: “P. Gazette, May 1” “Pa. Gazette, May 1”
115: “Mittelbergers Journey” “Mittelberger’s Journey”
224: “History of Stage” “History of the Stage”
“Personal “Personal
229:
Recollections” Recollections”
“Sammelbaender “Sammelbände der
257: Internationalen Musik Internationalen
Gesellschaft” Musikgesellschaft”
*** END OF THE PROJECT GUTENBERG EBOOK EARLY
GERMAN MUSIC IN PHILADELPHIA ***

Updated editions will replace the previous one—the old editions

will be renamed.

Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright
in these works, so the Foundation (and you!) can copy and
distribute it in the United States without permission and without
paying copyright royalties. Special rules, set forth in the General
Terms of Use part of this license, apply to copying and
distributing Project Gutenberg™ electronic works to protect the
PROJECT GUTENBERG™ concept and trademark. Project
Gutenberg is a registered trademark, and may not be used if
you charge for an eBook, except by following the terms of the
trademark license, including paying royalties for use of the
Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is
very easy. You may use this eBook for nearly any purpose such
as creation of derivative works, reports, performances and
research. Project Gutenberg eBooks may be modified and
printed and given away—you may do practically ANYTHING in
the United States with eBooks not protected by U.S. copyright
law. Redistribution is subject to the trademark license, especially
commercial redistribution.

START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
 PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK

To protect the Project Gutenberg™ mission of promoting the

free distribution of electronic works, by using or distributing this
work (or any other work associated in any way with the phrase
“Project Gutenberg”), you agree to comply with all the terms of
the Full Project Gutenberg™ License available with this file or
online at www.gutenberg.org/license.

Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand,
agree to and accept all the terms of this license and intellectual
property (trademark/copyright) agreement. If you do not agree to
abide by all the terms of this agreement, you must cease using
and return or destroy all copies of Project Gutenberg™
electronic works in your possession. If you paid a fee for
obtaining a copy of or access to a Project Gutenberg™
electronic work and you do not agree to be bound by the terms
of this agreement, you may obtain a refund from the person or
entity to whom you paid the fee as set forth in paragraph 1.E.8.

1.B. “Project Gutenberg” is a registered trademark. It may only

be used on or associated in any way with an electronic work by
people who agree to be bound by the terms of this agreement.
There are a few things that you can do with most Project
Gutenberg™ electronic works even without complying with the
full terms of this agreement. See paragraph 1.C below. There
are a lot of things you can do with Project Gutenberg™
electronic works if you follow the terms of this agreement and
help preserve free future access to Project Gutenberg™
electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright
law in the United States and you are located in the United
States, we do not claim a right to prevent you from copying,
distributing, performing, displaying or creating derivative works
based on the work as long as all references to Project
Gutenberg are removed. Of course, we hope that you will
support the Project Gutenberg™ mission of promoting free
access to electronic works by freely sharing Project
Gutenberg™ works in compliance with the terms of this
agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms
of this agreement by keeping this work in the same format with
its attached full Project Gutenberg™ License when you share it
without charge with others.

1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside
the United States, check the laws of your country in addition to
the terms of this agreement before downloading, copying,
displaying, performing, distributing or creating derivative works
based on this work or any other Project Gutenberg™ work. The
Foundation makes no representations concerning the copyright
status of any work in any country other than the United States.

1.E. Unless you have removed all references to Project

Gutenberg:

1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project
Gutenberg™ work (any work on which the phrase “Project
Gutenberg” appears, or with which the phrase “Project
Gutenberg” is associated) is accessed, displayed, performed,
viewed, copied or distributed:

This eBook is for the use of anyone anywhere in the United

States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it
away or re-use it under the terms of the Project Gutenberg
License included with this eBook or online at
www.gutenberg.org. If you are not located in the United
States, you will have to check the laws of the country where
you are located before using this eBook.

1.E.2. If an individual Project Gutenberg™ electronic work is

derived from texts not protected by U.S. copyright law (does not
contain a notice indicating that it is posted with permission of the
copyright holder), the work can be copied and distributed to
anyone in the United States without paying any fees or charges.
If you are redistributing or providing access to a work with the
phrase “Project Gutenberg” associated with or appearing on the
work, you must comply either with the requirements of
paragraphs 1.E.1 through 1.E.7 or obtain permission for the use
of the work and the Project Gutenberg™ trademark as set forth
in paragraphs 1.E.8 or 1.E.9.

1.E.3. If an individual Project Gutenberg™ electronic work is

posted with the permission of the copyright holder, your use and
distribution must comply with both paragraphs 1.E.1 through
1.E.7 and any additional terms imposed by the copyright holder.
Additional terms will be linked to the Project Gutenberg™
License for all works posted with the permission of the copyright
holder found at the beginning of this work.

1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files
containing a part of this work or any other work associated with
Project Gutenberg™.
 1.E.5. Do not copy, display, perform, distribute or redistribute
this electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1
with active links or immediate access to the full terms of the
Project Gutenberg™ License.

1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must, at
no additional cost, fee or expense to the user, provide a copy, a
means of exporting a copy, or a means of obtaining a copy upon
request, of the work in its original “Plain Vanilla ASCII” or other
form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.

1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™
works unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8. You may charge a reasonable fee for copies of or

providing access to or distributing Project Gutenberg™
electronic works provided that:

• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
 about donations to the Project Gutenberg Literary Archive
Foundation.”

• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.

• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.

• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.

1.E.9. If you wish to charge a fee or distribute a Project

Gutenberg™ electronic work or group of works on different
terms than are set forth in this agreement, you must obtain
permission in writing from the Project Gutenberg Literary
Archive Foundation, the manager of the Project Gutenberg™
trademark. Contact the Foundation as set forth in Section 3
below.

1.F.

1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on,
transcribe and proofread works not protected by U.S. copyright
law in creating the Project Gutenberg™ collection. Despite
these efforts, Project Gutenberg™ electronic works, and the
medium on which they may be stored, may contain “Defects,”
such as, but not limited to, incomplete, inaccurate or corrupt
data, transcription errors, a copyright or other intellectual
property infringement, a defective or damaged disk or other