Video summary

Inequality | Complete Chapter Revision | 20 Min Show | Careerwill Offline | By Bharat Bhushan Sir

Main summary

Key takeaways

Educational

Overview

This video explains how to solve standard inequality (order/arrangement) questions using an intuitive “door + doormat” model instead of reasoning directly with symbolic relations. The approach focuses on visualizing relations as directed doors between houses and tracking whether feet stay clean or become dirty while traversing a path.

Visual metaphor: each inequality is a door between two houses. The door’s opening direction shows who can move to whose house. A doormat on the door means “clean feet”; no doormat means “dirty feet.” Trace directed paths and check doormats to decide reachability and cleanliness.

Core concepts

  • Door direction: shows permitted movement (who can go to whose house).
  • Doormat presence/type:
    • Doormat = clean feet when passing that door.
    • No doormat = feet become dirty when passing that door.
  • Path traversal:
    • A valid path must follow door directions for every segment.
    • If any door on the path lacks a doormat, feet become dirty and remain dirty to the end.
    • If multiple routes exist, the existence of at least one valid route satisfying the feet condition is enough.

Single-statement questions — basic rules

  1. Represent the given relation as a door between two labels (houses).
  2. Determine door direction from the relation.
  3. Determine whether the door has a doormat (clean) or not (dirty) from the type of relation.
  4. Trace the route from source element to destination:
    • If any door blocks movement (wrong direction), the route is impossible.
    • If the route exists and every door along it has doormats → arrival with clean feet.
    • If at least one door has no doormat → arrival with dirty feet (dirty persists).
  5. If multiple routes exist, check each route; any allowed route that meets the cleanliness condition suffices.

Two-statement problems (chaining)

  • To go from an element in statement A to an element in statement B:
    • Find the common element shared between the two statements (junction).
    • Trace: source → common → destination, checking direction and doormats on both segments.
  • If no common element exists, a direct route across the two statements is impossible unless a third statement provides an intermediate junction.

Three-statement problems

  • If a direct connection between first and third statement elements is missing:
    • Try chaining as first → second → third, using the second statement as an intermediate junction.
  • Apply the same route-check rules across both joins:
    • Every segment must permit movement in the needed direction.
    • If feet become dirty at any point, they remain dirty to the end.

Special cases: “Either / combined” (I, Dar / Ir and A style)

These rules apply when two individual conclusions are both false but you must evaluate whether a combined “either” option can be inferred.

Case 1 — when conclusions involve “=”

  • Requirements:
    1. Both individual conclusions are false.
    2. The elements in both conclusions are identical (same pair).
    3. If you combine the two conclusions into one relation (e.g., combining “<” and “=” to get “≤”), that combined relation must be true according to the statements.
  • If all three rules hold, mark the combined/either option as true. If rule 3 fails, the combined option does not apply.

Case 2 — when the pair of conclusions together use all three symbols (>, <, =)

  • Requirements:
    1. Both individual conclusions are false.
    2. The elements in both conclusions are identical.
    3. All three relation symbols (> , < , =) appear across the conclusions/relations when examined together.
  • If all three rules hold, the combined/either option is valid. If any rule fails, you cannot infer the combined conclusion.

Note: Always run the three-rule check before selecting any “either/combined” choice.

How to treat “is equal to” and certain symbols

  • A direct “is equal to” conclusion in some test patterns should be marked wrong immediately as part of the pattern strategy — but always confirm by tracing paths.
  • Presence of “=” can change whether a combined inference is allowed; use the three-rule checks (above) to decide.

Reverse questions (conclusions given; choose a statement)

  • You may be given conclusions and asked which statement makes them definitely true or which statement makes a given conclusion definitely false.
  • To prove a conclusion false: find a statement that produces the exact opposite direction (e.g., if conclusion says P → Q, choose a statement that allows Q → P). For proving false, feet conditions are not relevant — proving the reverse movement exists is sufficient.
  • To prove conclusions true: select the statement where a valid directed path exists and where the doormat conditions match the required feet outcome.

Missing-symbol problems (fill in symbols)

  • You are given a sequence of letters with missing symbols between them. Insert symbols so the provided conclusions become true (or false) without contradiction.
  • Method:
    • For each required conclusion (e.g., B → N with dirty feet), ensure a feasible path exists from source to destination where the doormat pattern produces the required feet condition (dirty if at least one segment lacks a doormat; clean only if all segments have doormats).
    • To prove a conclusion definitely false, arrange symbols so the reverse direction is true.

Practical tips and reminders

  • Always identify the exact path — do not assume transitivity unless you can chain via a valid common element.
  • Once feet become dirty at any step, they remain dirty—clean cannot be restored.
  • If a door is closed in the required direction, the whole route fails.
  • When combining multiple statements, always re-check the joined path for direction and doormats.
  • When both individual conclusions are false but elements match, perform the three-rule check (Case 1 or Case 2) before selecting an “either/combined” option.

Examples referenced

  • Long chain example: A → B → C → D → E → F — check whether A reaches F and whether feet are dirty depending on which doors have doormats.
  • Two-statement example: use common element D to chain A (in one statement) to F (in another).
  • Three-statement example: use the middle statement to connect first and third when no direct common element exists.
  • Practice problems: selecting the statement that makes two given conclusions true, proving a conclusion false, and filling missing symbols to satisfy conclusions.

Speakers / sources

  • Bharat Bhushan (teacher; “Sir” — main speaker and instructor)
  • Sangeet (background music credit)

Original video