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.
2. Statements and Their Negation
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:
"5 is an odd number." (True)
"Every rectangle is a square." (False)
Not statements:
"What is your name?" (Question)
"Close the door." (Command)
Negation of a Statement
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".
Negating Compound Statements
The negation of "p and q" is "(not p) or (not q)".
The negation of "p or q" is "(not p) and (not q)".
The negation of "if p then q" is "p and (not q)".
These are the logical forms of De Morgan's laws applied to statements.
3. Compound Statements and Connectives
A compound statement is formed by combining two or more simple statements using connectives such as "and", "or", and "if-then".
The Connective "and"
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 Connective "or"
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 Connective "if and only if"
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.
4. Implication: If-Then Statements
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).
Truth of an Implication
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.
Converse, Inverse and Contrapositive
Converse: "if q then p".
Inverse: "if not p then not q".
Contrapositive: "if not q then not p".
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.
5. Validating Statements and Arguments
To establish that a statement is true, we may use:
Direct proof: assume p is true and show q follows.
Proof by contradiction: assume the statement is false and derive a contradiction.
The contrapositive: prove "if not q then not p" instead of "if p then q".
Counterexample
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.
Valid and Invalid Arguments
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.
6. Quantifiers
Quantifiers express the scope of a statement.
"There exists an x such that P(x)" is written as there exists x P(x). It is true if at least one value of x satisfies P(x).
"For all x, P(x)" is written as for all x P(x). It is true only if P(x) holds for every value of x.
Negating Quantified Statements
The negation of "there exists x such that P(x)" is "for all x, not P(x)".
The negation of "for all x, P(x)" is "there exists x such that not P(x)".
These negations are essential for disproving statements: to disprove a "for all" statement, find a counterexample.
7. Special Words and Phrases in Reasoning
Certain words signal the logical structure of statements:
"And", "or", "if-then", "if and only if" are connectives.
"Only if": "p only if q" means "if p then q".
"Unless": "p unless q" means "if not q then p", which is equivalent to "p or q".
"Sufficient condition": p is a sufficient condition for q means "if p then q".
"Necessary condition": q is a necessary condition for p means "if p then q".
Getting these phrases right is crucial because they translate everyday language into precise logical statements.
Quick Revision Tables
Table 1: Truth Values of Compound 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
Table 2: Negations of Statements
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)
Mind Map
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"]
Important Diagrams (SVG)
Diagram 1: Truth Table Flow for Compound Statements
Diagram 2: Quantifiers and Their Negation
Common Mistakes
Treating questions or commands as statements. Only declarative sentences that are true or false can be statements.
Negating "p or q" as "(not p) or (not q)". The correct negation is "(not p) and (not q)" by De Morgan's law.
Believing the converse of a true statement is true. The converse must be proved separately and is not guaranteed.
Using "or" in the exclusive sense. In mathematics, "or" is inclusive: "p or q" is true when both are true.
Thinking that an implication is true only when both parts are true. "If p then q" is true in three of the four cases; it is false only when p is true and q is false.
Confusing the contrapositive with the converse. The contrapositive "if not q then not p" is equivalent to the original; the converse "if q then p" is not.
Using a single example to prove a "for all" statement. Examples illustrate but do not prove universality; only a counterexample disproves.
Negating "there exists x, P(x)" as "there exists x, not P(x)". The correct negation is "for all x, not P(x)".
Confusing "necessary condition" with "sufficient condition". q is necessary for p when p implies q; p is sufficient for q when p implies q.
Exam Tips
To identify a statement, ask whether it is a declarative sentence that is definitely true or false.
When negating compound statements, apply De Morgan's laws: flip "and" to "or" and negate both parts.
To prove "if p then q", either prove it directly, or prove its contrapositive "if not q then not p".
To disprove "for all x, P(x)", provide a single counterexample and verify it clearly.
For "if and only if" statements, prove both the implication and its converse.
Learn the phrase translations: "p only if q" means "if p then q"; "p unless q" means "if not q then p".
Practise writing truth tables for "and", "or", and "if-then" to internalise their truth conditions.
Conclusion
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.