Trace it. Derive it. Know it.
Every cluster below maps one schematic path β from first principles to the final equation. Expand a node to follow the full derivation trace.
Algebraic Linear Inequalities in One Variable & Order Axioms of Reals
2 concepts Β· 5.1What order axioms govern real inequalities, why does multiplying by a negative number reverse the inequality, and how are intervals represented?
Two real numbers or algebraic expressions related by the symbols <, >, <=, or >= form an inequality. Inequalities are classified as: (1) Strict Inequalities (<, >) where boundary points are excluded; (2) Slack / Weak Inequalities (<=, >=) where boundary points are included. The solution of an inequality in one variable x is the set of all real values of x that make the statement true. The algebraic manipulation of inequalities is governed by three fundamental Order Axioms: (A) Addition & Subtraction Invariance: Adding or subtracting the same real number to both sides preserves the inequality (a < b <=> a Β± c < b Β± c); (B) Positive Multiplication: Multiplying or dividing both sides by a strictly positive number (c > 0) preserves the inequality direction (a < b and c > 0 => ac < bc); (C) Negative Multiplication Sign-Flip (The Cardinal Rule): Multiplying or dividing both sides by a strictly negative number (c < 0) REVERSES the direction of the inequality (a < b and c < 0 => ac > bc). In addition, taking reciprocals (1/x) reverses the inequality IF AND ONLY IF both sides share the same sign. Solution sets are represented geometrically on the real number line using: Open Interval (a, b) with hollow nodes at both ends; Closed Interval [a, b] with solid nodes at both ends; Semi-Open Intervals [a, b) or (a, b]; and Infinite Rays (-β, a] or (b, β). Infinity (Β±β) is not a real number and must ALWAYS take round parentheses.
Order Axioms & Negative Multiplier Sign-Flip
a < b => a Β± c < b Β± c. If c > 0: ac < bc. If c < 0: ac > bc (inequality flips).
Real Intervals & Number Line Notation
Open (a, b): a < x < b. Closed [a, b]: a <= x <= b. Hollow node = excluded; Solid node = included.
Simultaneous Linear Inequalities & Solution Sets on the Real Number Line
2 concepts Β· 5.2How are simultaneous linear inequalities solved, and what characterizes consistent versus inconsistent solution sets?
A system of simultaneous linear inequalities in one variable consists of two or more inequalities that must be satisfied at the same time. The common solution set S of the system is the set-theoretic Intersection of the individual solution sets: S = S1 β© S2 β© ... β© Sn. To solve a simultaneous system: (1) Solve each inequality independently over R to obtain intervals S1 and S2; (2) Graph both solution intervals on parallel tracks above the same real number line; (3) Identify the region where the shaded intervals overlap simultaneously (logical AND). If the intervals overlap, the system is Consistent and the intersection is a non-empty interval. If the intervals are disjoint (share no points in common), the system is Inconsistent and the solution set is the Empty Set (S = β ). In competitive entrance exams, simultaneous systems arise in word problems with dual physical constraints: minimum passing marks, perimeter/area thresholds, temperature conversion ranges (F = (9/5)C + 32), and chemical dilution/acid mixture models where solution concentrations must remain strictly between specified lower and upper percentage limits.
Simultaneous Inequality Systems & Interval Intersection
Solve each inequality independently; common solution set is S = S1 β© S2. If disjoint, S = β .
Word Problems: Dilution & Threshold Models
Total solute = V1*C1 + V2*C2. Total volume = V1 + V2. Set up double inequality C_min < Solute/Volume < C_max.
Graphical Solution of Linear Inequalities in Two Variables on the Cartesian Plane
2 concepts Β· 5.3How does a linear equation partition the Cartesian plane, and how does the Test-Point method identify the feasible half-plane?
A linear inequality in two variables x and y has the form ax + by < c, ax + by <= c, ax + by > c, or ax + by >= c (where a and b are not both zero). Every linear equation ax + by = c represents a straight line that partitions the infinite 2D Cartesian plane into three mutually disjoint sets: (1) The boundary line itself (points satisfying ax + by = c); (2) One open half-plane (points satisfying ax + by < c); (3) The opposite open half-plane (points satisfying ax + by > c). Boundary Line Drawing Convention: For slack inequalities (<=, >=), the boundary line is drawn as a SOLID line because points on the line are solutions; for strict inequalities (<, >), the boundary line is drawn as a DASHED (broken) line because points on the line are excluded. The Origin Test-Point Method: To determine which half-plane contains the solutions: Step 1: Replace inequality with equality and draw the boundary line using intercepts (c/a, 0) and (0, c/b); Step 2: Select a test point not lying on the lineβmost conveniently the Origin (0, 0) if c != 0; Step 3: Substitute (0, 0) into the original inequality. If the statement evaluates to True, shade the half-plane containing (0, 0). If False, shade the opposite half-plane. Special Case (Line passing through the origin, c = 0): If the boundary line passes through (0, 0) (e.g. y - 2x >= 0), the origin cannot be used as a test point; choose any off-axis benchmark point such as (1, 0) or (0, 1) instead.
Half-Plane Partitioning & Solid vs Dashed Lines
ax + by = c divides plane into two half-planes. Solid line for <=, >= (boundary included); Dashed line for <, > (excluded).
The Origin Test-Point Method
Substitute (0, 0) into inequality. If True, shade half-plane containing (0, 0). If False, shade opposite side. If line passes through (0, 0), test (1, 0).
Systems of Linear Inequalities in Two Variables & Feasible Solution Regions
2 concepts Β· 5.4How is the feasible region of a multi-constraint system determined, and what is the Corner Point Theorem?
A system of linear inequalities in two variables consists of several linear inequalities that must hold simultaneously. The solution set of the system is the Feasible Regionβthe planar region formed by the intersection of all the individual half-planes. In practical and competitive scenarios, systems typically include the Non-Negativity Constraints x >= 0 and y >= 0, restricting the feasible region strictly to the First Quadrant. Feasible regions are classified into two topological categories: (1) Bounded Feasible Region: A closed, bounded convex polygon that can be enclosed within a circle of finite radius; (2) Unbounded Feasible Region: An open polygonal region extending infinitely in at least one direction. Corner / Vertex Points: The sharp corners of the feasible polygon are the points of intersection of pairs of boundary lines. The Corner Point Theorem (the foundational theorem of Linear Programming Problems / LPP in Class 12) states: If a linear objective function Z = ax + by attains an optimal (maximum or minimum) value over a feasible region, that optimal value MUST occur at one of the corner (vertex) points! If the region is bounded, both maximum and minimum are guaranteed to exist. If the system has conflicting constraints with zero overlapping planar area, the feasible region is Empty (S = β ), representing an Inconsistent System.
Feasible Region & Non-Negativity Constraints
Feasible region is the mutual intersection of all half-planes. x >= 0, y >= 0 restricts solutions to Quadrant I.
Corner Point Theorem & Vertex Calculation
Optimal values of Z = ax + by occur at corner points. Vertices are found by solving pairs of boundary lines.
Absolute Value (Modulus) & Rational Inequalities: The Wavy Curve Method
2 concepts Β· 5.5How are absolute value inequalities resolved, and what systematic rules govern the Wavy Curve Method for rational inequalities?
Higher algebra and calculus demand fluency with non-linear inequalities. (1) Absolute Value (Modulus) Inequalities: For any positive real a > 0: (A) |x| <= a <=> -a <= x <= a (inside interval [-a, a]); (B) |x| >= a <=> x <= -a or x >= a (outside wings (-β, -a] βͺ [a, β)); (C) Shifted modulus |x - c| <= d <=> c - d <= x <= c + d. For multi-modulus expressions like |x - 1| + |x - 2| >= 4, divide the real line into disjoint intervals based on critical transition points and solve piecewise. (2) Rational Inequalities & The Wavy Curve Method (Method of Intervals): For expressions of the form P(x)/Q(x) >= 0 or <= 0: Step 1: Shift all terms to the LHS so the RHS equals 0; NEVER cross-multiply by expressions containing variables without knowing their sign! Step 2: Factorize numerator and denominator completely into linear factors, ensuring the coefficient of x in every factor is POSITIVE (+1). If a factor has a negative coefficient (e.g. 3 - x), multiply by -1 and FLIP the inequality symbol. Step 3: Identify all Critical Points (zeros of numerator and denominator) and plot them on the number line in increasing order. Critical points from the denominator must ALWAYS be drawn as HOLLOW nodes (division by zero is undefined). Step 4: The region to the far right of the largest root is ALWAYS Positive (+). Step 5 (Parity Multiplicity Rule): Moving from right to left across each critical point: (I) If the factor has an ODD power (e.g. (x - c)ΒΉ, (x - c)Β³), the curve CROSSES the axis (sign ALTERNATES from + to - or - to +); (II) If the factor has an EVEN power (e.g. (x - c)Β², (x - c)β΄), the curve BOUNCES off the axis (sign REMAINS UNCHANGED). Step 6: Select the solution intervals: for >= 0, choose (+) regions; for <= 0, choose (-) regions.
Modulus Inequalities & Piecewise Intervals
|x| <= a <=> -a <= x <= a. |x| >= a <=> x <= -a or x >= a. |x - c| <= d <=> c - d <= x <= c + d.
The Wavy Curve Method (Sign Scheme)
Shift all to LHS. Factor with positive x coeff. Plot roots. Right is (+). Odd power crosses; Even power bounces. Denominator zeros hollow.