Blood Relations – Advanced Reasoning Ability Notes
(For the Andaman & Nicobar Islands Police Sub‑Inspector (SI) Examination – Reasoning Ability)
1. Introduction
Blood‑relation puzzles are classic tests of transitive logic. They require the examinee to:
- Define the basic relational operators.
- Translate verbal statements into algebraic or set‑theoretic notation.
- Apply transitivity, symmetry, and antisymmetry to deduce indirect relationships.
- Identify contradictions and edge cases (e.g., incest, multiple marriages).
In competitive exams, these problems are typically framed as family trees, family‐relationship statements, or worded chains. Mastery comes from a firm grasp of first‑principles and a systematic deduction strategy.
2. First Principles of Blood Relations
| Symbol | Meaning | Properties | Remarks |
|---|---|---|---|
P ∼ Q |
P is a parent of Q | Irreflexive, Transitive, Asymmetric | Parent → Child direction |
P ∼⁻¹ Q |
P is a child of Q | Inverse of ∼ |
Equivalent to Q ∼ P |
P ∼₁ Q |
P is a sibling of Q | Symmetric, Irreflexive | P ∼₁ Q ⇔ Q ∼₁ P |
P ∼₂ Q |
P is a grandparent of Q | Transitive of ∼ |
P ∼₂ Q ⇔ P ∼ Q and Q has a child R with P ∼ R |
P ∼₋₁ Q |
P is a grandchild of Q | Inverse of ∼₂ |
P ∼₋₁ Q ⇔ Q ∼₂ P |
P ∼ᵢ Q |
P is an in-law of Q (spouse or by marriage) | Symmetric, Irreflexive | Requires extra data (marriage links) |
P ∼ₘ Q |
P is a cousin of Q | Symmetric | Defined as P and Q share a grandparent but are not siblings |
Core Theorems
-
Transitivity of Parent
IfA ∼ BandB ∼ C→A ∼₂ C. -
Transitivity of Child
IfA ∼⁻¹ BandB ∼⁻¹ C→A ∼₋₁ C. -
Sibling Definition
A ∼₁ B⇔ (∃X)X ∼ A∧X ∼ B∧A ≠ B. -
Cousin Definition
A ∼ᵢ B⇔ (∃X,Y)X ∼ A∧Y ∼ B∧X ∼ Y∧X ≠ Y∧A ≠ B. -
No Self‑Relation
For all operators,P ∼ Pis false (no one is their own parent, grandparent, etc.).
3. Systematic Deduction Strategy
-
Construct a Directed Graph
- Nodes: Individuals.
- Edges: Parent–child (
∼). - Undirected edges: Sibling (
∼₁). - Additional edges for marriages (
∼ᵢ).
-
Label Known Edges
Draw all given relationships.
Example:A ∼ B(A is parent of B). -
Apply Transitivity
- For each node, propagate ancestor/descendant links.
- Use breadth‑first search (BFS) to find all reachable nodes in the “parent” direction.
-
Check for Contradictions
- If an individual appears both as a child and a parent of the same person, the statement set is inconsistent.
- Verify that no node is connected to itself via a directed cycle.
-
Infer Indirect Relations
- Grandparent, great‑grandparent, etc., by counting edges.
- Cousins: Two individuals sharing a common ancestor but not siblings.
-
Handle Edge Cases
- Multiple Marriages: A person may have more than one spouse; treat each marriage as a separate
∼ᵢlink. - Adoption: In some puzzles, adoption is treated same as biological parent; clarify with the problem statement.
- Half‑Siblings: If the problem mentions “half‑siblings”, treat them as sharing exactly one parent.
- Multiple Marriages: A person may have more than one spouse; treat each marriage as a separate
-
Answer the Question
- Translate the required relation back to the graph.
- If multiple answers are possible, identify all valid ones.
4. Advanced Topics
4.1 Algebraic Representation
Let the set of individuals be ( \mathcal{I} ).
Define the parent relation ( \mathcal{P} \subset \mathcal{I} \times \mathcal{I} ).
- ( (x, y) \in \mathcal{P} ) iff ( x ) is parent of ( y ).
Define the ancestor relation ( \mathcal{A} ) as the transitive closure of ( \mathcal{P} ).
- ( (x, y) \in \mathcal{A} ) iff ( y ) is a descendant of ( x ).
Similarly, the sibling relation ( \mathcal{S} ) is the symmetric closure of the set of pairs sharing a parent:
- ( (x, y) \in \mathcal{S} ) iff ( \exists z ) such that ( (z, x) \in \mathcal{P} ) and ( (z, y) \in \mathcal{P} ) and ( x \neq y ).
With these definitions, many puzzles reduce to computing intersections, differences, or unions of these relations.
4.2 Graph‑Theoretic Complexity
- Depth: Number of generations.
- Breadth: Number of siblings at each level.