Universal quantification

Key takeaways

Universal quantification belongs to astronomy; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Universal quantification to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Universal quantification from memory before moving on to harder problems.

Reference excerpt

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", "for every", or "given an arbitrary element". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable. It is usually denoted by the turned A (∀) logical operator symbol, which, when used together with a predicate variable, is called a universal quantifier ("∀x", "∀(x)", or sometimes by "(x)" alone). Universal quantification is distinct from existential quantification ("there exists"), which only asserts that the property or relation holds for at least one member of the domain. Quantification in general is covered in the article on quantification (logic). The universal quantifier is encoded as U+2200 ∀ FOR ALL in Unicode, and as \forall in LaTeX and related formula editors.

Basics Suppose it is given that

2·0 = 0 + 0, and 2·1 = 1 + 1, and 2·2 = 2 + 2, ..., and 2 · 100 = 100 + 100, and ..., etc. This would seem to be an infinite logical conjunction because of the repeated use of "and". However, the "etc." cannot be interpreted as a conjunction in formal logic, Instead, the statement must be rephrased:

For all natural numbers n, one has 2·n = n + n. This is a single statement using universal quantification. This statement can be said to be more precise than the original one. While the "etc." informally includes natural numbers, and nothing more, this was not rigorously given. In the universal quantification, on the other hand, the natural numbers are mentioned explicitly. This particular example is true, because any natural number could be substituted for n and the statement "2·n = n + n" would be true. In contrast,

For all natural numbers n, one has 2·n > 2 + n is false, because if n is substituted with, for instance, 1, the statement "2·1 > 2 + 1" is false. It is immaterial that "2·n > 2 + n" is true for most natural numbers n: even the existence of a single counterexample is enough to prove the universal quantification false. On the other hand, for all composite numbers n, one has 2·n > 2 + n is true, because none of the counterexamples are composite numbers. This indicates the importance of the domain of discourse, which specifies which values n can take. In particular, note that if the domain of discourse is restricted to consist only of those objects that satisfy a certain predicate, then for universal quantification this requires a logical conditional. For example,

For all composite numbers n, one has 2·n > 2 + n is logically equivalent to

For all natural numbers n, if n is composite, then 2·n > 2 + n. Here the "if ... then" construction indicates the logical conditional.

Notation In symbolic logic, the universal quantifier symbol ∀ {\displaystyle \forall } (a turned "A" in a sans-serif font, Unicode U+2200) is used to indicate universal quantification. It was first used in this way by Gerhard Gentzen in 1935, by analogy with Giuseppe Peano's ∃ {\displaystyle \exists } (turned E) notation for existential quantification and the later use of Peano's notation by Bertrand Russell. For example, if P(n) is the predicate "2·n > 2 + n" and N is the set of natural numbers, then

∀ n ∈ N P ( n ) {\displaystyle \forall n\!\in \!\mathbb {N} \;P(n)}

is the (false) statement

"for all natural numbers n, one has 2·n > 2 + n". Similarly, if Q(n) is the predicate "n is composite", then

∀ n ∈ N ( Q ( n ) → P ( n ) ) {\displaystyle \forall n\!\in \!\mathbb {N} \;{\bigl (}Q(n)\rightarrow P(n){\bigr )}}

is the (true) statement

"for all natural numbers n, if n is composite, then 2·n > 2 + n". Several variations in the notation for quantification (which apply to all forms) can be found in the Quantifier article.

Properties

Negation The negation of a universally quantified function is obtained by changing the universal quantifier into an existential quantifier and negating the quantified formula. That is,

¬ ∀ x P ( x ) is equivalent to ∃ x ¬ P ( x ) {\displaystyle \lnot \forall x\;P(x)\quad {\text{is equivalent to}}\quad \exists x\;\lnot P(x)}

where ¬ {\displaystyle \lnot } denotes negation. For example, if P(x) is the propositional function "x is married", then, for the set X of all living human beings, the universal quantification

Given any living person x, that person is married is written

∀ x ∈ X P ( x ) {\displaystyle \forall x\in X\,P(x)}

This statement is false. Truthfully, it is stated that

It is not the case that, given any living person x, that person is married or, symbolically:

¬ ∀ x ∈ X P ( x ) {\displaystyle \lnot \ \forall x\in X\,P(x)} . If the function P(x) is not true for every element of X, then there must be at least one element for which the statement is false. That is, the negation of ∀ x ∈ X P ( x ) {\displaystyle \forall x\in X\,P(x)} is logically equivalent to "There exists a living person x who is not married", or:

∃ x ∈ X ¬ P ( x ) {\displaystyle \exists x\in X\,\lnot P(x)}

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Universal quantification

Start with the simplest possible case. Write down what Universal quantification claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In astronomy, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Universal quantification before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Universal quantification ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Universal quantification

In research: Universal quantification appears in astronomy research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Universal quantification in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Universal quantification is common in secondary-school and first-year university syllabi. It links to neighbouring topics Logic symbols, Logical expressions, Quantifier (logic), so understanding it makes those chapters shorter.
In everyday life: Look for Universal quantification outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Universal quantification in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Universal quantification means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Universal quantification out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Universal quantification in simple terms?

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", "for every", or "given an arbitrary element". It expresses that a predicate can be satisfied by every member of a domain of discourse.

Why does Universal quantification matter?

Because it connects several astronomy ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Universal quantification?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Universal quantification.