Conditional in Discrete Mathematics [ English ]

Languages

• English

1. Introduction to Conditional

In discrete mathematics, many logical statements express a dependency between two propositions. Such relationships are captured using the conditional statement, also known as implication.

Conditional statements are fundamental in:

• Mathematical reasoning
• Algorithm design
• Proof construction

They describe situations where one statement depends on another.

2. Definition of Conditional (Implication)

A conditional statement is a compound proposition of the form:

p → q

Formal Definition:

If p and q are propositions, then p → q is read as:

• “if p, then q”
• “p implies q”

3. Components of a Conditional Statement

In p → q:

• p is called the antecedent (or hypothesis)
• q is called the consequent (or conclusion)

4. Truth Table of Conditional

5. Explanation of Truth Table

The conditional statement p → q is false only when:

• p is True and q is False

Key Insight:

• If the condition (p) is true but the result (q) is false, the implication fails
• In all other cases, it is considered true

This may feel unintuitive initially, but it ensures consistency in logical reasoning.

6. Examples of Conditional (Formally Correct)

Example 1: Simple Propositions

Let:

• p: It is raining
• q: The ground is wet

Then:

p → q

means: If it is raining, then the ground is wet

Example 2: Numerical Statement

Let:

• p: A number is divisible by 2
• q: The number is even

Then:

p → q

✔ This is logically valid.

Example 3: Using Predicates

Let:

• p(x): x > 2
• q(x): x > 0

Then:

p(x) → q(x)

This is a predicate, not a proposition, until a value is assigned.

Converting into a Proposition

Case 1: Let x = 5

• p(5): 5 > 2 → True
• q(5): 5 > 0 → True

p(5) → q(5) → True → True → True

Case 2: Let x = 1

• p(1): 1 > 2 → False
• q(1): 1 > 0 → True

p(1) → q(1) → False → True → True

7. Important Observations

• A false antecedent (p = False) makes the implication automatically true
• This is called vacuous truth

8. Related Forms of Conditional

(a) Converse

q → p

(b) Inverse

¬p → ¬q

(c) Contrapositive

¬q → ¬p

Important Fact:

• p → q is logically equivalent to ¬q → ¬p (contrapositive)

9. Logical Equivalence

A conditional can be rewritten as:

p → q ≡ ¬p ∨ q

Meaning:

“If p then q” is equivalent to “not p OR q”

10. Applications of Conditional

(a) Mathematics

• Theorems and proofs
• Logical deductions

(b) Computer Science

• If-else statements
• Program logic

(c) Real-Life Reasoning

• Cause-effect relationships
• Decision making

11. Summary

• Conditional statement is written as p → q

• It is false only when p is true and q is false

• It consists of:

  • Antecedent (p)
  • Consequent (q)

• Equivalent to ¬p ∨ q

• Related forms include:

  • Converse
  • Inverse
  • Contrapositive