[Mathematical Logic: Core Concepts ①] Truth Sets & Containment $P \subset Q$: Universal/Existential Quantifiers & Contrapositive Protocols
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
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$.
- 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$.
→ 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!
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$
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)$ |
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.
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.
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.
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.
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.
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.
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."
• [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?"
• [Fix] Negate both the quantifier prefix AND the predicate inequality $\implies$ "For all real $x$, $x^2 - 2 > 0$".
• [Fix] A counter-example must reside strictly within $P - Q$ (satisfying the hypothesis $P$, but violating the conclusion $Q$).
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
Post a Comment