Universal Quantifiers
Learn about universal quantifiers and how they are used with predicates to produce powerful mathematical statements.
We'll cover the following
Motivation
We make a proposition from a predicate by assigning a particular value to its variable(s). The value we can give to a variable is from a domain. We can also make a proposition from a predicate without assigning a particular value to its variable. One way to do so is by referring to all the domain elements. Universally quantifying a predicate means that the proposition resulting from that predicate is true for every element of the domain. Therefore, we get a proposition by applying a universal quantifier to a predicate. The motivation is to make propositions without referring to a particular domain element.
Universal quantifier
We use universal quantifiers to claim that every domain member has the property mentioned by a predicate. They quantify a variable in a predicate for a particular domain. To say that every student in discrete math class has passed twelfth grade or equivalent, we make a predicate .
- : has passed twelfth grade or equivalent.
To say that every in discrete math class has the property , we need to quantify it. We use the symbol to represent universal quantification, and we read this symbol as “for all.”
- : For all .
The domain of this quantification is the discrete math class. The meaning of is as above, but the part, “,” requires a domain to make sense. Once the domain is explicit, refers to each member of it.
Assume the domain, , has elements. That is,
For some arbitrary predicate , we can interpret as follows:
That means is true if and only if is true for every domain element. This way, we can intuitively think about the universal quantifier as a big conjunction of instantiated predicates.
If a predicate has more than one variable, for example, , we can universally quantify each of them as follows:
- For all and for all and for all ,
Truth value
The statement is true when every element from the considered domain has the property . It is false if we can show at least one element from the domain that does not have the property . We call such an element a counterexample.
Let’s look at a few examples to clarify further the concept of universal quantification and the truth value of quantified statements.
Examples
Let’s take a look at a few examples.
Consider the following predicate:
- : The student is at least 16 years old.
Assume that the domain is the department of computer science at Oxford University. We can quantify as follows:
- : Every student (in the computer science department) is at least 16 years old.
Be cautious about the domain while interpreting this statement; it can change the meaning and the truth value of the statement.
Get hands-on with 1200+ tech skills courses.