Mathematics · Class 11

Active learning ideas

Logical Connectives and Compound Statements

This unit introduces the powerful art of mathematical proof, teaching students how to construct logical arguments to verify mathematical truths.

• CBSE Learning Outcomes
• NCERT Class 11: Chapter 14 - Mathematical Reasoning

• 15–20 min
• Pairs → Whole Class
• 3 activities

Activity 01

• Jigsaw
• 20 min · Small Groups

Proof Jigsaw Puzzle

Provide students with slips of paper, each containing one step of a complete proof (e.g., proving √2 is irrational). In small groups, students must arrange the steps in the correct logical order and identify whether it is a direct proof, contrapositive, or contradiction.

Explain the difference between an 'inclusive OR' and an 'exclusive OR'.

Facilitation Tip

Print proofs of different types on different coloured paper to help with sorting and discussion.

What to look for

An exit ticket where students are given three statements and must write the first line (the assumption) for a proof by contradiction for each.

• Understand
• Analyze
• Evaluate
• Relationship Skills
• Self-Management

Activity 02

• Think-Pair-Share
• 15 min · Whole Class

Contradiction Debates

Present a statement like 'The tallest student in the class is under 6 feet'. One student must start a proof by contradiction by assuming the opposite ('The tallest student is 6 feet or taller'). Other students must then find a 'contradiction' using known facts about the class.

Analyse the compound statement 'A square has four sides AND the sum of its angles is 180 degrees' to determine its truth value.

Facilitation Tip

Use simple, non-mathematical examples first to build intuition for the contradiction method.

What to look for

A test question requiring a full, step-by-step proof of a statement like 'The sum of a rational number and an irrational number is irrational' using an appropriate proof method.

• Understand
• Apply
• Analyze
• Self-Awareness
• Relationship Skills

Activity 03

• Think-Pair-Share
• 15 min · Pairs

Truth Table Races

Give pairs of students a complex compound statement. They race against other pairs to correctly construct its truth table. The first pair to finish with a correct table wins.

Compare the truth conditions for a conjunction (p AND q) with those for a disjunction (p OR q).

Facilitation Tip

Encourage students to break down the compound statement into smaller parts before building the full table.

What to look for

Provide students with a flawed proof. They must identify the logical error, explain why it is wrong, and suggest a correction.

• Understand
• Apply
• Analyze
• Self-Awareness
• Relationship Skills

A few notes on teaching this unit

Begin with everyday examples of 'if-then' logic to make the concepts relatable. Use truth tables as a visual tool to demonstrate logical equivalences before diving into formal proofs. When introducing proof by contradiction, model the classic proof of the irrationality of √2 step-by-step, emphasising the key assumption and the resulting contradiction.

By the end of this module, your students will be able to confidently analyse mathematical statements and use various proof techniques to demonstrate their validity.

---

Watch Out for These Misconceptions

• The negation of 'All doctors are rich' is 'No doctors are rich'.

  The negation of a 'for all' statement is a 'there exists' statement. The correct negation is 'There exists at least one doctor who is not rich' or 'Some doctors are not rich'. It only takes one counterexample to disprove the original statement.

• Proof by contradiction proves that the initial assumption is true.

  It's the opposite. A proof by contradiction starts by assuming the negation of what you want to prove. The goal is to show this assumption leads to a logical impossibility (a contradiction), thus proving the assumption must be false, and therefore the original statement must be true.

• The converse and the contrapositive of a statement are the same.

  For a statement 'if p, then q', the converse is 'if q, then p'. The contrapositive is 'if not q, then not p'. A statement is always logically equivalent to its contrapositive, but not necessarily to its converse.

---

Methods used in this brief

• Jigsaw
• Think-Pair-Share