Analogy

Advanced Study Notes – Analogical Reasoning

For the Jharkhand Police Sub‑Inspector (SI) – Reasoning Ability
(MIT‑level depth, first principles, rigorous reasoning, edge cases, and a challenging problem set)

1. Introduction

Analogical reasoning is the cognitive process of drawing a correspondence between two domains or problem sets in order to transfer knowledge or infer new relations.
In competitive exams, analogies are presented as word pairs or short statements:

A : B :: C : D

The task is to find the missing element D that completes the relationship between C and D mirroring the relationship between A and B.

While the surface form may appear simple, the underlying mechanics involve a rich interplay of linguistics, logic, set theory, and pattern matching. Mastering analogies requires an appreciation of structural similarity rather than mere lexical similarity.

2. Formal Foundations

2.1 Sets, Relations, and Functions

• Set S: a collection of distinct elements.
• Binary relation R ⊆ S × S: a set of ordered pairs.
• Function f: A → B: a relation that associates each element of A with exactly one element of B.

An analogy can be modeled as a bijection between two pairs of elements:

(A, B)  ↔  (C, D)

where a mapping f satisfies f(A) = B and f(C) = D.

2.2 Homomorphism & Isomorphism

• Homomorphism: A structure‑preserving map between algebraic structures (e.g., groups, graphs).
  For two graphs G1 and G2, a homomorphism φ: V(G1) → V(G2) preserves adjacency: if u~v in G1, then φ(u)~φ(v) in G2.

• Isomorphism: A bijective homomorphism with an inverse that is also a homomorphism.
  Two structures are isomorphic iff they are identical up to relabelling.

In analogy, we are often looking for an isomorphism between the relation graphs of the two pairs. A perfect analogy corresponds to a graph isomorphism; a weak analogy corresponds to a subgraph isomorphism or a partial homomorphism.

2.3 Category Theory Perspective

An analogy can be represented as a commutative diagram:

A ──f──► B
│          │
g          h
↓          ↓
C ──k──► D

The diagram commutes if h ∘ f = k ∘ g.
In words: “the transformation from A to B followed by the “target” transformation h equals the transformation from C to D followed by k.”

Thus, analogies are natural transformations between two functors mapping from a source category to a target category (e.g., linguistic category → semantic category).

3. Types of Analogies

Key takeaway: The most challenging analogies involve structural or procedural similarities where the underlying graph or process must be mapped.

4. Reasoning Strategies