Inequalities in IBPS PO reasoning are chain-comparison problems. You get a sequence of variables connected by relational symbols (>, ≥, <, ≤, =), and you have to decide whether a given conclusion about two of those variables is necessarily true.
Think of it like a queue of students ranked by height. If Arjun is taller than Bhanu, and Bhanu is at least as tall as Chetan, you can conclude Arjun is definitely taller than Chetan. But if Arjun is taller than Bhanu and separately Divya is shorter than Bhanu, you cannot directly compare Arjun and Divya — their relationship is clear (Arjun > Divya too), but if the chain breaks in a conflicting direction, no conclusion holds.
That is the core idea. A conclusion is valid if and only if you can trace an unbroken chain from one variable to the other, and the direction of every symbol in that chain is consistent.
Coded vs. Mathematical inequalities: IBPS PO uses both formats. In mathematical inequalities, symbols are exactly what they look like: L > M means L is greater than M. In coded inequalities (less common now, but still tested), the exam substitutes symbols — for example, A @ B might mean A > B, and A # B might mean A ≤ B. The decoding step is trivial once you have the key; after that, the logic is identical.
The reason this topic trips up students is not the logic — it is rushing. You read a long chain like G ≥ H > I = J ≤ K < L, someone asks whether G > J, and you panic because the path from G to J crosses multiple symbols with different strengths. The fix is a mechanical process you apply without thinking, which this chapter teaches you.
A conclusion A [symbol] B is valid if you can trace a path through the chain from A to B where every intermediate relationship is consistent with the claimed direction and strength.
The two-step test:
Here is the strength hierarchy:
> and < are strict (strong)≥ and ≤ are non-strict (weak)= is the chameleon — it inherits the strength of the symbol it connects withWhen you combine symbols in a chain, the result follows this table:
| Chain segment | Effective conclusion |
|---|---|
| > and > | > |
| > and ≥ | > |
| ≥ and ≥ | ≥ |
| ≥ and = | ≥ |
| > and = | > |
| Any strict + any weak on same side | The strict one wins |
| Symbols pointing opposite directions | No conclusion possible |
Look at this chain: A > B ≥ C = D < E ≤ F
If someone asks: "Does A > D follow?"
> ≥ =≥ (but wait — is the conclusion > or ≥?)> between A and B, and the rest are ≥ or =. The strict > combined with ≥ and = gives you: A > D. Conclusion valid.Now ask: "Does F ≥ C follow?"
= < ≤F ≥ C. Since F > C is actually stronger than F ≥ C, the conclusion is valid. (A stronger reality satisfies a weaker claim.)This is a key nuance: if the chain proves F > C, then F ≥ C also follows, because ≥ includes >.
The chain breaks — meaning the symbols change direction. Example:
A > B < C
Can you conclude A > C? No. A is greater than B, and C is also greater than B. But we have no idea how A and C relate. Same logic: you cannot conclude A < C either.
Whenever the chain has a "valley" (symbols pointing inward like > <) or a "peak" (symbols pointing outward like < >), the two outer variables cannot be directly compared. No conclusion follows.
= PassthroughWhen two variables are equal in the chain, they are interchangeable. N = O means you can substitute one for the other. This is how questions like L > M ≥ N = O ≤ P < Q test conclusion L > O:
Some sets give you a code table. For example:
@ means >© means ≥# means =$ means <% means ≤Your first move on coded questions: decode the entire statement into standard symbols before doing anything else. Spend 10 seconds on decoding, then treat it as a normal chain. Do not try to keep the codes in your head while also doing the logic — that is where errors happen.
Before testing any conclusion, physically draw arrows above each symbol in the chain pointing in the direction of "greater value". All arrows pointing the same way = conclusion possible. Any arrow pointing back = that segment is a wall, no conclusion crosses it. Standard method: mentally re-read the chain 2-3 times (~30s). Same-Side Sweep: one visual pass (~8s).
When all arrows align, the conclusion strength = the weakest symbol in the path. > beats ≥, ≥ beats =. If the chain contains even one >, and the rest are ≥ or =, your conclusion is > (strict). If the chain is all ≥ and =, your conclusion is ≥. Never claim strict equality from a chain unless every single symbol is =. This eliminates the temptation to write ≥ when the answer is actually > (or vice versa). Standard approach: test both possibilities (~20s). Weakest-Link: instant read-off (~5s).
If the chain proves X > Y but the conclusion asks X ≥ Y — mark it valid. If the chain proves X ≥ Y but the conclusion asks X > Y — mark it invalid (you need the strict version). One comparison saves you: "Is what I proved at least as strong as what is claimed?" If yes, valid. This eliminates the single most common wrong answer in IBPS PO inequality sets. Standard approach: test conclusion against chain separately (~15s). This shortcut: one comparison (~4s).
Scan the chain for the variable pair in the conclusion. If the path between them contains a valley (... > X < ...) or a peak (... < X > ...), immediately mark "No conclusion" without further analysis. This applies to about 20% of conclusions in mixed-direction chains. Standard approach: attempt to derive relationship (~25s, then realize it's impossible). Valley-Peak Kill: identify pattern, skip (~3s).
Write the decoded chain on your rough sheet before reading any conclusion. Cost: 10 seconds once. Benefit: every conclusion in that set (usually 2-5) requires zero re-decoding. On a 5-conclusion coded set, this saves roughly 40-60 seconds total compared to decoding per conclusion. Do not skip this even if the symbols seem obvious — under exam pressure, mid-chain symbol confusion is a major error source.
When you see an inequality question in the exam hall, run this decision tree:
Step 1 — Decode (coded only). If symbols are non-standard, write the standard chain on rough paper. Skip this for direct symbol questions.
Step 2 — Identify the path. For each conclusion, find the two variables. Extract only the segment of the chain between them.
Step 3 — Valley/Peak check. Are there any direction reversals in the extracted segment? If yes — no conclusion. Done.
Step 4 — Weakest-link. All arrows align? Find the weakest symbol. That is your maximum possible conclusion.
Step 5 — Compare to claim. Is the proved relationship at least as strong as the claimed one? If yes, conclusion follows. If the claim is stronger than what you can prove — does not follow.
Step 6 — Mark. Note which conclusions follow, pick the matching option.
Target: 30-45 seconds per question for direct chains. Under 60 seconds for coded or 6+ variable chains.
Why this question: Tests whether you can chain through = without losing direction. A common IBPS PO trap is using = as a stopping point instead of a passthrough.
Solving path:
L > M ≥ N = O ≤ P < QL > O — Path: L → M → N → O. Symbols: > ≥ =. All pointing same direction (L is largest). Weakest link among > and ≥ is ≥, but there is a strict > at the start, so result is L > O. Valid.Q > N — Path: N → O → P → Q. Symbols from N: = ≤ <. N = O, O ≤ P, P < Q. All symbols place Q above N. Result: N < Q, so Q > N. Valid.Why this question: Tests the reversal: using U ≥ V when the chain actually gives you that in reverse order (V ≤ U). Many students re-read this conclusion backwards and get confused.
Solving path:
X = Y ≥ Z > W = V ≤ UX ≥ W — Path: X → Y → Z → W. Symbols: = ≥ >. Same direction. Weakest strict link: the > ensures X > W, so X ≥ W is satisfied (stronger reality, weaker claim). Valid.U ≥ V — Path: V → U. Direct: V ≤ U which is identical to U ≥ V. Valid immediately.Why this question: Conclusion II asks N < P from a chain where N appears at the left end and P in the middle-right. Students often stop at the < between N and O and forget O = P.
Solving path:
N < O = P ≥ Q > R = SP > R — Path: P → Q → R. Symbols: ≥ >. Same direction. Weakest: ≥, but the strict > between Q and R ensures P > R (P ≥ Q and Q > R means P > R). Valid.N < P — Path: N → O → P. Symbols: < =. N < O, O = P, so N < P. Valid.Why this question: F ≥ G = H is the type of opening that tricks students into claiming only F ≥ H instead of realizing the = makes H fully substitutable for G.
Solving path:
F ≥ G = H < I ≤ J > KF ≥ H — Path: F → G → H. Symbols: ≥ =. Same direction. F ≥ G = H, so F ≥ H. Valid.J > H — Path: H → I → J. Symbols: < ≤. H < I ≤ J, so H < J, meaning J > H. Valid.Why this question: The chain has an = in the middle (I = J) flanked by strict symbols on both sides. This tests whether you correctly propagate G > J through G ≥ H > I = J.
Solving path:
G ≥ H > I = J ≤ K < LG > J — Path: G → H → I → J. Symbols: ≥ > =. G ≥ H, H > I, I = J. The strict > between H and I ensures G > I = J, so G > J. Valid.L > I — Path: I → J → K → L. Symbols: = ≤ <. I = J, J ≤ K, K < L. So I < L, meaning L > I. Valid.Stopping at = instead of passing through it. N = O does not end the chain. O is just another name for N's value. Trace right through it.
Claiming a strict conclusion from a weak chain. If the path gives you X ≥ Y, you cannot conclude X > Y. The exam will offer this as a trap option. Unless there is at least one strict > or < in the path, your conclusion cannot be strict.
Accepting a weak conclusion when the chain gives strict. The reverse error is also tested. If the chain proves X > Y, then X ≥ Y is valid (stronger satisfies weaker). Do not second-guess this.
Not checking both conclusions independently. Some students test Conclusion I, find it valid, and assume the answer is "Only I follows" without checking II. Always check both. IBPS PO regularly makes both conclusions true simultaneously.
Misreading the conclusion's direction. U ≥ V and V ≤ U are identical statements. Train yourself to flip and re-read if the chain gives you the relationship in the "other" direction. Do not mark "does not follow" just because the chain states V ≤ U and the conclusion says U ≥ V.
Trying to compare variables across a valley or peak without noticing the reversal. A chain like A > B < C tells you nothing about A vs C. The moment you see a direction reversal between your two target variables, mark "No conclusion" and move on. Do not try to assign numerical values to figure it out — that wastes 30+ seconds and is irrelevant to the logic.