Figure series

Study Notes – “Figure Series” (Reasoning Ability)

Audience: Competitive exam aspirants (e.g., Coast Guard, UPSC, IIT-JEE, GRE‑Quant).
Depth: MIT‑level – starts from first principles and builds up to advanced theory.
Goal: Equip you to rigorously identify, prove, and generate figure‑series patterns, and to spot edge cases that often trip test‑takers.

1. What Is a Figure Series?

A figure series is a sequence of geometric figures (shapes, arrangements, color patterns, etc.) where each figure is derived from the previous one by a well‑defined transformation (or set of transformations). The task is to find the next figure in the sequence or to choose the figure that completes it from a set of options.

Key observation: The transformation is not arbitrary; it is governed by a deterministic rule that can be expressed mathematically.

2. Taxonomy of Figure‑Series Patterns

Rule of thumb: Start by listing all obvious geometric operations (scale, rotate 90°, flip). If none fit, think about combinatorial or graph operations.

3. Analytical Framework – The “5‑Step Approach”

1. Observation & Data Collection

   • List all elements of each figure (shape type, size, orientation, color, position).
   • Encode each element as a tuple (e.g., (shape, size, color, position)).

2. Identify the Transformation Space

   • Determine the group of transformations that could act on the figure (e.g., D4 for square symmetry, GL(2,R) for affine transforms).

3. Parameterization

   • Express the transformation as a function of a parameter k (step index).
   • Example: T_k(x) = a*k + b for scaling factor.

4. Consistency Check

   • Verify that the same transformation T_k works for all successive pairs.
   • If multiple transformations fit, prioritize the simplest (Occam’s razor).

5. Prediction & Validation

   • Apply the derived transformation to the last figure to predict the next.
   • Cross‑check against options; if none match, re‑examine edge cases.

4. Advanced Theory – Why This Works

4.1 Group Action Formalism

• Definition: A group G acts on a set X if there is a map · : G × X → X satisfying identity and associativity.
• In figure series, G is typically a finite symmetry group (e.g., dihedral groups D_n) or a continuous group (e.g., GL(2,R) for affine transforms).
• Orbit: The set {g·x | g ∈ G} is the sequence of figures generated by successive applications of a group element.
• Lemma: If the sequence has length m, then the transformation element g satisfies g^m = e (identity) if the series is periodic; otherwise, g generates an infinite orbit.

4.2 Affine Transformation & Matrix Representation

• Any affine transformation in the plane can be written as: [ \mathbf{v}' = A\mathbf{v} + \mathbf{t} ] where A ∈ GL(2,R) and t is a translation vector.
• For figure series where the shape retains its type but changes size/orientation, A captures scaling/rotation/reflection, while t handles translation.
• Example: If the figure is a square whose side increases by 2 units each step, A is the identity, and t = (0,0); the size change is captured by a scalar factor s_k.

4.3 Graph-Theoretic Perspective

• A figure can be modeled as a graph G(V,E) where vertices represent distinct sub‑components (dots, corners), edges represent adjacency or connectivity.
• Transformations may add/delete edges or re‑orient vertices.
  • Theorem: If each step adds exactly one new vertex connected to all existing vertices, the resulting graph is a complete graph K_n.
  • Recognizing this pattern is crucial in series involving incremental connectivity.

4.4 Combinatorial Enumeration

• When the figure series involves selecting a subset of elements (e.g., choosing 3 out of 5 dots), the transformation is governed by combinatorial counts.
• Use binomial coefficients or inclusion‑exclusion to predict the next figure’s complexity.

5. Edge Cases & Common Pitfalls