Karnataka Patwari / Lekhpal /Reasoning Ability

Blood relations

Verbal Reasoning · free study notes

Blood Relations – Advanced Study Notes

(Designed for university‐level reasoning ability, e.g. IIT/JEE, UPSC, or competitive exams)


1. Introduction

Blood relations (also called kinship or family relations) are the fundamental relations defined by the law of descent.
They are used in logic puzzles, genealogical charts, and in proving properties of families (e.g., inheritance, marriage restrictions).

The classic set of relations includes:

Symbol Relation Definition Example
S Spouse Partner in marriage Alice ↔ Bob
F Father Male parent John → Michael
M Mother Female parent Mary → Michael
B Broader (brother) Male child of the same parents Michael ↔ Robert
Z Sister Female child of the same parents Michael ↔ Anna
P Parent Either F or M John → Michael
C Child Either F⁻¹ or M⁻¹ Michael → John
H Half‑Sibling Same parent but not both Michael ‖ Robert
A Aunt/Uncle Sibling of a parent Anna → Michael
N Nephew/Niece Child of a sibling Michael → Anna
R Grandparent Parent of a parent John → Michael
G Grandchild Child of a child Michael → John
X Grand‑spouse Spouse of a grandparent Mary ↔ John
L Lien (the “lawful” or “legitimate” child) Child of a lawful marriage Used in some societies

Notation

  • → denotes a directed relation (e.g., father → child).
  • ↔ denotes an undirected relation (e.g., sibling).
  • ‖ denotes a half‑relation.

2. Formal Foundations

2.1 Sets and Relations

Let F be the set of all humans.
Define binary relations on F:

  • Father(x, y) : x is the father of y.
  • Mother(x, y) : x is the mother of y.

From these, derive:

  • Parent(x, y) ≡ Father(x, y) ∨ Mother(x, y)
  • Child(y, x) ≡ Parent(x, y)

All other relations can be defined recursively using transitive closure and inverses.

2.2 Transitive Closure

Given a relation R, its transitive closure R⁺ is the smallest relation containing R that is transitive.
For example, Grandparent = Parent⁺ with path length 2.

2.3 Inverse Relations

If R is a relation, its inverse R⁻¹ is defined by:
R⁻¹(y, x) ⇔ R(x, y).

Thus Child = Parent⁻¹.

2.4 Composition

For relations R and S, their composition R ◦ S is:
(R ◦ S)(x, z) ⇔ ∃y : R(x, y) ∧ S(y, z).

This is key to deriving complex relations.


3. Algebraic Representation

Using relation algebra, we can express all blood relations succinctly.
Let P = Father ∪ Mother.
Let S = Spouse.
Let H = HalfSibling.

Relation Algebraic Formula Interpretation
Sibling Sib = (P ◦ P⁻¹) \ Id Two individuals share at least one parent.
Half‑Sibling H = (Parent ∧ ¬(Father ∧ Mother)) ◦ (Parent ∧ ¬(Father ∧ Mother)) Share exactly one parent.
Aunt/Uncle AuntUncle = Sibling ◦ Parent Sibling of a parent.
Niece/Nephew Niece = Parent ◦ Sibling Child of a sibling.
Grandparent GrandParent = Parent ◦ Parent Parent of a parent.
Grandchild GrandChild = Parent⁻¹ ◦ Parent⁻¹ Child of a child.
Grand‑Spouse GrandSpouse = Spouse ◦ GrandParent Spouse of a grandparent.

Note: Id denotes the identity relation (x = y).
\ denotes set difference.


4. Rigorous Reasoning: Theorem & Proofs

4.1 Theorem 1 – Symmetry of Sibling Relation

Statement:
For all x, y ∈ F, Sibling(x, y) ⇔ Sibling(y, x).

Proof:
Sibling(x, y) is defined as (Parent(x, z) ∧ Parent(y, z)) for some z.
Interchanging x and y leaves the definition unchanged; thus symmetry holds.

4.2 Theorem 2 – Transitivity of Ancestor Relation

Statement:
If Ancestor(x, y) and Ancestor(y, z) then Ancestor(x, z).

Proof:
Ancestor is the transitive closure of Parent.
By definition of transitive closure, it is transitive. ∎

4.3 Theorem 3 – Half‑Sibling and Full‑Sibling Distinction

Statement:
Sibling(x, y) ∧ ¬HalfSibling(x, y) ⇔ FullSibling(x, y).

Proof:
By definition, FullSibling shares both parents.
HalfSibling shares exactly one.
These are mutually exclusive and collectively exhaustive for siblings. ∎


5. Edge Cases & Cultural Variations

Edge Case Explanation Handling in Formalism
Adoption Adopted child may be legally considered a child but not a blood relative. Separate

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.