[Mathematical Logic: Core Concepts ①] Truth Sets & Containment $P \subset Q$: Universal/Existential Quantifiers & Contrapositive Protocols



Mathematical Logic · Core Concepts ①

Truth Sets & Containment $P \subset Q$: Universal/Existential Quantifiers & Contrapositive Protocols

Beyond verbal semantics: A rigorous set-theoretic algorithm and counter-example protocol for high-school mathematical logic

πŸ’‘ "The truth value of a proposition is not linguistic intuition—it is the geometric containment of truth sets."

Relying on nuances and conversational phrasing in mathematical logic inevitably leads to conceptual confusion. The statement $p \to q$ is fundamentally determined by set inclusion: does the truth set of the hypothesis $P$ reside entirely within the truth set of the conclusion $Q$ ($P \subset Q$), or does at least one counter-example spill outside ($P - Q \neq \emptyset$)?

Ultimately, Logic is visualized and validated through the language of Sets. "AND ($\wedge$)" translates directly to intersection ($\cap$), "OR ($\vee$)" to union ($\cup$), and "NOT ($\sim$)" to complement ($A^c$). The contrapositive law holds precisely because set complement preserves containment in reverse order: $P \subset Q \iff Q^c \subset P^c$.

πŸ”— Key Mathematical Links Unlocked by Logic:
  • Domain & Codomain: "For every $x \in X$, there exists a unique $y \in Y$" forms the foundational definition of functions.
  • Sufficient & Necessary Conditions: Small sets nested in larger sets ($P \subset Q$) define sufficient conditions, setting up the structural backbone for equivalence ($P = Q$).
  • Rigorous Proofs in Analysis & Geometry: Locating the counter-example habitat ($P - Q$), proving by contraposition, and proof by contradiction ($\text{reductio ad absurdum}$) are indispensable tools for high-level calculus theorems.

1. Truth Values of Conditional Statements: Set Inclusion ($P \subset Q$)

Let $P$ and $Q$ denote the truth sets satisfying open sentences $p$ and $q$ respectively. The conditional statement $p \to q$ is governed strictly by the subset relation between $P$ and $Q$.

🌿 Yul's Conceptual Cheat Sheet: "The Habitat of Counter-examples"
• $p \to q$ is True: $P \subset Q \iff P - Q = \emptyset$
  → Every single element of $P$ sits comfortably inside the boundary of $Q$.
• $p \to q$ is False: $P \not\subset Q \iff P - Q \neq \emptyset$
  → A counter-example exists exclusively in the difference set ($P \cap Q^c = P - Q$): satisfying the hypothesis, but violating the conclusion!
✏️ [Standard Example 1] Set Operations and Truth-Value Determination

In a universal set $U$, let $P$ and $Q$ be the truth sets of conditions $p$ and $q$. If $(P \cup Q^c)^c = \emptyset$, which of the following propositions is necessarily true?
① $p \to q$      ② $q \to p$      ③ $p \to \sim q$      ④ $\sim p \to q$      ⑤ $\sim q \to \sim p$

πŸ‘‰ [Check Answer & Step-by-Step Solution]
[Answer] ② ($q \to p$)

[Solution]
1) Apply De Morgan's Law to simplify the given set expression:
$(P \cup Q^c)^c = P^c \cap (Q^c)^c = P^c \cap Q = Q - P = \emptyset$
2) An empty relative complement indicates subset containment:
$Q - P = \emptyset \iff Q \subset P$
3) Since $Q \subset P$, the conditional proposition $q \to p$ is strictly true.

2. Universal ($\forall$) vs Existential ($\exists$) Quantifiers

"For all" (Universal) demands completeness with zero exceptions ($P = U$), whereas "For some / There exists" (Existential) requires only a single working instance ($P \neq \emptyset$).

Quantifier Statement Condition for True Condition for False Negation
For all $x$, $p(x)$ $P = U$ (Holds everywhere) $P \neq U$ ($\ge 1$ counter-example) There exists $x$ such that $\sim p(x)$
There exists $x$ such that $p(x)$ $P \neq \emptyset$ ($\ge 1$ witness element) $P = \emptyset$ (No satisfying element) For all $x$, $\sim p(x)$
✏️ [Standard Example 2] Parameter Range for Existential Statements

In the universal set of real numbers $U = \mathbb{R}$, consider two conditions:
  $p : 1 \le x \le 4$,   $q : a - 2 \le x \le a + 3$
Find the number of integers $a$ such that the proposition "There exists some $x$ satisfying condition $p$ such that $q$ holds" is true.

πŸ‘‰ [Check Answer & Step-by-Step Solution]
[Answer] 9

[Solution]
1) The existential statement requires that the intersection of the two intervals is non-empty:
$P \cap Q \neq \emptyset$
2) On the real number line, intervals $[1, 4]$ and $[a - 2, a + 3]$ overlap if and only if:
• The right end of interval $Q$ reaches at least the left end of interval $P$: $a + 3 \ge 1 \implies a \ge -2$
• The left end of interval $Q$ does not exceed the right end of interval $P$: $a - 2 \le 4 \implies a \le 6$
3) Combining these yields $-2 \le a \le 6$. The integers satisfying this inequality are $\{-2, -1, 0, 1, 2, 3, 4, 5, 6\}$, giving $6 - (-2) + 1 = \mathbf{9}$.

3. Equivalence of Contrapositive Statements & Syllogism

A proposition $p \to q$ and its contrapositive ($\sim q \to \sim p$) are logically equivalent because $P \subset Q \iff Q^c \subset P^c$. Conversely, the truth of the converse ($q \to p$) or inverse ($\sim p \to \sim q$) is completely independent of the original statement.

🌿 Yul's Conceptual Cheat Sheet: "Two Golden Cases to Deploy Contraposition"
1. Negations in Equations ($\neq$): Statements like "$x \neq 1 \implies x^2 - 3x + 2 \neq 0$" become vastly easier when converted via contraposition into equalities ($=$).
2. 'OR' in Conclusions: An "or" clause in the conclusion converts into an "and" clause in the hypothesis under contraposition, allowing direct simultaneous algebraic substitution.
✏️ [Standard Example 3] Chaining Implications via Syllogism

Given four conditions $p, q, r, s$, assume that $p \to \sim q$, $r \to q$, and $\sim r \to s$ are all true. Prove that $p \to s$ is necessarily true using contraposition and hypothetical syllogism.

πŸ‘‰ [Check Answer & Step-by-Step Solution]
[Step-by-Step Proof]
1) Write down the contrapositive of each known true statement:
• Since $r \to q$ is true, its contrapositive $\sim q \to \sim r$ is also true.
2) Chain the valid implications sequentially:
• $p \to \sim q$
• $\sim q \to \sim r$
• $\sim r \to s$
3) By the hypothetical syllogism rule ($p \to \sim q \to \sim r \to s$), the implication $p \to s$ is always true.

4. Logical Deductions from Multi-Statement Truth Puzzles

Problems involving suspect interrogations where "exactly one speaks the truth" or "only the culprit lies" are solved systematically using Hypothesis Formulation $\to$ Consistency Check $\to$ Elimination via Contradiction.

🌿 Yul's Conceptual Cheat Sheet: "Two Hacks for Suspect Deduction"
1. Spot Mutual Contradictions (Law of Excluded Middle): If Person A claims $X$ and Person B claims $\sim X$, exactly one must be telling the truth and the other must be lying. If the problem states "only one person speaks the truth," every statement outside this pair is automatically false!
2. Hypothesize by Suspect: Assume each suspect is the culprit one by one, evaluating the resulting truth values across all testimonies to find the unique contradiction-free scenario.
✏️ [Standard Example 4] Suspect Deduction via Statement Analysis

In an investigation regarding an exam leak, four suspects $A, B, C, D$ were questioned. It is established that there is exactly one culprit, and only one person is telling the truth while the remaining three are lying. Identify the culprit logically based on their statements:

• $A$: "$B$ is the culprit."
• $B$: "$D$ is the culprit."
• $C$: "I am not the culprit."
• $D$: "What $B$ said is a lie."

πŸ‘‰ [Check Answer & Step-by-Step Solution]
[Answer] The culprit is $C$ (The truth-teller is $D$)

[Logical Deduction]
1) Analyze the relationship between statements $B$ and $D$:
• $B$ claims "$D$ is the culprit," and $D$ contradicts this directly by saying "$B$ is lying."
• Because $D$'s statement is $\sim(B)$, one of $\{B, D\}$ must be telling the truth and the other must be lying.

2) Apply the condition ("Only one person tells the truth"):
• The single true statement belongs to $\{B, D\}$. Therefore, both $A$ and $C$ must be lying ($\text{False}$).

3) Extract the decisive clue:
• Since $C$'s statement ("I am not the culprit") is false, its negation is true: "$C$ is the culprit."

4) Verification for consistency:
• If $C$ is the culprit:
  - $A$: "$B$ is culprit" $\implies$ False
  - $B$: "$D$ is culprit" $\implies$ False
  - $C$: "I am innocent" $\implies$ False
  - $D$: "$B$ is lying" $\implies$ True
$\implies$ Exactly one person ($D$) speaks the truth, which satisfies all conditions with zero contradictions.
⚠️ Top-Tier Checkpoint: 3 Frequent Logic Traps Clinic
Trap 1. Boundary Endpoint Inclusion ($\le, <$) in Interval Containment
• [Mistake Pattern] For $P = [1, 3)$ and $Q = [1, a]$, students hesitate whether $P \subset Q$ yields $3 < a$ or $3 \le a$.
• [Fix] If the outer boundary $Q$ is closed ($\le$) and the inner subset $P$ is open ($<$), setting $a = 3$ ensures $Q$ still covers $P$. Thus, $3 \le a$ is fully valid. Ask: "Is the container set at least as broad as the contained set?"
Trap 2. Forgetting to Negate the Predicate in Quantified Statements
• [Mistake Pattern] Negating "For some real $x$, $x^2 - 2 \le 0$" as merely "For all real $x$, $x^2 - 2 \le 0$".
• [Fix] Negate both the quantifier prefix AND the predicate inequality $\implies$ "For all real $x$, $x^2 - 2 > 0$".
Trap 3. Providing Counter-examples That Fail the Hypothesis
• [Mistake Pattern] Disproving $p \to q$ with a test value that doesn't even satisfy $p$.
• [Fix] A counter-example must reside strictly within $P - Q$ (satisfying the hypothesis $P$, but violating the conclusion $Q$).
🌿 Words from Yul
"Mathematical logic is not literature—it is blueprint design. Whenever you see an implication ($\to$), immediately translate it into set inclusion ($\subset$)."

Evaluating truth values in algebra should never rely on subjective verbal intuition.
Plotting strict boundaries on the real line, systematically invoking contraposition to clear negation barriers, and pinpointing counter-examples will allow you to conquer multiple-choice truth evaluation problems with total certainty.
Consolidate containment ($P \subset Q$), counter-example domains ($P - Q$), and quantifier negation rules into your two-split notebook. In our next installment, we tackle [Mathematical Logic: Practice Lab ①] 15 Killer Logic Problems & Twin Self-Diagnostics.

Comments

Popular posts from this blog

Authentic Reference Models Beyond Basic Rulers

[Math Column]Studying Alongside Dedicated Peers: Becoming Each Other’s Lifelong Catalyst

[High School Math] Coordinate Geometry: 15 Essential Practice Problems on Section Formulas (Internal & External Division)