Blood Relations – Advanced Study Notes
Subject: Reasoning Ability – TISSNET
Level: MIT‑style, first‑principles treatment
Format: Markdown, rigorous, edge‑case aware, with a challenging exercise
1. Introduction
Blood relations (consanguineous relations) are the links that arise from a common biological ancestor.
In reasoning tests they appear as degree‑of‑relation questions, coefficient‑of‑relationship calculations, and logical deduction puzzles.
Why a first‑principles approach?
The same concepts that govern family trees in everyday life are also the foundations of:
- Graph theory (trees & paths)
- Probability of allele transmission
- Algebraic structures (equivalence relations)
A solid grasp of these underpinnings lets you solve any variation, even the trickier edge cases.
2. Foundational Definitions
| Term | Formal Definition | Example |
|---|---|---|
| Consanguinity | Relation of biological kinship. | Father‑daughter |
| Affinity | Relation by marriage. | Mother‑in‑law |
| Soe | A person who is a direct ancestor or descendant of another. | Grandfather, great‑grandson |
| Cousin | Any person who shares a common ancestor but is not a soe. | First cousin = share a set of grandparents |
| Degree of consanguinity | Minimal number of parent–child links connecting two individuals. | Siblings = 2 |
| Coefficient of relationship (CoR) | Probability that two relatives share a random gene from a common ancestor. | Parent–child = ½ |
| Coefficient of inbreeding (CoI) | Probability that an individual receives two copies of the same allele from a common ancestor. | Full‑sib mating → CoI = ¼ |
Key Idea: All blood relations can be modelled as paths in a family tree, a rooted, directed acyclic graph (DAG).
3. Graph‑Theoretic Modelling
3.1 The Family Tree as a Graph
- Vertices: Individuals.
- Directed edges: Parent → Child.
- Properties:
- Acyclic: No one can be their own ancestor.
- Rooted: The earliest known ancestor (or set of ancestors) are the roots.
- Bipartite: Each edge connects a generation to the next.
3.2 Distance & Degree of Relation
For two vertices (u, v):
[ d(u, v) = \text{length of the shortest undirected path between } u \text{ and } v ]
- Degree of consanguinity = (d(u, v))
- Siblings: (d=2) (parent → child → sibling).
- First cousins: (d=4) (child → parent → grandparent → parent → cousin).
Proposition 1.
(d(u, v)) is always even for blood relations (since parents are two steps away).
Proof: Any path from (u) to (v) alternates between ancestors and descendants. Thus the number of edges is even.
3.3 Coefficient of Relationship via Graph Paths
Let (P(u, v)) be the set of all simple (no repeated vertex) paths between (u) and (v).
For each path (p) of length (L(p)):
[ \text{Contribution}(p) = \left(\frac{1}{2}\right)^{L(p)} ]
Because each parent transmits a gene with probability (1/2).
[ \boxed{\text{CoR}(u, v) = \sum_{p \in P(u, v)} \left(\frac{1}{2}\right)^{L(p)}} ]
Example (Parent–child): Only one path of length 1 → CoR = 1/2.
Example (Siblings): Two distinct paths of length 2 → CoR = (2 \times (1/2)^2 = 1/2).
Example (First cousins): Four paths of length 4 → CoR = (4 \times (1/2)^4 = 1/4).
3.4 Coefficient of Inbreeding
For an individual (x) who is the product of two parents (p, q):
[ \text{CoI}(x) = \frac{1}{2},\text{CoR}(p, q) ]
Reason: The two parents need to share a gene (probability (\text{CoR}(p,q))); the child then inherits that gene from both parents (probability (1/2) from one parent).
4. Counting Relations
4.1 Pairwise Relations
Given (n) individuals in an unconnected (no common ancestors) set, the number of distinct unordered pairs is:
[ \binom{n}{2} = \frac{n(n-1)}{2} ]
However, in a real family tree,