Difference between revisions of "Quantifiers"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
 
(6 intermediate revisions by one other user not shown)
Line 1: Line 1:
Quantifiers are words, expressions, or phrases that indicate the number of elements that a statement pertains to. In mathematical logic, there are two quantifiers: the universal quantifier ("for all") and the existential quantifier ("there exists").
+
Quantifiers are words, expressions, or phrases that indicate the number of elements that a statement pertains to. In mathematical logic, there are two main quantifiers: the universal quantifier ("for all") and the existential quantifier ("there exists").
  
Universal quantifier: This quantifier is used to state a proposition that is true for all variables x of a given set. For example, the proposition "x^2 is a nonnegative number" is true for all real numbers, so we state "for all <math> x \in \R </math>, <math> x^2 </math> is nonnegative". Symbolically, we write the universal quantifier as <math> \forall </math> (for example, <math> \forall x \in \R, x^2 \ge 0</math>).
+
Universal quantifier: This quantifier is used to state a proposition that is true for all variables x of a given set. For example, the proposition "x^2 is a nonnegative number" is true for every real number, so we state "for all real numbers <math> x </math>, <math> x^2 </math> is nonnegative". Symbolically, we write the universal quantifier as <math> \forall </math> (for example, <math> \forall x \in \R, x^2 \ge 0</math>).
==Resources==
+
 
* [https://math.libretexts.org/Courses/Monroe_Community_College/MATH_220_Discrete_Math/2%3A_Logic/2.7%3A_Quantiers Quantifiers], Mathematics LibreTexts
+
Existential quantifier: This quantifier is used to state a proposition that is at least true for one element x of a given set. For example, the proposition "x is greater than 7" is not true for all real numbers, but we know it is true for some. So, we state "there exists a real number x such that x is greater than 7". Symbolically, we write the universal quantifier as <math> \exists </math> (for example, <math> \exists x \in \R, x > 7 </math>).
 +
 
 +
If there exists exactly one element such that a proposition is true, we can denote this statement with the symbol <math> \exists! </math> (for example, <math> \exists! x \in \R </math> such that <math>  7x + 1 = 0 </math>, since there is exactly one solution to this equation).
 +
 
 +
If there exists no element such that a proposition is true, we can use the symbol <math> \nexists </math> (for example, <math> \nexists x \in \R </math> such that <math> 2x = 2x + 1 </math>).
 +
 
 +
Examples of how to use quantifiers:
 +
* <math> \forall n \in \N, n > 0 </math>
 +
* <math> \exists a,b \in \R, a + b = 0 </math>
 +
* <math> \exists! x \in \R, x^2 = 0 </math>
 +
* <math> \nexists z \in \R, z = \sqrt{(-1)} </math>
 +
 
 +
 
 +
== Licensing ==  
 +
Content obtained and/or adapted from:
 +
* [https://math.libretexts.org/Courses/Monroe_Community_College/MATH_220_Discrete_Math/2%3A_Logic/2.7%3A_Quantiers Quantifiers, Mathematics LibreTexts] under a CC BY-NC-SA license

Latest revision as of 14:22, 6 November 2021

Quantifiers are words, expressions, or phrases that indicate the number of elements that a statement pertains to. In mathematical logic, there are two main quantifiers: the universal quantifier ("for all") and the existential quantifier ("there exists").

Universal quantifier: This quantifier is used to state a proposition that is true for all variables x of a given set. For example, the proposition "x^2 is a nonnegative number" is true for every real number, so we state "for all real numbers , is nonnegative". Symbolically, we write the universal quantifier as (for example, ).

Existential quantifier: This quantifier is used to state a proposition that is at least true for one element x of a given set. For example, the proposition "x is greater than 7" is not true for all real numbers, but we know it is true for some. So, we state "there exists a real number x such that x is greater than 7". Symbolically, we write the universal quantifier as (for example, ).

If there exists exactly one element such that a proposition is true, we can denote this statement with the symbol (for example, such that , since there is exactly one solution to this equation).

If there exists no element such that a proposition is true, we can use the symbol (for example, such that ).

Examples of how to use quantifiers:


Licensing

Content obtained and/or adapted from: