Statements and Implications

25 min · 7 drills

The tasks in this topic all look alike. A short assumption sits at the top, for instance that x and y are real numbers, five claims follow underneath, and the question asks which of them are correct (korrekt). The tick column beside them is headed "Richtig", and both words mean the same thing. There is barely any calculation. What you decide is what a claim actually claims, and what it takes to refute it.

The formula sheet (Formelsammlung) is no help here: it holds no rule of logic, and those you have to bring along. This article builds the logical pieces, from the counterexample through the implication to the quantifiers.

A statement is true or false, a statement form only once a value is inserted

Statement (Aussage)

A statement is a sentence that is either true or false, and exactly one of the two. "3<5" is a true statement, "3=5" a false one. The question "How large is x?" is not a statement, because there is nothing about it to judge.

Statement form (Aussageform)

A statement form contains a free variable and turns into a statement only once a value is inserted for that variable. It is written A(x). For the statement form A(x): "x2≥4", the value A(3) is true and A(1) is false.

The difference decides how you proceed. A statement you check by settling its truth value. In a statement form there is nothing to settle as long as nobody has said which values it is meant to hold for, and that is exactly what the exam prints above the five claims.

Your turn1 of 7

The statement form A(x): "x2<2x" is given. Which of the following statements is true?

"Correct" means correct for every admissible choice

Two claims accompany this section. All that is assumed is that two functions f and g take positive values only. The first claim reads "f(x)−g(x)<0", the second "f(x)⋅g(x)>0". Is each of them correct?

The assumption fixes what is being talked about: that x and y are real numbers, that a denominator is not zero, that two functions f and g take only positive values. A claim containing those letters is correct precisely when it holds for every choice the assumption allows. An invisible "for all" therefore stands in front of every claim, even where those words are missing.

An asymmetry follows from this, and it decides how much work a single claim costs.

What is to be shownWhat that takes
The claim is correctan argument that carries for every admissible choice
The claim is wrongone single admissible choice where it stops holding
Counterexample (Gegenbeispiel)

A counterexample is a choice of the letters permitted by the assumption for which the claim does not hold. One is enough, and a second one makes the matter no safer. Conversely, no example proves a claim about all values, however many examples happen to fit.

Back to the two claims from the start. The first is settled by a single choice: if f is constantly 3 and g is constantly 1, the difference is 2 and hence positive. The second, by contrast, holds, and here no example helps, only the argument: a product of two positive numbers is positive, and nothing beyond that positivity was used.

Your turn2 of 7

The claim 'If x<y, then x2<y2' is to be refuted. Which choice does that?

An implication fails in exactly one case

Implication (Implikation)

The implication A⇒B, read "B follows from A" or "if A, then B", claims that whenever A holds, B holds as well. About the case where A does not hold it claims nothing, and it therefore counts as satisfied there.

Of the four possible combinations exactly one makes the implication false.

ABA⇒B
truetruetrue
truefalsefalse
falsetruetrue
falsefalsetrue

A working instruction follows from this: a counterexample to an if-then claim must satisfy the if-part and violate the then-part, and both at the same time. To refute "If x2>4, then x>2" you therefore need a number with x2>4 that is not larger than 2: x=−3 satisfies 9>4, and −3 is not larger than 2. The number x=1 is no objection, because there the if-part is already false, and the claim says nothing about that case. The last two rows of the table also explain why an implication whose if-part never holds counts as correct: there is no case in which it promises anything false.

Your turn3 of 7

The claim 'If x⋅y>0, then x>0' is to be refuted. Which choice does that?

The converse, the contrapositive and the negation are three different sentences

Further sentences can be built from an implication, and the exam likes to place them side by side in one task. Two of them look alike, and only one of the two is equivalent to the original.

NameShapeRelation to A⇒B
Originalif A, then B
Converseif B, then Aindependent, can be true or false
Contrapositiveif B does not hold, then A does notalways equivalent
NegationA holds and B does nottrue precisely when A⇒B is false

The sketch shows which four sentences belong together. Follow the horizontal links: the sentences there always share the same truth value.

Four boxes: on top the original A ⇒ B and the contrapositive not B ⇒ not A, below the converse B ⇒ A and the contrapositive of the converse not A ⇒ not B. The horizontal links are labelled “equivalent”; the dashed vertical links mean no implication either way. Four boxes: on top the original A ⇒ B and the contrapositive not B ⇒ not A, below the converse B ⇒ A and the contrapositive of the converse not A ⇒ not B. The horizontal links are labelled “equivalent”; the dashed vertical links mean no implication either way.

Look at this with a sentence that holds: "If x>5, then x2>25." From x>5 and x>0, multiplying by x gives x2>5x first, and multiplying x>5 by 5 gives 5x>25. Together this gives x2>25. Three further sentences grow out of this one.

  • The converse reads "If x2>25, then x>5" and is false: x=−8 satisfies 64>25 yet does not exceed 5.
  • The contrapositive reads "If x2≤25, then x≤5" and is correct, because it claims the same thing as the original in a different order.
  • The negation reads "There is an x with x>5 and x2≤25" and is false, since the original sentence is correct.

In the exam this saves time. If two of the five claims are contrapositives of each other, both share a truth value and you only test one of them; if one is the negation of another, exactly one of the two is correct. Note the shape of the negation while you are at it: it is not an implication itself. "If A, then not B" does not negate "if A, then B", it forms a new sentence that can be just as false.

Your turn4 of 7

Which sentence is equivalent to 'If x2<9, then x<3'?

Necessary and sufficient are two readings of the same implication

Sufficient condition (hinreichende Bedingung)

A is sufficient for B when A⇒B holds. A is then enough to secure B. Whether B can also occur without A is left open.

Necessary condition (notwendige Bedingung)

B is necessary for A when A⇒B holds: without B there is no A. That is the contrapositive of the same implication, so not a second claim but the same one read from the other side.

WordingMeans
A is sufficient for BA⇒B
A is necessary for BB⇒A
A is necessary and sufficient for BA⇔B

For P: "x>5" and Q: "x2>25" this means: P is sufficient for Q, and Q is necessary for P. Both sentences say the same thing. P is not necessary for Q, however, because x=−8 satisfies Q without satisfying P.

Equivalence (Äquivalenz)

A⇔B, read "A if and only if B", claims both implications at once: A⇒B and B⇒A. If one of the two directions fails, the equivalence is wrong, however impeccably the other one may hold.

Test an equivalence twice, therefore. "x2=y2 if and only if ∣x∣=∣y∣" holds in both directions. "x2=y2 if and only if x=y" is wrong even though one direction is flawless: from x=y you reach equal squares, from equal squares you do not get back, as x=2 and y=−2 show.

Rearranging an equation raises the same question. Adding the same number to both sides, or multiplying both by the same non-zero number, can be undone and leaves the solution set alone. Multiplying by an expression that may be zero cannot be undone: a=b follows from a⋅t=b⋅t only for t≠0, because at t=0 the left side holds for every choice of a and b. Negating both sides, on the other hand, is allowed: from "A if and only if B" follows "not A if and only if not B", and the correct equivalence "x>0 if and only if −x<0" turns this way into the equally correct "x≤0 if and only if −x≥0".

Your turn5 of 7

What is the relation between P: 'x=3' and Q: 'x2=9'?

And, or, not: what makes a connective true

ABA and BA or B
truetruetruetrue
truefalsefalsetrue
falsetruefalsetrue
falsefalsefalsefalse

The "or" of mathematics includes the case where both parts hold; it is not an "either or". Hence A alone already gives "A or B", whereas "A or B" tells you nothing about A on its own, since the part that is true may be just B.

Negating a connective flips both parts and swaps the connecting word along the way. These two rules carry De Morgan's name.

not (A and B)⇔not A or not B
not (A or B)⇔not A and not B

When negating a comparison, it helps that exactly one of the relations <, =, > holds between two real numbers.

StatementNegation
x<yx≥y
x≤yx>y
x=yx≠y

Both rules work together on the statement form x2≥4. It holds precisely when x≥2 or x≤−2. Its negation x2<4 negates each part and trades "or" for "and": x<2 and x>−2, in short −2<x<2. And because exactly one of the three relations holds, "x>0 or x<0" does not hold for every real number: zero satisfies neither part.

In numbers, the "or" is most visible in the zero product, and more exam claims rest on this rule than on any other.

x⋅y=0⇔x=0 or y=0

Negate both sides, applying the second De Morgan rule as you go, and you get the version that appears just as often: x⋅y≠0 holds precisely when x≠0 and y≠0. Nothing comparable holds for sums, since 3+(−3)=0 shows a sum that is zero although neither summand is. As soon as the summands cannot be negative, though, the reasoning returns: from x2+y2=0 it follows that x=0 and y=0, because two non-negative numbers add up to zero only when each of them is zero.

Your turn6 of 7

Which inference holds for all real numbers x and y?

Quantifiers bind a statement form, and their order matters

Universal statement (Allaussage)

"For every x, A(x) holds" claims that the statement form is satisfied at every admissible value. It is refuted by one single x at which A(x) is false.

Existential statement (Existenzaussage)

"There is an x with A(x)" claims that at least one admissible value satisfies the statement form. It is proved by one such x; refuting it takes an argument that rules out every value.

ClaimHow it is provedHow it is refuted
for every x, A(x) holdsan argument for all xa counterexample
there is an x with A(x)one examplean argument against all x
there is exactly one such xan example plus proof that no second one existstwo examples, or an argument that there is none

Negating a universal statement produces an existential one, and the other way round. "Not for every x does A(x) hold" means the same as "there is an x for which A(x) is false". And "there is no x with A(x)" means the same as "for every x, A(x) is false". In the exam the second rule often appears in disguise: "There is no x for which A(x) is false" is nothing but the claim that A(x) holds for every x.

When two quantifiers follow one another, their order decides the content. Two sentences about real numbers that differ in nothing else show it.

  • "For every x there is a y with x+y=0." Correct. For every x the value y=−x does the job, and y is allowed to depend on x.
  • "There is a y such that x+y=0 holds for every x." Wrong. That single y would have to fit all x at once; x=1 would require y=−1 and x=2 would require y=−2 at the same time.
Top, “for every x there is a y”: x = 1, 2 and 5 are each linked to their own y = −1, −2 and −5, correct. Bottom, “there is one y for every x”: a single y = −1 is meant to fit x = 1, 2 and 5 but fits only x = 1, the other links are dashed, wrong. Top, “for every x there is a y”: x = 1, 2 and 5 are each linked to their own y = −1, −2 and −5, correct. Bottom, “there is one y for every x”: a single y = −1 is meant to fit x = 1, 2 and 5 but fits only x = 1, the other links are dashed, wrong.

The rule behind it hides in the dependence. With "there is" at the back, the object you are looking for may depend on the one chosen before it. With "there is" at the front, a single object has to serve all cases at once, and that is the far stronger claim.

Once the function is given concretely, test the claims on it. Take h(x)=1−x2.

  • "There is an x with h(x)=0" is correct, since x=1 suffices, and an existential claim needs one value.
  • "There is exactly one x with h(x)=0" is wrong, since x=−1 does the same.
  • "For every x, h(x)≤1 holds" is correct, since x2 is never negative; the value 1 is reached at x=0, which is why ≤ stands here and not <.
  • "There is an x with h(x)>1" is wrong, and it has to be: this sentence negates the previous one.
  • "For every x with x<−1, h(x)>0 holds" is wrong. The point x=−3 satisfies the if-part, and h(−3)=−8 violates the then-part.

Your turn7 of 7

Which statement about real numbers is correct?

What to take away

  • Correct means for all. A counterexample refutes, an example proves nothing, and both hold even when the words "for all" are absent.
  • The implication A⇒B is wrong only when A holds and B does not. The contrapositive is equivalent, the converse is not.
  • Sufficient and necessary. "A is sufficient for B" means A⇒B, "A is necessary for B" means B⇒A, and both together give the equivalence.
  • Negation. "For all" turns into "there is" and back, "and" turns into "or", and the negation of x<y is x≥y.
(A⇒B)⇔(not B⇒not A)

Now practise it

Statements and Implications (Aussagen und Folgerungen)

Trainer · Mathematics

Practise
Next: Checking Claims about Numbers (Behauptungen über Zahlen prüfen)
0/7

Was this article helpful?