Class 11 Maths Chapter 14 Notes: Mathematical Reasoning

Key Concepts: Mathematical Reasoning Essentials

• A statement is a declarative sentence that is either true or false, but not both simultaneously. Questions, commands, and exclamations are not statements.
• Logical connectives (AND "∧", OR "∨", NOT "∼"/"¬", Implication "→", Biconditional "↔") combine simple statements into compound statements.
• The negation of a statement reverses its truth value. If p is true, ¬p is false, and vice-versa.
• An implication (p → q) is false only when the antecedent (p) is true and the consequent (q) is false. Otherwise, it's true.
• A biconditional (p ↔ q) is true only when p and q have the same truth value (both true or both false).
• The converse of p → q is q → p. The contrapositive of p → q is ¬q → ¬p.
• Tautology is a statement that is always true, regardless of the truth values of its components. Fallacy (Contradiction) is always false.
• Quantifiers are phrases like 'for all' (∀, universal) and 'there exists' (∃, existential) used to specify the range or quantity over which a statement is true.
• Methods of proving statements include Direct Proof, Proof by Contrapositive, Proof by Contradiction, and Disproving by Counterexample.

Essential Definitions in Mathematical Reasoning

Statement (Proposition)

A declarative sentence that is either true or false, but not both. It cannot be ambiguous.

Compound Statement

A statement formed by combining two or more simple statements using logical connectives.

Negation

The denial of a statement. If 'p' is a statement, its negation (¬p) is 'not p'. It has the opposite truth value of 'p'.

Conjunction (AND)

A compound statement formed by connecting two statements with 'AND' (p ∧ q). It is true only if both p and q are true.

Disjunction (OR)

A compound statement formed by connecting two statements with 'OR' (p ∨ q). It is true if at least one of p or q is true (inclusive OR).

Implication (Conditional)

A statement of the form 'If p, then q' (p → q). It is false only when p is true and q is false. 'p' is the hypothesis/antecedent, 'q' is the conclusion/consequent.

Biconditional

A statement of the form 'p if and only if q' (p ↔ q). It is true when p and q have the same truth value.

Tautology

A compound statement that is always true, irrespective of the truth values of its constituent simple statements.

Contradiction (Fallacy)

A compound statement that is always false, irrespective of the truth values of its constituent simple statements.

Understanding Logical Connectives and Truth Tables

Logical connectives are the operators that combine simple statements to form compound statements. Each connective has a specific rule that determines the truth value of the compound statement based on the truth values of its components. Mastering these rules is fundamental to mathematical reasoning and is often visualized using truth tables.

1. AND (Conjunction, ∧): The statement "p and q" (p ∧ q) is true if and only if both p is true AND q is true. If either p or q (or both) are false, then p ∧ q is false. This is like requiring all conditions to be met.

1. OR (Disjunction, ∨): The statement "p or q" (p ∨ q) is true if at least one of p or q is true. It is only false when both p and q are false. In mathematics, 'OR' is typically inclusive, meaning 'p or q or both'.

1. NOT (Negation, ¬ or ∼): The statement "not p" (¬p) simply reverses the truth value of p. If p is true, ¬p is false; if p is false, ¬p is true.

1. IF-THEN (Implication, →): The statement "If p, then q" (p → q) is false only when p is true AND q is false. In all other cases (p true, q true; p false, q true; p false, q false), the implication is considered true. This often causes confusion. Think of it as a promise: the only way the promise "If p, then q" is broken is if p happens but q doesn't.

1. IF AND ONLY IF (Biconditional, ↔): The statement "p if and only if q" (p ↔ q) is true when p and q have the same truth value (both true or both false). It is false when p and q have different truth values. This connective signifies logical equivalence.

Forming Converse and Contrapositive

1. Original Implication — Start with the conditional statement: p → q (If p, then q)
2. Forming the Converse — To find the converse, swap the hypothesis (p) and the conclusion (q). The converse is: q → p (If q, then p).
3. Forming the Contrapositive — To find the contrapositive, first swap the hypothesis and conclusion (like the converse), and then negate both. The contrapositive is: ¬q → ¬p (If not q, then not p).
4. Understanding Equivalence — An implication (p → q) is logically equivalent to its contrapositive (¬q → ¬p). This means they always have the same truth value. The converse (q → p) is NOT necessarily equivalent to the original implication.

Worked Examples

• {"title":"Example 1: Negating a Statement","bodyMarkdown":"Q: Write the negation of the statement: \"All birds can fly.\"\nA: The negation is \"It is not the case that all birds can fly,\" which can be rephrased as \"Some birds cannot fly\" or \"There exists at least one bird that cannot fly.\""}
• {"title":"Example 2: Converse and Contrapositive","bodyMarkdown":"Q: Given the statement: \"If a number is even, then it is divisible by 2.\"\n a) Write its converse.\n b) Write its contrapositive.\nA: Let p: \"A number is even\", q: \"It is divisible by 2\". So the statement is p → q.\n a) Converse (q → p): \"If a number is divisible by 2, then it is even.\"\n b) Contrapositive (¬q → ¬p): \"If a number is not divisible by 2, then it is not even.\" (Or \"If a number is odd, then it is not even.\")"}

Exam Tip: Avoiding Common Pitfalls

Students often confuse the converse and contrapositive, or incorrectly form negations involving quantifiers. Remember:

• Negation of 'All': The negation of "All A are B" is "Some A are not B" (not "No A are B").
• Negation of 'Some': The negation of "Some A are B" is "No A are B" (or "All A are not B").
• Implication Truth Table: The most frequent mistake is thinking that 'if p then q' is false when p is false. It's only false if p is true AND q is false.
• Logically Equivalent: The original statement (p → q) is logically equivalent only to its contrapositive (¬q → ¬p), not its converse (q → p). This is a common true/false question in exams.

Practice Questions with Solutions

• Q1: Is the sentence 'What is your name?' a mathematical statement? Justify. A1: No, it is not a mathematical statement because it is an interrogative sentence and cannot be assigned a true or false value.
• Q2: When is the compound statement 'p ∨ q' (p OR q) false? A2: 'p ∨ q' is false only when both 'p' is false AND 'q' is false.
• Q3: Write the negation of the statement: 'There exists a number x such that x² < x.' A3: The negation is 'For all numbers x, x² ≥ x.' (The negation of 'there exists' is 'for all', and the negation of '<' is '≥').
• Q4: State the contrapositive of 'If a number is prime, then it has exactly two factors.' A4: 'If a number does not have exactly two factors, then it is not prime.'

Frequently Asked Questions