The University of Manchester · FACULTY OF MATHEMATICS

MATH11121 Chap.2 Implication and Logical Equivalence

- one subject, every graph, every model, every mark
6 Chapters4-page Bible
Our own words - no uploaded lecturer files
Updated for this semester
Chapter 2 of 10 · MATH11121

Implication and Logical Equivalence

Implication and Logical Equivalence separates a conditional statement from its related forms. An implication fails only when its hypothesis is true and its conclusion false. The converse reverses direction, the contrapositive reverses and negates both parts, and the negation asserts the precise failure case. Biconditionals require both directions.

In this chapter

What this chapter covers

  • 01

    Implication truth table

  • 02

    Hypothesis and conclusion

  • 03

    Converse

  • 04

    Contrapositive

  • 05

    Negation of implication

  • 06

    Necessary and sufficient language

Worked example · free

Prove a parity implication indirectly

Q [6 marks]. Prove that if an integer square is even, then the integer is even by using the contrapositive. The displayed marks are an AskSia-authored practice allocation, not a University marking scheme.
The implication family places the original above three transformations and marks only the contrapositive as logically equivalent to the original statement.The implication family places the original above three transformations and marks only the contrapositive as logically equivalent to the original statement.P implies Qconverse: Q implies Pcontrapositivenegation:P and NOT Qequivalent
The implication family places the original above three transformations and marks only the contrapositive as logically equivalent to the original statement.
  • 2Write the contrapositive: an odd integer has an odd square.
  • 3Substitute n=2k+1 and rewrite the square in the form twice an integer plus one.
  • 1Return from the equivalent contrapositive to the original implication.
The contrapositive holds for every integer, so the original implication follows. The displayed practice weighting is not a University rubric.
Sia tip — Reverse and negate complete clauses; do not prove the inverse by mistake.
Glossary

Key terms

Hypothesis
The part assumed true in a conditional statement.
Conclusion
The part that must follow from the hypothesis.
Biconditional
A statement asserting implications in both directions.
FAQ

Implication and Logical Equivalence FAQ

Is the converse automatically true?

No. Reversing an implication creates a separate statement. It needs its own proof or counterexample unless the original theorem is explicitly a biconditional or a definition that supplies both directions.

What is the negation of an implication?

The negation of P implies Q is P and not Q. It describes the only failure row: the hypothesis holds while the conclusion fails. An implication between two negated clauses is a different transformation.

When should I use a contrapositive proof?

Use it when the failure of the conclusion has a useful definition or algebraic form. Since an implication and its contrapositive are equivalent, a direct proof of the transformed statement establishes the original claim.

How do necessary and sufficient conditions differ?

A sufficient condition guarantees the conclusion, while a necessary condition must hold whenever the original property holds. Translate the sentence into one arrow before reasoning, because reversing which property is required and which is enough produces the converse.

Why does a biconditional need two proofs?

The phrase if and only if asserts both P implies Q and Q implies P. Each direction begins with a different assumption and may require a different definition or method, so completing the forward argument alone establishes only half of the statement.

How can I test whether I reversed an implication?

Write the hypothesis and conclusion in separate boxes before transforming anything. Then compare the new statement with the converse and contrapositive labels; only the contrapositive preserves truth equivalence with the original implication.

Study strategy

Exam move

Train implication language in both symbols and sentences. For each statement, underline the hypothesis once and the conclusion twice, then write P implies Q. Produce the converse, contrapositive and negation using P and Q before restoring the full mathematical clauses. Make a phrase table for if, only if, necessary, sufficient and if and only if, and test each translation with a simple divisibility example.

When proving a biconditional, divide the page into two labelled directions. For counterexample practice, search specifically for the implication failure row instead of testing values randomly. Rework parity and divisibility claims through contrapositive proofs, always retaining the domain and closing with the equivalence to the original statement. Record direction errors separately from algebra errors.

During timed drills, spend a few seconds rewriting the arrow structure before calculating. This prevents a correct proof of the converse or inverse from being submitted for the original theorem. End every solution by naming which transformed statement was proved and why that settles the requested claim. Build a four-row comparison sheet for the original implication, converse, inverse and contrapositive.

Evaluate all of them under the same P and Q assignments, then circle the two matching columns. Repeat the exercise with concrete statements about multiples, squares and inequalities so the formal relationship survives changes in vocabulary. For natural-language practice, rewrite necessary and sufficient claims in both directions and ask which property is guaranteed and which property is required.

Add a counterexample beside every false converse; verify that it makes the converse hypothesis true and its conclusion false. When an implication has a conjunction in the hypothesis, keep the whole conjunction together during reversal. When the conclusion is itself compound, place brackets before negating it.

Practise negating P implies Q until P and not Q appears without hesitation, then connect that structure to the search for a counterexample. For biconditionals, use separate headings for the forward and reverse directions and list which definitions are available in each. One direction may be immediate while the other needs a different idea.

During proof review, label each written arrow as original, converse or contrapositive; this exposes a direction change that algebra alone can hide. End a revision block with a spoken explanation of why proving the contrapositive is legitimate but proving the converse is not. That explanation should refer to truth-table equivalence rather than to the examples used in a particular exercise.

Working through Implication and Logical Equivalence in MATH11121? Sia is AskSia’s AI Mathematics tutor — ask any MATH11121 Implication and Logical Equivalence question and get a clear, step-by-step explanation grounded in how MATH11121 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.

A+Everything unlocked
Unlocks this Bible + all 41 of your subjects at The University of Manchester, plus 1,000+ more Bibles across the AskSia library.
Sia - your MATH11121 tutor, unlimited, worked the way the exam marks it
The full 4-page Bible + practice bank with worked solutions
Chrome extension - sync your LMS so Sia knows your deadlines
Bilingual EN / Chinese on every Bible and every Sia answer
$0.99 Trial
30-day money-back · cancel in one tap · how it works