# Vacuous truth

__: Conditional statement which is true because the antecedent cannot be satisfied__

**Short description**In mathematics and logic, a **vacuous truth** is a conditional or universal statement (a universal statement that can be converted to a conditional statement) that is true because the antecedent cannot be satisfied.^{[1]}
It is sometimes said that a statement is vacuously true because it does not really say anything.^{[2]} For example, the statement "all cell phones in the room are turned off" will be true when no cell phones are present in the room. In this case, the statement "all cell phones in the room are turned *on*" would also be vacuously true, as would the conjunction of the two: "all cell phones in the room are turned on *and* turned off", which would otherwise be incoherent and false.

More formally, a relatively well-defined usage refers to a conditional statement (or a universal conditional statement) with a false antecedent.^{[1]}^{[3]}^{[2]}^{[4]} One example of such a statement is "if Tokyo is in Spain, then the Eiffel Tower is in Bolivia".

Such statements are considered vacuous truths, because the fact that the antecedent is false prevents using the statement to infer anything about the truth value of the consequent. In essence, a conditional statement, that is based on the material conditional, is true when the antecedent ("Tokyo is in Spain" in the example) is false regardless of whether the conclusion or consequent ("the Eiffel Tower is in Bolivia" in the example) is true or false because the material conditional is defined in that way.

Examples common to everyday speech include conditional phrases used as idioms of improbability like "when hell freezes over ..." and "when pigs can fly ...", indicating that not before the given (impossible) condition is met will the speaker accept some respective (typically false or absurd) proposition.

In pure mathematics, vacuously true statements are not generally of interest by themselves, but they frequently arise as the base case of proofs by mathematical induction.^{[5]} This notion has relevance in pure mathematics, as well as in any other field that uses classical logic.

Outside of mathematics, statements which can be characterized informally as vacuously true can be misleading. Such statements make reasonable assertions about qualified objects which do not actually exist. For example, a child might truthfully tell their parent "I ate every vegetable on my plate", when there were no vegetables on the child's plate to begin with. In this case, the parent can believe that the child has actually eaten some vegetables, even though that is not true. In addition, a vacuous truth is often used colloquially with absurd statements, either to confidently assert something (e.g. "the dog was red, or I'm a monkey's uncle" to strongly claim that the dog was red), or to express doubt, sarcasm, disbelief, incredulity or indignation (e.g. "yes, and I'm the King of England" to disagree with a previously made statement).

## Scope of the concept

A statement [math]\displaystyle{ S }[/math] is "vacuously true" if it resembles a material conditional statement [math]\displaystyle{ P \Rightarrow Q }[/math], where the antecedent [math]\displaystyle{ P }[/math] is known to be false.^{[1]}^{[3]}^{[2]}

Vacuously true statements that can be reduced (with suitable transformations) to this basic form (material conditional) include the following universally quantified statements:

- [math]\displaystyle{ \forall x: P(x) \Rightarrow Q(x) }[/math], where it is the case that [math]\displaystyle{ \forall x: \neg P(x) }[/math].
^{[4]} - [math]\displaystyle{ \forall x \in A: Q(x) }[/math], where the set [math]\displaystyle{ A }[/math] is empty.
- This logical form [math]\displaystyle{ \forall x \in A: Q(x) }[/math] can be converted to the material conditional form in order to easily identify the antecedent. For the above example [math]\displaystyle{ S }[/math] "all cell phones in the room are turned off", it can be formally written as [math]\displaystyle{ \forall x \in A: Q(x) }[/math] where [math]\displaystyle{ A }[/math] is the set of all cell phones in the room and [math]\displaystyle{ Q(x) }[/math] is "[math]\displaystyle{ x }[/math] is turned off". This can be written to a material conditional statement [math]\displaystyle{ \forall x \in B: P(x) \Rightarrow Q(x) }[/math] where [math]\displaystyle{ B }[/math] is the set of all things in the room (including cell phones if they exist in the room), the antecedent [math]\displaystyle{ P(x) }[/math] is "[math]\displaystyle{ x }[/math] is a cell phone", and the consequent [math]\displaystyle{ Q(x) }[/math] is "[math]\displaystyle{ x }[/math] is turned off".

- [math]\displaystyle{ \forall \xi: Q(\xi) }[/math], where the symbol [math]\displaystyle{ \xi }[/math] is restricted to a type that has no representatives.

Vacuous truths most commonly appear in classical logic with two truth values. However, vacuous truths can also appear in, for example, intuitionistic logic, in the same situations as given above. Indeed, if [math]\displaystyle{ P }[/math] is false, then [math]\displaystyle{ P \Rightarrow Q }[/math] will yield a vacuous truth in any logic that uses the material conditional; if [math]\displaystyle{ P }[/math] is a necessary falsehood, then it will also yield a vacuous truth under the strict conditional.

Other non-classical logics, such as relevance logic, may attempt to avoid vacuous truths by using alternative conditionals (such as the case of the counterfactual conditional).

## In computer programming

Many programming environments have a mechanism for querying if every item in a collection of items satisfies some predicate. It is common for such a query to always evaluate as true for an empty collection. For example:

- In JavaScript, the array method
`every`

executes a provided callback function once for each element present in the array, only stopping (if and when) it finds an element where the callback function returns false. Notably, calling the`every`

method on an empty array will return true for any condition.^{[6]} - In Python, the
`all`

function returns`True`

if all of the elements of the given iterable are`True`

. The function also returns`True`

when given an iterable of zero length.^{[7]} - In Rust, the
`Iterator::all`

function accepts an iterator and a predicate and returns`true`

only when the predicate returns`true`

for all items produced by the iterator, or if the iterator produces no items.^{[8]}

## Examples

These examples, one from mathematics and one from natural language, illustrate the concept of vacuous truths:

- "For any integer
*x*, if*x*> 5 then*x*> 3."^{[9]}– This statement is true non-vacuously (since some integers are indeed greater than 5), but some of its implications are only vacuously true: for example, when*x*is the integer 2, the statement implies the vacuous truth that "if 2 > 5 then 2 > 3". - "All my children are goats" is a vacuous truth, when spoken by someone without children. Similarly, "None of my children is a goat" would also be a vacuous truth, when spoken by the same person.

## See also

- De Morgan's laws – specifically the law that a universal statement is true just in case no counterexample exists: [math]\displaystyle{ \forall x \, P(x) \equiv \neg \exists x \, \neg P(x) }[/math]
- Empty sum and empty product
- Empty function
- Paradoxes of material implication, especially the principle of explosion
- Presupposition, double question
- State of affairs
- Tautology (logic) – another type of true statement that also fails to convey any substantive information
- Triviality (mathematics) and degeneracy (mathematics)

## References

- ↑
^{1.0}^{1.1}^{1.2}"Vacuously true". http://web.cse.ohio-state.edu/~patel.2004/Glossary/HTML_Files/vacuously_true.html. - ↑
^{2.0}^{2.1}^{2.2}"Vacuously true - CS2800 wiki". https://courses.cs.cornell.edu/cs2800/wiki/index.php/Vacuously_true. - ↑
^{3.0}^{3.1}"Definition:Vacuous Truth – ProofWiki". https://proofwiki.org/wiki/Definition:Vacuous_Truth. - ↑
^{4.0}^{4.1}Edwards, C. H. (January 18, 1998). "Vacuously True". http://www.swarthmore.edu/NatSci/smaurer1/Math18H/vacuous.pdf. - ↑ Baldwin, Douglas L.; Scragg, Greg W. (2011),
*Algorithms and Data Structures: The Science of Computing*, Cengage Learning, p. 261, ISBN 978-1-285-22512-8, https://books.google.com/books?id=ETA9AAAAQBAJ&pg=PA261 - ↑ "Array.prototype.every() - JavaScript | MDN". https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/every.
- ↑ "Built-in Functions – Python 3.10.2 documentation". https://docs.python.org/3/library/functions.html#all.
- ↑ "Iterator in std::iter – Rust". https://doc.rust-lang.org/std/iter/trait.Iterator.html#method.all.
- ↑ "logic – What precisely is a vacuous truth?". https://math.stackexchange.com/questions/734418/what-precisely-is-a-vacuous-truth.

## Bibliography

- Blackburn, Simon (1994). "vacuous",
*The Oxford Dictionary of Philosophy*. Oxford: Oxford University Press, p. 388. - David H. Sanford (1999). "implication".
*The Cambridge Dictionary of Philosophy*, 2nd. ed., p. 420. - Beer, Ilan; Ben-David, Shoham; Eisner, Cindy; Rodeh, Yoav (1997). "Computer Aided Verification: 9th International Conference, CAV'97 Haifa, Israel, June 22–25, 1997, Proceedings".
**1254**. pp. 279–290. doi:10.1007/3-540-63166-6_28. ISBN 978-3-540-63166-8. http://citeseer.ist.psu.edu/beer97efficient.html.

## External links

Original source: https://en.wikipedia.org/wiki/Vacuous truth.
Read more |