Math 2.0

concept

Counterexample

Summary

A counterexample to a universal statement ∀x∈X, P(x)\forall x \in X, \, P(x) is an element a∈Xa \in X such that P(a)P(a) is false. One counterexample shows that the universal statement is false.

Remarks

The number 22 is a counterexample to "each prime number is odd". This works because of the negation of a universal statement: ¬∀x P(x)\neg \forall x \, P(x) is equivalent to ∃x ¬P(x)\exists x \, \neg P(x).

Explanations

L1 human

To show that a general claim is wrong, one bad case is enough. "Each continuous function is differentiable" is false: f(x)=∣x∣f(x) = |x| is continuous but not differentiable at 00.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 7 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Proposition concept
  2. Negation definition
  3. Predicate definition
  4. Existential quantifier definition
  5. Universal quantifier definition
  6. Negation of a universal statement statement
  7. Counterexample concept

Sources

  1. Web https://en.wikipedia.org/wiki/Counterexample, lead section