Consistency and inconsistency

Two straight lines on a plane can meet at exactly one point, run side by side forever without touching, or lie perfectly on top of each other. A pair of linear equations behaves the same way, and the surprising part is that you never have to draw or even solve the equations to know which of the three it will be. Just six numbers — the coefficients — tell the whole story. This is the idea of consistency and inconsistency: whether a pair of linear equations has a solution at all, and if so, how many. Comparing three simple ratios built from those six coefficients classifies any pair instantly, turns "solve this" problems into "predict this" problems, and even lets you hunt for an unknown constant that forces a pair into a chosen behaviour.

The core insight

Comparing the ratios a1a2,b1b2,c1c2\dfrac{a_1}{a_2}, \dfrac{b_1}{b_2}, \dfrac{c_1}{c_2} of a pair of linear equations a1x+b1y+c1=0, a2x+b2y+c2=0a_1x+b_1y+c_1=0,\ a_2x+b_2y+c_2=0 tells you, without solving, whether the pair has a unique solution, infinitely many solutions, or no solution.

The core idea

A pair of linear equations in two variables is consistent if it has at least one solution, and inconsistent if it has none. Consistent pairs split further: consistent and independent means exactly one solution (the lines cross once), while consistent and dependent means infinitely many solutions (the two equations describe the same line drawn twice). Every pair, once written in the standard form a1x+b1y+c1=0a_1x+b_1y+c_1=0 and a2x+b2y+c2=0a_2x+b_2y+c_2=0, falls into exactly one of three cases based on comparing coefficients:

a1a2≠b1b2  ⇒  unique solutiona1a2=b1b2=c1c2  ⇒  infinitely many solutionsa1a2=b1b2≠c1c2  ⇒  no solution\begin{aligned} \dfrac{a_1}{a_2} \neq \dfrac{b_1}{b_2} &\;\Rightarrow\; \text{unique solution}\\[4pt] \dfrac{a_1}{a_2} = \dfrac{b_1}{b_2} = \dfrac{c_1}{c_2} &\;\Rightarrow\; \text{infinitely many solutions}\\[4pt] \dfrac{a_1}{a_2} = \dfrac{b_1}{b_2} \neq \dfrac{c_1}{c_2} &\;\Rightarrow\; \text{no solution} \end{aligned}

where: a1,b1,c1a_1, b_1, c_1 are the coefficients of xx, yy and the constant term in the first equation, and a2,b2,c2a_2, b_2, c_2 are the same for the second equation, both written so the equation equals zero. Each algebraic case has a graphical twin and a solution-count twin, and a question can describe any one of the three and expect you to produce the other two:

  • Unique solution = consistent, independent = the two lines intersect at one point.
  • Infinitely many solutions = consistent, dependent = the two lines are coincident (identical).
  • No solution = inconsistent = the two lines are parallel and never meet.
Figure
Three pairs of lines showing intersecting coincident and parallel cases with their ratio conditions
Intersecting a1/a2 ≠ b1/b2 one solution Coincident a1/a2 = b1/b2 = c1/c2 infinite solutions Parallel a1/a2 = b1/b2 ≠ c1/c2 no solution

The strength of the test lies in what it avoids

You never need to substitute, eliminate, or plot a graph. Write both equations in standard form, read off six numbers, form three ratios, and compare — the classification is immediate. The same tool runs in reverse: if one coefficient is an unknown constant kk, you can solve for the value(s) of kk that force the pair to be consistent-independent, dependent, or inconsistent, simply by setting up the matching ratio equality or inequality.

Derivation AWhy the ratio test correctly predicts the number of solutions

The goal is to justify, from the elimination method itself, why a1/a2=b1/b2≠c1/c2a_1/a_2 = b_1/b_2 \neq c_1/c_2 must give no solution while a1/a2≠b1/b2a_1/a_2 \neq b_1/b_2 must give exactly one — so that the ratio comparison is not a memorised rule but a direct consequence of trying to eliminate a variable and seeing what survives.

Step 1. Start from a1x+b1y+c1=0a_1x + b_1y + c_1 = 0 and a2x+b2y+c2=0a_2x + b_2y + c_2 = 0. Multiply the first equation by a2a_2 and the second by a1a_1, giving a1a2x+a2b1y+a2c1=0a_1a_2x + a_2b_1y + a_2c_1 = 0 and a1a2x+a1b2y+a1c2=0a_1a_2x + a_1b_2y + a_1c_2 = 0. Subtracting eliminates xx: (a2b1−a1b2)y=a1c2−a2c1(a_2b_1 - a_1b_2)y = a_1c_2 - a_2c_1.

Step 2. Suppose a1/a2≠b1/b2a_1/a_2 \neq b_1/b_2, which is the same as saying a1b2≠a2b1a_1b_2 \neq a_2b_1, i.e. a2b1−a1b2≠0a_2b_1 - a_1b_2 \neq 0. Then Step 1's equation can always be divided through to solve for a single, definite value of yy, and back-substitution gives a single value of xx. This is exactly the unique-solution case, and it matches a1/a2≠b1/b2a_1/a_2 \neq b_1/b_2.

Step 3. Now suppose a1/a2=b1/b2a_1/a_2 = b_1/b_2, so a2b1−a1b2=0a_2b_1 - a_1b_2 = 0. Step 1's left side becomes 0⋅y=a1c2−a2c10 \cdot y = a_1c_2 - a_2c_1. If a1/a2≠c1/c2a_1/a_2 \neq c_1/c_2 (equivalently a1c2≠a2c1a_1c_2 \neq a_2c_1), the right side is a nonzero number, giving the impossible statement 0=nonzero0 = \text{nonzero} — no value of yy can satisfy it, so there is no solution. This matches a1/a2=b1/b2≠c1/c2a_1/a_2 = b_1/b_2 \neq c_1/c_2.

Step 4. If instead a1/a2=b1/b2=c1/c2a_1/a_2 = b_1/b_2 = c_1/c_2, the right side a1c2−a2c1a_1c_2 - a_2c_1 is also zero, giving 0=00 = 0 — true for every yy, meaning the second equation carries no new information beyond the first. Every point on one line lies on the other: the lines are the same, giving infinitely many solutions. The three ratio cases are therefore not a separate rule but the direct fallout of what elimination produces. Each of the three coefficient conditions maps onto exactly one algebraic outcome of elimination, matching the classification stated at the top.

Worked example

Without solving, determine the nature of the solutions for 2x−3y=72x - 3y = 7 and 4x−6y=94x - 6y = 9, and separately, find kk so that 2x+3y=72x + 3y = 7 and (k−1)x+(k+2)y=3k(k-1)x + (k+2)y = 3k has infinitely many solutions.

Step 1. Write both equations of the first pair in standard form: 2x−3y−7=02x - 3y - 7 = 0 and 4x−6y−9=04x - 6y - 9 = 0, so a1=2,b1=−3,c1=−7a_1=2, b_1=-3, c_1=-7 and a2=4,b2=−6,c2=−9a_2=4, b_2=-6, c_2=-9.

Step 2. Compute the ratios: a1a2=24=12\dfrac{a_1}{a_2} = \dfrac{2}{4} = \dfrac12, b1b2=−3−6=12\dfrac{b_1}{b_2} = \dfrac{-3}{-6} = \dfrac12, c1c2=−7−9=79\dfrac{c_1}{c_2} = \dfrac{-7}{-9} = \dfrac79.

Step 3. Since a1a2=b1b2=12\dfrac{a_1}{a_2} = \dfrac{b_1}{b_2} = \dfrac12 but c1c2=79≠12\dfrac{c_1}{c_2} = \dfrac79 \neq \dfrac12, the pair is inconsistent — parallel lines, no solution.

Step 4. For the second pair, a1=2,b1=3,c1=−7a_1=2, b_1=3, c_1=-7 and a2=(k−1),b2=(k+2),c2=−3ka_2=(k-1), b_2=(k+2), c_2=-3k. Infinitely many solutions requires 2k−1=3k+2=73k\dfrac{2}{k-1} = \dfrac{3}{k+2} = \dfrac{7}{3k}. From the first equality: 2(k+2)=3(k−1)⇒2k+4=3k−3⇒k=72(k+2) = 3(k-1) \Rightarrow 2k+4 = 3k-3 \Rightarrow k = 7.

Step 5. Check the third ratio at k=7k=7: 2k−1=26=13\dfrac{2}{k-1} = \dfrac{2}{6} = \dfrac13 and 73k=721=13\dfrac{7}{3k} = \dfrac{7}{21} = \dfrac13 — they match, confirming k=7k=7. Answer: the first pair is inconsistent (no solution); the second pair has infinitely many solutions when k=7k = 7.

Competitive stretch

If a similar pair 3x+2y=53x + 2y = 5 and (2k−1)x+(k−1)y=2k+1(2k-1)x + (k-1)y = 2k+1 is instead required to have a unique solution, the condition flips to an inequality: 32k−1≠2k−1\dfrac{3}{2k-1} \neq \dfrac{2}{k-1}, i.e. 3(k−1)≠2(2k−1)⇒3k−3≠4k−2⇒k≠−13(k-1) \neq 2(2k-1) \Rightarrow 3k - 3 \neq 4k - 2 \Rightarrow k \neq -1. So the pair is consistent-independent for every value of kk except k=−1k = -1 — a reminder that "unique solution" conditions are usually satisfied for all but a few excluded values, not for one special value.

Common traps

  • Checking only two of the three ratios. The cc-ratio is the deciding factor between "no solution" and "infinitely many" — skipping it is the single most common error.
  • Sign errors when rearranging an equation into ax+by+c=0ax+by+c=0 form, especially moving a term across the equals sign.
  • Confusing "consistent" with "has a unique solution." Consistent includes both the unique-solution and the infinite-solutions cases.
  • Guessing from appearance. Two equations that look very different in form can still be a disguised multiple of each other (dependent) or a disguised parallel pair (inconsistent) — always run the ratio test.

Ask the tutor: if a consistency question with an unknown kk feels confusing, ask the AI tutor to set up the ratio equalities with you term by term.

Why does checking just the a and b ratios equal not guarantee infinitely many solutions?

Because that equality only tells you the lines have the same slope — they could be the exact same line (infinite solutions) or two different parallel lines that never meet (no solution). The cc-ratio is what distinguishes the two: if it also equals the common a1/a2=b1/b2a_1/a_2 = b_1/b_2 value the lines coincide, and if it differs the lines are merely parallel. Always compute and compare all three ratios before concluding.

If I am asked to solve a pair of equations and the variables cancel out to something like 0 equals 5 what does that mean?

It means the pair is inconsistent and has no solution — you have just discovered this algebraically instead of by comparing ratios in advance. This happens exactly when a1/a2=b1/b2≠c1/c2a_1/a_2 = b_1/b_2 \neq c_1/c_2: elimination cancels both xx and yy, leaving a false numerical statement. If instead you get 0=00 = 0, the pair is dependent with infinitely many solutions, matching a1/a2=b1/b2=c1/c2a_1/a_2 = b_1/b_2 = c_1/c_2.

How do I quickly decide which condition to set up when a problem asks for a specific value of k?

Read what the question wants and translate it directly into the matching ratio statement: "unique solution" becomes a1/a2≠b1/b2a_1/a_2 \neq b_1/b_2 (an inequality, usually excluding one value of kk), "infinitely many solutions" becomes a1/a2=b1/b2=c1/c2a_1/a_2 = b_1/b_2 = c_1/c_2 (two equations to solve together, then cross-check), and "no solution" becomes a1/a2=b1/b2≠c1/c2a_1/a_2 = b_1/b_2 \neq c_1/c_2 (solve the equality, then confirm the inequality holds). Always identify a1,b1,c1,a2,b2,c2a_1, b_1, c_1, a_2, b_2, c_2 first, in standard form, before writing any ratio.

Before this

Where this leads