Comprehensive theory, key formulas, diagrams, and memory aids for Mathematical Reasoning.
Mathematics is built on logical reasoning. Every theorem, formula, and solution rests on statements that must be accepted as true or rejected as false, and on valid patterns of argument that connect them. This chapter introduces the formal language of mathematical reasoning: statements, their negation, compound statements built with connectives, and the logical relations between them.
The chapter begins by explaining what a statement is and how to negate it. It then introduces compound statements using the connectives "and", "or", and "if-then", including the important "if and only if". It distinguishes between valid and invalid arguments, introduces quantifiers such as "there exists" and "for all", and discusses the role of counterexamples and proof by contradiction.
Mathematical reasoning is not a technique for solving equations but a way of thinking that underlies all mathematics. Understanding statements, their negations, and logical equivalence enables students to read theorems precisely, construct proofs, and avoid fallacies. These skills are essential in higher mathematics, computer science, and law-like disciplines that depend on rigorous argument.
A statement is a declarative sentence that is either true or false, but not both simultaneously. Questions, commands, and exclamations are not statements.
Examples of statements:
Not statements:
The negation of a statement p is the statement "not p", written as ~p. The negation of a true statement is false, and the negation of a false statement is true.
Example: The negation of "2 is an even number" is "2 is not an even number".
These are the logical forms of De Morgan's laws applied to statements.
A compound statement is formed by combining two or more simple statements using connectives such as "and", "or", and "if-then".
The statement "p and q" is true only when both p and q are true. If either is false, "p and q" is false.
The statement "p or q" is true when at least one of p or q is true. In mathematics, "or" is used inclusively: "p or q" is true even when both are true. This inclusive or is sometimes clarified by writing "p or q or both".
The statement "p if and only if q" (written p if and only if q) means both "if p then q" and "if q then p". It is true exactly when p and q have the same truth value.
A statement of the form "if p then q" is called an implication or a conditional statement. Here p is the hypothesis (or antecedent) and q is the conclusion (or consequent).
The implication "if p then q" is false only when p is true and q is false. In all other cases it is true. In particular, an implication with a false hypothesis is always true.
The contrapositive of a statement is logically equivalent to the statement itself. The converse and the inverse are logically equivalent to each other, but they are not equivalent to the original statement.
To establish that a statement is true, we may use:
A single counterexample is enough to disprove a universally quantified statement. For example, to disprove "all prime numbers are odd", the number 2 is a counterexample.
An argument is valid if the conclusion follows necessarily from the premises. An argument that appears reasonable but fails to guarantee the conclusion is a fallacy. Careful attention to the logical form is required to distinguish valid arguments from fallacies.
Quantifiers express the scope of a statement.
These negations are essential for disproving statements: to disprove a "for all" statement, find a counterexample.
Certain words signal the logical structure of statements:
Getting these phrases right is crucial because they translate everyday language into precise logical statements.
| p | q | p and q | p or q | if p then q |
|---|---|---|---|---|
| T | T | T | T | T |
| T | F | F | T | F |
| F | T | F | T | T |
| F | F | F | F | T |
| Statement | Negation |
|---|---|
| p and q | (not p) or (not q) |
| p or q | (not p) and (not q) |
| if p then q | p and (not q) |
| for all x, P(x) | there exists x, not P(x) |
| there exists x, P(x) | for all x, not P(x) |
graph TD
A["Mathematical Reasoning"] --> B["Statements"]
A --> C["Negation"]
A --> D["Connectives"]
A --> E["Implication"]
A --> F["Quantifiers"]
A --> G["Proof Methods"]
B --> B1["Declarative, true or false"]
B --> B2["Questions are not statements"]
C --> C1["~p"]
C --> C2["De Morgan for compound statements"]
D --> D1["and: both true"]
D --> D2["or: at least one true"]
D --> D3["if and only if: same truth value"]
E --> E1["if p then q"]
E --> E2["Converse, inverse, contrapositive"]
E --> E3["Contrapositive is equivalent"]
F --> F1["for all x"]
F --> F2["there exists x"]
G --> G1["Direct proof"]
G --> G2["Proof by contradiction"]
G --> G3["Counterexample"]
Mathematical reasoning supplies the logical scaffolding on which all of mathematics rests. Statements and their negations give precision to mathematical language, compound statements built with connectives allow complex conditions to be expressed, and implications capture the essence of deduction. Quantifiers enable universal and existential claims to be stated and tested, while methods such as proof by contradiction and counterexamples provide the tools for validation. These ideas are fundamental not only to mathematics but to any rigorous intellectual discipline. Mastering the language of statements, connectives, quantifiers, and logical equivalence gives students the ability to read, write, and verify mathematical arguments with clarity and confidence.