Modern Mathematics Cheat Sheet - IIM CAT 2026

Welcome to the comprehensive LibreTexts-style study guide for IIM CAT 2026 Modern Mathematics. Modern Math is a high-yield section in Quantitative Aptitude for CAT and other management entrance tests (XAT, SNAP, NMAT). This material breaks down the essential concepts, formulas, theorems, and logical equivalences extracted from standard test patterns.

Chapter 1: Set Theory & Relations

Set theory and binary relations form the backbone of advanced logical reasoning and modern quantitative problems in CAT.

1.1 Fundamental Definitions

• Power Set: The collection of all subsets of a given set \(A\) is called the power set, denoted as \(\mathcal{P}(A) = \{B : B \subseteq A\}\). If set \(A\) contains \(n\) elements, the cardinality of the power set is \(|\mathcal{P}(A)| = 2^{|A|} = 2^n\).
• Cartesian Product: Given two sets \(A\) and \(B\), the Cartesian product \(A \times B\) is the set of all ordered pairs \((a,b)\) such that \(a \in A\) and \(b \in B\). Formally, \(A \times B = \{(a,b) : a \in A, b \in B\}\).

1.2 Properties of Binary Relations

A binary relation \(R\) defined on a set \(A\) is a subset of \(A \times A\). Relations are classified based on the following fundamental properties:

• Reflexive: A relation \(R\) is reflexive if every element relates to itself, meaning \((a,a) \in R\) for all \(a \in A\).
• Symmetric: A relation \(R\) is symmetric if whenever \((a,b) \in R\), it implies that \((b,a) \in R\).
• Transitive: A relation \(R\) is transitive if whenever \((a,b) \in R\) and \((b,c) \in R\), it necessarily implies \((a,c) \in R\).
• Equivalence Relation: A relation \(R\) that simultaneously satisfies Reflexivity, Symmetry, and Transitivity is classified as an Equivalence Relation.

Chapter 2: Abstract Algebra & Group Theory

Abstract algebra provides systemic structures to analyze operations on mathematical sets. Understanding group properties aids in solving complex numerical and modular arithmetic problems.

2.1 Group Axioms

A group \((G, \cdot)\) is an algebraic structure consisting of a set \(G\) combined with a binary operation \(\cdot\) that satisfies four foundational group axioms:

1. Closure: For all elements \(a, b \in G\), the operation result \(a \cdot b \in G\).
2. Associativity: For all elements \(a, b, c \in G\), \((a \cdot b) \cdot c = a \cdot (b \cdot c)\).
3. Identity Element: There exists a unique element \(e \in G\) such that for every \(a \in G\), \(a \cdot e = e \cdot a = a\).
4. Inverse Element: For each element \(a \in G\), there exists an element \(a^{-1} \in G\) such that \(a \cdot a^{-1} = e\).

2.2 Subgroups & Lagrange's Theorem

A non-empty subset \(H\) of a group \(G\) is called a subgroup if \(H\) itself forms a group under the same operation. A pivotal theorem governing finite groups is:

Lagrange's Theorem: If \(H\) is a subgroup of a finite group \(G\), then the order (cardinality) of \(H\) divides the order of \(G\). Mathematically, \(|H|\) divides \(|G|\).

Chapter 3: Graph Theory & Network Fundamentals

Graph theory techniques are frequently applied in Data Interpretation & Logical Reasoning (DILR) as well as Quantitative Aptitude puzzle sets.

3.1 Eulerian vs. Hamiltonian Paths and Cycles

• Eulerian Path/Circuit: An Eulerian path traverses every edge of a graph exactly once. An Eulerian circuit starts and ends at the same vertex while covering every edge once. An undirected graph contains an Eulerian circuit if and only if it is connected and every vertex has an even degree.
• Hamiltonian Cycle: A Hamiltonian cycle is a closed loop that visits every vertex of a graph exactly once.

3.2 Handshaking Lemma

The Handshaking Lemma is a core graph theory identity relating degrees of vertices to total edge count:

\[\sum_{v \in V} \text{deg}(v) = 2|E|\]

This identity proves that in any graph, the sum of degrees of all vertices is twice the total number of edges, implying that the number of vertices with odd degree is always even.

Chapter 4: Mathematical Logic & Truth Equivalences

Logical statements and truth tables form the foundation of logical deductions in CAT.

4.1 Important Logical Equivalences

• Implication: The logical implication \(P \implies Q\) is equivalent to \( eg P \lor Q\).
• Contrapositive: An implication is logically identical to its contrapositive: \(P \implies Q \equiv eg Q \to eg P\).
• De Morgan's Laws:
  • \( eg(P \land Q) \equiv eg P \lor eg Q\)
  • \( eg(P \lor Q) \equiv eg P \land eg Q\)

Chapter 5: CAT PYQ Analysis & Topic Weightage

Analyzing previous year question patterns (NTA / IIM conducting body trends) gives an edge for IIM CAT 2026 preparation.

Modern Mathematics consistently contributes around 15% to 20% of total Quantitative Aptitude questions when combined with Functions, Permutations & Combinations, and Probability. Set Theory forms a regular highlight in LRDI Venn Diagram sets as well as QA questions.

Frequently Asked Questions (People Also Ask)