2.4: Quantifiers and Negations
 Page ID
 7044
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{\!\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\ #1 \}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\ #1 \}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{\!\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{\!\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left#1\right}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)Preview Activity 1 (An Introduction to Quantifiers)
We have seen that one way to create a statement from an open sentence is to substitute a specific element from the universal set for each variable in the open sentence. Another way is to make some claim about the truth set of the open sentence. This is often done by using a quantifier. For example, if the universal set is \(\mathbb{R}\), then the following sentence is a statement.
For each real number \(x\), \(x^2 > 0\).
The phrase “For each real number x” is said to quantify the variable that follows it in the sense that the sentence is claiming that something is true for all real numbers. So this sentence is a statement (which happens to be false).
The phrase “for every” (or its equivalents) is called a universal quantifier. The phrase “there exists” (or its equivalents) is called an existential quantifier. The symbol \(\forall\) is used to denote a universal quantifier, and the symbol \(\exists\) is used to denote an existential quantifier.
Using this notation, the statement “For each real number \(x\), \(x^2\) > 0” could be written in symbolic form as: \((\forall x \in \mathbb{R}) (x^2 > 0)\). The following is an example of a statement involving an existential quantifier.
There exists an integer \(x\) such that \(3x  2 = 0\).
This could be written in symbolic form as
\((\exists x \in \mathbb{Z})(3x  2 = 0)\).
This statement is false because there are no integers that are solutions of the linear equation \(3x  2 = 0\). Table 2.4 summarizes the facts about the two types of quantifiers.
A statement involving  Often has the form  The statement is true provided that 

A universal quantifier: (\(\forall x, P(x)\))  "For every \(x\), \(P(x)\)," where \(P(x)\) is a predicate.  Every value of \(x\) in the universal set makes \(P(x)\) true. 
An existential quantifier: (\(\exists x, P(x)\))  "There exists an \(x\) such that \(P(x)\)," where \(P(x)\) is a predicate.  There is at least one value of \(x\) in the universal set that makes \(P(x)\) true. 
Table 2.4: Properties of Quantifiers
In effect, the table indicates that the universally quantified statement is true provided that the truth set of the predicate equals the universal set, and the existentially quantified statement is true provided that the truth set of the predicate contains at least one element.
Each of the following sentences is a statement or an open sentence. Assume that the universal set for each variable in these sentences is the set of all real numbers. If a sentence is an open sentence (predicate), determine its truth set. If a sentence is a statement, determine whether it is true or false.
 \((\forall a \in \mathbb{R})(a + 0 = a)\).
 \(3x 5 = 9\).
 \(\sqrt x \in \mathbb{R}\).
 \(sin(2x) = 2(sin x)(cos x)\).
 \((\forall x \in \mathbb{R})(sin(2x) = 2(sin x)(cos x))\).
 \((\exists x \in \mathbb{R})(x^2 + 1 = 0)\).
 \((\forall x \in \mathbb{R})(x^3 \ge x^2)\).
 \(x^2 + 1 =0\).
 If \(x^2 \ge 1\), then \(x \ge 1\).
 \((\forall x \in \mathbb{R})\) (If \(x^2 \ge 1\), then \(x \ge 1\)).
Preview Activity 2 (Attempting to Negate Quantified Statements)
 Consider the following statement written in symbolic form:
(\(\forall x \in \mathbb{Z}\)) (\(x\) is a multiple of 2).
(a) Write this statement as an English sentence.
(b) Is the statement true or false? Why?
(c) How would you write the negation of this statement as an English sentence?
(d) If possible, write your negation of this statement from part(2) symbolically (using a quantifier).  Consider the following statement written in symbolic form:
(\(\exists x \in \mathbb{Z}\)) (\(x^3 > 0\)).
(a) Write this statement as an English sentence.
(b) Is the statement true or false? Why?
(c) How would you write the negation of this statement as an English sentence?
(d) If possible, write your negation of this statement from part(2) symbolically (using a quantifier).
We introduced the concepts of open sentences and quantifiers in Section 2.3
Forms of Quantified Statements in English
There are many ways to write statements involving quantifiers in English. In some cases, the quantifiers are not apparent, and this often happens with conditional statements. The following examples illustrate these points. Each example contains a quantified statement written in symbolic form followed by several ways to write the statement in English.
 (\(\forall x \in \mathbb{R}\)) (\(x^2 > 0\)).
\(\bullet\) For each real number \(x\), \(x^2 > 0\).
\(\bullet\) The square of every real number is greater than 0.
\(\bullet\) The square of a real number is greater than 0.
\(\bullet\) If \(x \in \mathbb{R}\), then \(x^2 > 0\).
In the second to the last example, the quantifier is not stated explicitly. Care must be taken when reading this because it really does say the same thing as the previous examples. The last example illustrates the fact that conditional statements often contain a “hidden” universal quantifier.
If the universal set is \(\mathbb{R}\), then the truth set of the open sentence \(x^2 > 0\) is the set of all nonzero real numbers. That is, the truth set is
{\(x \in \mathbb{R}  x \ne 0\)}
So the preceding statements are false. For the conditional statement, the example using \(x = 0\) produces a true hypothesis and a false conclusion. This is a counterexample that shows that the statement with a universal quantifier is false.
 (\(\exists x \in \mathbb{R}\)) (\(x^2 = 5\)).
\(\bullet\) There exists a real number \(x\) such that \(x^2 = 5\).
\(\bullet\) \(x^2 = 5\) for some real number \(x\).
\(\bullet\) There is a real number whose square equals 5.
The second example is usually not used since it is not considered good writing practice to start a sentence with a mathematical symbol.
If the universal set is \(\mathbb{R}\), then the truth set of the predicate "\(x^2 = 5\)" is {\(sqrt 5\), \(sqrt 5\)}. So these are all true statements.
Negations of Quantified Statements
In Preview Activity \(\PageIndex{1}\), we wrote negations of some quantified statements. This is a very important mathematical activity. As we will see in future sections, it is sometimes just as important to be able to describe when some object does not satisfy a certain property as it is to describe when the object satisfies the property. Our next task is to learn how to write negations of quantified statements in a useful English form.
We first look at the negation of a statement involving a universal quantifier. The general form for such a statement can be written as (\(\forall x \in U\)) (\(P(x)\)), where \(P(x)\)is an open sentence and \(U\) is the universal set for the variable \(x\). When we write
\(\urcorner (\forall x \in U) [P(x)]\),
we are asserting that the statement \(\forall x \in U) [P(x)]\) is false. This is equivalent to saying that the truth set of the open sentence \(P(x)\) is not the universal set. That is, there exists an element x in the universal set \(U\) such that \(P(x)\) is false. This in turn means that there exists an element \(x\) in \(U\) such that \(\urcorner P(x)\) is true, which is equivalent to saying that \((\exists x \in U)[\urcorner P(x)]\) is true. This explains why the following result is true:
\(\urcorner (\forall x \in U) [P(x)] \equiv (\exists x \in U)[\urcorner P(x)]\)
Similarly, when we write
\(\urcorner (\exists x \in U) [P(x)]\)
we are asserting that the statement \((\exists x \in U) [P(x)]\) is false. This is equivalent to saying that the truth set of the open sentence \(P(x)\) is the empty set. That is, there is no element x in the universal set \(U\) such that \(P(x)\) is true. This in turn means that for each element \(x\) in \(U\), \(\urcorner P(x)\) is true, and this is equivalent to saying that \((\forall x \in U) [\urcorner P(x)]\) is true. This explains why the following result is true:
\(\urcorner (\exists x \in U) [P(x)] \equiv (\forall x \in U) [\urcorner P(x)]\)
We summarize these results in the following theorem.
For any open sentence \(P(x)\),
\(\urcorner (\forall x \in U) [P(x)] \equiv (\exists x \in U) [\urcorner P(x)]\), and
\(\urcorner (\exists x \in U) [P(x)] \equiv (\forall x \in U) [\urcorner P(x)]\)
Consider the following statement: \((\forall x \in \mathbb{R}) (x^3 \ge x^2)\).
We can write this statement as an English sentence in several ways. Following are two different ways to do so.
 For each real number \(x\), \(x^3 \ge x^2\).
 If \(x\) is a real number, then \(x^3\) is greater than or equal to \(x^2\).
The second statement shows that in a conditional statement, there is often a hidden universal quantifier. This statement is false since there are real numbers \(x\) for which \(x^3\) is not greater than or equal to \(x^2\). For example, we could use \(x = 1\) or \(x = \frac{1}{2}\). This means that the negation must be true. We can form the negation as follows:
\(\urcorner (\forall x \in \mathbb{R}) (x^3 \ge x^2) \equiv (\exists x \in \mathbb{R}) \urcorner (x^3 \ge x^2)\).
In most cases, we want to write this negation in a way that does not use the negation symbol. In this case, we can now write the open sentence \(\urcorner (x^3 \ge x^2)\) as (\(x^3 < x^2\)). (That is, the negation of “is greater than or equal to” is “is less than.”) So we obtain the following:
\(\urcorner (\forall x \in \mathbb{R}) (x^3 \ge x^2) \equiv (\exists x \in \mathbb{R}) (x^3 < x^2)\).
The statement \((\exists x \in \mathbb{R}) (x^3 < x^2)\) could be written in English as follows:
 There exists a real number \(x\) such that \(x^3 < x^2\).
 There exists an \(x\) such that \(x\) is a real number and \(x^3 < x^2\).
For each of the following statements
 Write the statement in the form of an English sentence that does not use the symbols for quantifiers.
 Write the negation of the statement in a symbolic form that does not use the negation symbol.
 Write the negation of the statement in the form of an English sentence that does not use the symbols for quantifiers.
 \((\forall a \in \mathbb{R}) (a + 0 = a)\).
 \((\forall x \in \mathbb{R}) [sin(2x) = 2(sin x)(cos x)]\).
 \((\forall x \in \mathbb{R}) (tan^2 x + 1 = sec^2 x)\).
 \((\exists x \in \mathbb{Q}) (x^2  3x  7 = 0)\).
 \((\exists x \in \mathbb{R}) (x^2 + 1 = 0)\).
 Answer

Add texts here. Do not delete this text first.
Counterexamples and Negations of Conditional Statements
The real number \(x = 1\) in the previous example was used to show that the statement \((\forall x \in \mathbb{R}) (x^3 \ge x^2)\) is false. This is called a counterexample to the statement. In general, a counterexample to a statement of the form \((\forall x) [P(x)]\) is an object a in the universal set \(U\) for which \(P(a)\) is false. It is an example that proves that \((\forall x) [P(x)]\) is a false statement, and hence its negation, \((\exists x) [\urcorner P(x)]\), is a true statement.
In the preceding example, we also wrote the universally quantified statement as a conditional statement. The number \(x = 1\) is a counterexample for the statement
If \(x\) is a real number, then \(x^3\) is greater than or equal to \(x^2\).
So the number 1 is an example that makes the hypothesis of the conditional statement true and the conclusion false. Remember that a conditional statement often contains a “hidden” universal quantifier. Also, recall that in Section 2.2 we saw that the negation of the conditional statement “If \(P\) then \(Q\)” is the statement “\(P\) and not \(Q\).” Symbolically, this can be written as follows:
\(\urcorner (P \to Q) \equiv P \wedge \urcorner Q\).
So when we specifically include the universal quantifier, the symbolic form of the negation of a conditional statement is
\(\urcorner (\forall x \in U) [P(x) \to Q(x)] \equiv (\exists x \in U) \urcorner [ P(x) \to Q(x)] \equiv (\exists x \in U) [P(x) \wedge \urcorner Q(x)]\).
That is,
\(\urcorner (\forall x \in U) [P(x) \to Q(x)] \equiv (\exists x \in U) [P(x) \wedge \urcorner Q(x)]\).
Use counterexamples to explain why each of the following statements is false.
 For each integer \(n\), (\(n^2 + n + 1\)) is a prime number.
 For each real number \(x\), if \(x\) is positive, then \(2x^2 > x\).
 Answer

Add texts here. Do not delete this text first.
Quantifiers in Definitions
Definitions of terms in mathematics often involve quantifiers. These definitions are often given in a form that does not use the symbols for quantifiers. Not only is it important to know a definition, it is also important to be able to write a negation of the definition. This will be illustrated with the definition of what it means to say that a natural number is a perfect square.
A natural number n is a perfect square provided that there exists a natural number \(k\) such that \(n = k^2\).
This definition can be written in symbolic form using appropriate quantifiers as follows:
A natural number n is a perfect square provided \((\exists k \in \mathbb{N}) (n = k^2)\).
We frequently use the following steps to gain a better understanding of a definition.
 Examples of natural numbers that are perfect squares are 1, 4, 9, and 81 since \(1 = 1^2\), \(4 = 2^2\), \(9 = 3^2\), and \(81 = 9^2\).
 Examples of natural numbers that are not perfect squares are 2, 5, 10, and 50.
 This definition gives two “conditions.” One is that the natural number \(n\) is a perfect square and the other is that there exists a natural number \(k\) such that \(n = k^2\). The definition states that these mean the same thing. So when we say that a natural number n is not a perfect square, we need to negate the condition that there exists a natural number k such that \(n = k^2\). We can use the symbolic form to do this.
\(\urcorner (\exists k \in \mathbb{N}) (n = k^2) \equiv (\forall k \in \mathbb{N}) (n \ne k^2)\)
Notice that instead of writing \(\urcorner (n = k^2)\), we used the equivalent form of (\(n \ne k^2\)). This will be easier to translate into an English sentence. So we can write,
A natural number \(n\) is not a perfect square provided taht for every natural number \(k\), \(n \ne k^2\).
The preceding method illustrates a good method for trying to understand a new definition. Most textbooks will simply define a concept and leave it to the reader to do the preceding steps. Frequently, it is not sufficient just to read a definition and expect to understand the new term. We must provide examples that satisfy the definition, as well as examples that do not satisfy the definition, and we must be able to write a coherent negation of the definition
An integer \(n\) is a multiple of 3 provided that there exists an integer \(k\) such that \(n = 3k\).
 Write this definition in symbolic form using quantifiers by completing the following:
An integer \(n\) is a multiple of 3 provided that ...  Give several examples of integers (including negative integers) that are multiples of 3.
 Give several examples of integers (including negative integers) that are not multiples of 3.
 Use the symbolic form of the definition of a multiple of 3 to complete the following sentence: “An integer \(n\) is not a multiple of 3 provided that . . . .”
 Without using the symbols for quantifiers, complete the following sentence: “An integer \(n\0 is not a multiple of 3 provide that . . . .”
 Answer

Add texts here. Do not delete this text first.
Statements with More than One Quantifier
When a predicate contains more than one variable, each variable must be quantified to create a statement. For example, assume the universal set is the set of integers, \(\mathbb{Z}\), and let \(P(x, y)\) be the predicate, “\(x + y = 0\).” We can create a statement from this predicate in several ways.
 \((\forall x \in \mathbb{Z})(\forall y \in \mathbb{Z}) (x + y = 0)\).
We could read this as,“ For all integers \(x\) and \(y\), \(x + y = 0\).” This is a false statement since it is possible to find two integers whose sum is not zero \(2 + 3 \ne 0\).  \((\forall x \in \mathbb{Z})(\exists y \in \mathbb{Z}) (x + y = 0)\).
We could read this as, “For every integer \(x\), there exists an integer \(y\) such that \(x + y = 0\).” This is a true statement.  \((\exists x \in \mathbb{Z})(\forall y \in \mathbb{Z}) (x + y = 0)\).
We could read this as, “There exists an integer \(x\) such that for each integer \(y\), \(x + y = 0\).” This is a false statement since there is no integer whose sum with each integer is zero.  \((\exists x \in \mathbb{Z})(\exists y \in \mathbb{Z}) (x + y = 0)\).
We could read this as, “There exist integers \(x\) and y such that \(x + y = 0\).” This is a true statement. For example, \(2 + (2) = 0\)
When we negate a statement with more than one quantifier, we consider each quantifier in turn and apply the appropriate part of Theorem 2.16. As an example, we will negate Statement (3) from the preceding list. The statement is
\((\exists x \in \mathbb{Z})(\forall y \in \mathbb{Z}) (x + y = 0)\).
We first treat this as a statement in the following form: \((\exists x \in \mathbb{Z}) (P(x))\) where \(P(x)\) is the predicate \((\forall y \in \mathbb{Z}) (x + y = 0)\). Using Theorem 2.16, we have
\(\urcorner (\exists x \in \mathbb{Z}) (P(x)) \equiv (\forall x \in \mathbb{Z}) (\urcorner P(x))\).
Using Theorem 2.16 again, we obtain the following:
\(\urcorner P(x) \equiv \urcorner (\forall y \in \mathbb{Z}) (x + y =0)\)
\(\equiv (\exists y \in \mathbb{Z}) \urcorner (x + y =0)\)
\(\equiv (\exists y \in \mathbb{Z}) (x + y \ne 0)\).
Combining these two results, we obtain
\(\urcorner (\exists x \in \mathbb{Z})(\forall y \in \mathbb{Z}) (x + y = 0) \equiv (\forall x \in \mathbb{Z}) (\exists y \in \mathbb{Z}) (x + y \ne 0)\).
The results are summarized in the following table.
Symbolic Form  English Form  
Statement  \((\exists x \in \mathbb{Z})(\forall y \in \mathbb{Z}) (x + y = 0)\)  There exists an integer \(x\) such that for each integer \(y\), \(x + y = 0\). 
Negation  \((\forall x \in \mathbb{Z}) (\exists y \in \mathbb{Z}) (x + y \ne 0)\)  For each integer \(x\), there exists an integer \(y\) such that \(x + y \ne 0\). 
Since the given statement is false, its negation is true.
We can construct a similar table for each of the four statements. The next table shows Statement (2), which is true, and its negation, which is false.
Symbolic Form  English Form  
Statement  \((\exists x \in \mathbb{Z})(\forall y \in \mathbb{Z}) (x + y = 0)\)  For every integer \(x\), there exists an integer \(y\) such that \(x + y = 0\). 
Negation  \((\forall x \in \mathbb{Z}) (\exists y \in \mathbb{Z}) (x + y \ne 0)\)  There exists an integer \(x\) such that for every integer \(y\), \(x + y \ne 0\). 
Write the negation of the statement
\((\forall x \in \mathbb{Z})(\forall y \in \mathbb{Z}) (x + y = 0)\)
in symbolic form and as a sentence written in English.
 Answer

Add texts here. Do not delete this text first.
Writing Guideline
Try to use English and minimize the use of cumbersome notation. Do not use the special symbols for quantifiers \(\forall\) (for all), \(\exists\) (there exists), \(backepsilon\) (such that), or \(\therefore\) (therefore) in formal mathematical writing. It is often easier to write and usually easier to read, if the English words are used instead of the symbols. For example, why make the reader interpret
\((\forall x \in \mathbb{R})(\exists y \in \mathbb{R}) (x + y = 0)\)
when it is possible to write
For each real number \(x\), there exists a real number \(y\) such that \(x + y = 0\), or, more succinctly (if appropriate),
Every real number has an additive inverse.
 For each of the following, write the statement as an English sentence and then explain why the statement is false.
(a) \((\exists x \in \mathbb{Q}) (x^2  3x  7 = 0)\).
(b) \((\exists x \in \mathbb{R}) (x^2 + 1 = 0)\).
(c) \((\exists m \in \mathbb{N}) (m^ < 1)\).  For each of the following, use a counterexample to show that the statement is false. Then write the negation of the statement in English, without using symbols for quantifiers.
(a) \((\forall m \in \mathbb{Z})\) (\(m^2\) is even).
(b)\((\forall x \in \mathbb{R}) (x^2 > 0)\).
(c) For each real number \(x\), \(\sqrt x \in \mathbb{R}\).
(d) \((\forall m \in \mathbb{Z}) (\dfrac{m}{3} \in \mathbb{Z})\).
(e) \((\forall a \in \mathbb{Z}) (\sqrt {a^2} = a)\).
(f) \((\forall x \in \mathbb{R}) (tan^2 x + 1 = sec^2 x)\).  For each of the following statements
\(\bullet\) Write the statement as an English sentence that does not use the symbols for quantifiers.
\(\bullet\) Write the negation of the statement in symbolic form in which the negation symbol is not used.
\(\bullet\) Write a useful negation of the statement in an English sentence that does not use the symbols for quantifiers.
(a) \((\exists x \in \mathbb{Q}) (x > \sqrt 2)\).
(b) \((\forall x \in \mathbb{Q}) (x^2  2 \ne 0)\).
(c) \((\forall x \in \mathbb{Z})\) (\(x\) is even or \(x\) is odd).
(d) \((\exists x \in \mathbb{Q}) (\sqrt 2 < x < \sqrt 3)\). Note: The sentence "\(\sqrt 2 < x < \sqrt 3\)" is actually a conjunction. It means \(\sqrt 2 < x\) and \(x < \sqrt 3\).
(e) \((\forall x \in \mathbb{Z})\) (If \(x^2\) is odd, then \(x\) is odd).
(f) \((\forall n \in \mathbb{N})\) [If \(n\) is a perfect sqare, then (\(2^n 1\)) is not a prime number].
(g) \((\forall n \in \mathbb{N})\) (\(n^2 n + 41\) is a prime number).
(h) \((\exists x \in \mathbb{R}) (cos(2x) = 2(cos x))\).  Write each of the following statements as an English sentence that does not use the symbols for quantifiers.
(a) \((\exists m \in \mathbb{Z}) (\exists n \in \mathbb{Z}) (m > n)\)
(b) \((\exists m \in \mathbb{Z}) (\forall n \in \mathbb{Z}) (m > n)\)
(c) \((\forall m \in \mathbb{Z}) (\exists n \in \mathbb{Z}) (m > n)\)
(d) \((\forall m \in \mathbb{Z}) (\forall n \in \mathbb{Z}) (m > n)\)
(e) \((\exists m \in \mathbb{Z}) (\forall n \in \mathbb{Z}) (m^2 > n)\)
(f) \((\forall m \in \mathbb{Z}) (\exists n \in \mathbb{Z}) (m^2 > n)\)  Write the negation of each statement in Exercise (4) in symbolic form and as an English sentence that does not use the symbols for quantifiers.
 Assume that the universal set is \(\mathbb{Z}\). Consider the following sentence:
\((\exists t \in \mathbb{Z}) (t \cdot x = 20)\).
(a) Explain why this sentence is an open sentence and not a statement.
(b) If 5 is substituted for \(x\), is the resulting sentence a statement? If it is a statement, is the statement true or false?
(c) If 8 is substituted for \(x\), is the resulting sentence a statement? If it is a statement, is the statement true or false?
(d) If 2 is substituted for \(x\), is the resulting sentence a statement? If it is a statement, is the statement true or false?
(e) What is the truth set of the open sentence \((\exists t \in \mathbb{Z}) (t \cdot x = 20)\)?  Assume that the universal set is \(\mathbb{R}\). Consider the following sentence:
\((\exists t \in \mathbb{R}) (t \cdot x = 20)\).
(a) Explain why this sentence is an open sentence and not a statement.
(b) If 5 is substituted for \(x\), is the resulting sentence a statement? If it is a statement, is the statement true or false?
(c) If \(\pi\) is substituted for \(x\), is the resulting sentence a statement? If it is a statement, is the statement true or false?
(d) If 0 is substituted for \(x\), is the resulting sentence a statement? If it is a statement, is the statement true or false?
(e) What is the truth set of the open sentence \((\exists t \in \mathbb{R}) (t \cdot x = 20)\)?  Let \(\mathbb{Z^*}\) be the set of all nonzero integers.
(a) Use a counterexample to explain why the following statement is false:
For each \(x \in \mathbb{Z^*}\), there exists a \(y \in \mathbb{Z^*}\) such that \(xy = 1\).
(b) Write the statement in part(a) in symbolic form using appropriate symbols for quantifiers.
(c) Write the negation of the statement in part (b) in symbolic form using appropriate symbols for quantifiers.
(d) Write the negation from part(c) in English without usings the symbols for quantifiers.  An integer \(m\) is said to have the divides property provided that for all integers \(a\) and \(b\), if \(m\) divides \(ab\), then \(m\) divides \(a\) or \(m\) divides \(b\).
(a) Using the symbols for quantifiers, write what it means to say that the integer \(m\) has the divides property.
(b) Using the symbols for quantifiers, write what it means to say that the integer \(m\) does not have the divides property.
(c) Write an English sentence stating what it means to say that the integer \(m\) does not have the divides property.  In calculus, we define a function \(f\) with domain \(\mathbb{R}\) to be strictly increasing provided that for all real numbers \(x\) and \(y\), \(f(x) < f(y)\) whenever \(x < y\). Complete each of the following sentences using the appropriate symbols for quantifiers:
(a) A function \(f\) with domain \(\mathbb{R}\) is strictly increasing provided that ...
(b) A function \(f\) with domain \(\mathbb{R}\) is not strictly increasing provided that ...
Complete the following sentence in English without using symbols for quantifiers:
(c) A function \(f\) with domain \(\mathbb{R}\) is not strictly increasing provided that ...  In calculus, we define a function \(f\) to be continuous at a real number \(a\) provided that for every \(\varepsilon > 0\), there exists a \(\delta > 0\) such that if \(x  a < \delta\), then \( f(x)  f(a) < \varepsilon\).
Note: The symbol \(\varepsilon\) is the lowercase Greek letter epsilon, and the symbol \(\delta\) is the lowercase Greek letter delta.
Complete each of the following sentences using the appropriate symbols for quantifiers:
(a) A function \(f\) is continuous at the real number \(a\) provided that ...
(b) A function \(f\) is not continuous at the real number \(a\) provided that ...
Complete the following sentence in English without using symbols for quantifiers:
(c) A function \(f\) is not continuous at the real number \(a\) provided that ...  The following exercises contain definitions or results from more advanced mathematics courses. Even though we may not understand all of the terms involved, it is still possible to recognize the structure of the given statements and write a meaningful negation of that statement.
(a) In abstract algebra, an operation \(\ast\) on a set \(A\) is called a commutative operation provided that for all \(x, y \in A\), \(x \ast y = y \ast x\). Carefully explain what it means to say that an operation \(\ast\) on a set A is not a commutative operation.
(b) In abstract algebra, a ring consists of a nonempty set \(R\) and two operations called addition and multiplication. A nonzero element \(a\) in a ring \(R\) is called a zero divisor provided that there exists a nonzero element \(b\) in R such that \(ab = 0\). Carefully explain what it means to say that a nonzero element \(a\) in a ring \(R\) is not a zero divisor.
(c) A set \(M\) of real numbers is called a neighborhood of a real number aprovided that there exists a positive real number \(\epsilon\) such that the open interval (\(a  \epsilon, a + \epsilon\)) is contained in \(M\). Carefully explain what it means to say that a set \(M\) is not a neighborhood of a real number \(a\).
(d) In advanced calculus, a sequence of real numbers {\(x_1\), \(x_2\), ..., \(x_k\), ...} is called a Cauchy sequence provided that for each positive real number, there exists a natural number \(N\) such that for all \(m\); \(n \in \mathbb{N}\), if \(m > N\) and \(n > N\), then \(x_n  x_m < \epsilon\). Carefully explain what it means to say that the sequence of real numbers {\(x_1\), \(x_2\), ..., \(x_k\), ...} is not a Cauchy sequence.
Explorations and Activities  Prime Numbers. The following definition of a prime number is very important in many areas of mathematics. We will use this definition at various places in the text. It is introduced now as an example of how to work with a definition in mathematics.
A natural number \(p\) is a prime number provided that it is greater than 1 and the only natural numbers that are factors of \(p\) are 1 and \(p\). A natural number other than 1 that is not a prime number is a composite number. The number 1 is neither prime nor composite.
Using the definition of a prime number, we see that 2, 3, 5, and 7 are prime numbers. Also, 4 is a composite number since 4 = 2 \(\cdot\) 2; 10 is a composite number since 10 = 2 \(\cdot\) 5; and 60 is a composite number since 60 = 4 \(\cdot\) 15.
(a) Give examples of four natural numbers other than 2, 3, 5, and 7 that are prime numbers.
(b) Explain why a natural number \(p\) that is greater than 1 is a prime number provided that
For all \(d \in \mathbb{N}\), if \(d\) is a factor of \(p\), then \(d = 1\) or \(d = p\).
(c) Give examples of four natural numbers that are composite numbers and explain why they are composite numbers.
(d) Write a useful description of what it means to say that a natural number is a composite number (other than saying that it is not prime).  Upper Bounds for Subsets of \(\mathbb{R}\). Let \(A\) be a subset of the real numbers. A number \(b\) is called an upper bound for the set \(A\) provided that for each element \(x\) in \(A\), \(x \le b\).
(a) Write this definition in symbolic form by completing the following:
Let \(A\) be a subset of the real numbers. A number \(b\) is called an upper bound for the set \(A\) provided that ...
(b) Give examples of three different upper bounds for the set \(A\) = {\(x \in \mathbb{R}  1 \le x \le 3\)}.
(c) Does the set \(B\) = {\(x \in \mathbb{R}  x > 0\)} have an upper bound? Explain.
(d) Give examples of three different real numbers that are not upper bounds for the set \(A\) = {\(x \in \mathbb{R}  1 \le x \le 3\)}.
(e) Complete the following in symbolic form: “Let \(A\) be a subset of \(\mathbb{R}\). A number \(b\) is not an upper bound for the set \(A\) provided that ...”
(f) Without using the symbols for quantifiers, complete the following sentence: “Let \(A\) be a subset of \(\mathbb{R}\). A number \(b\) is not an upper bound for the set \(A\) provided that ...”
(g) Are your examples in Part(14d) consistent with your work in Part(14f)? Explain.  Least Upper Bound for a Subset of \(\mathbb{R}\). In Exercise 14, we introduced the definition of an upper bound for a subset of the real numbers. Assume that we know this definition and that we know what it means to say that a number is not an upper bound for a subset of the real numbers.
Let \(A\) be a subset of \(\mathbb{R}\). A real number ̨ is the least upper bound for A provided that \(\alpha\) is an upper bound for \(A\), and if \(\beta\) is an upper bound for \(A\), then \(\alpha \le \beta\).
Note: The symbol \(\alpha\) is the lowercase Greek letter alpha, and the symbol \(\beta\) is the lowercase Greek letter beta.If we define \(P(x)\) to be “\(x\) is an upper bound for \(A\),” then we can write the definition for least upper bound as follows:
A real number ̨ is the least upper bound for \(A\) provided that
\(P(\alpha) \wedge [(\forall \beta \in \mathbb{R}) (P(\beta) \to (\alpha \le \beta))]\).
(a) Why is a universal quantifier used for the real number \(\beta\)?
(b) Complete the following sentence in symbolic form: “A real number \(\alpha\) is not the least upper bound for \(A\) provided that ...
(c) Complete the following sentence as an English sentence: "A real number \(\alpha\) is not the least upper bound for \(A\) provided that ..."
 Answer

Add texts here. Do not delete this text first.