MathLabs
TheoremProved

Unique solution exactly when D≠0

Statement

The system {ax+by=ecx+dy=f\begin{cases}ax+by=e\\cx+dy=f\end{cases} has exactly one solution (x,y)(x,y) if and only if ad−bc≠0ad-bc\neq0, in which case x=ed−bfad−bcx=\dfrac{ed-bf}{ad-bc} and y=af−ecad−bcy=\dfrac{af-ec}{ad-bc}.

Why is it true?

This single number D packages both the "how many solutions" question and the "what are they" answer: check one sign, and you know whether elimination will succeed before you even attempt it.

Proof sketch

Deriving a necessary condition (eliminating y). Multiply the first equation of {ax+by=ecx+dy=f\begin{cases}ax+by=e\\cx+dy=f\end{cases} by dd and the second by bb: adx+bdy=edadx+bdy=ed and bcx+bdy=bfbcx+bdy=bf. Subtracting the second from the first cancels the bdybdy terms exactly, leaving (ad−bc)x=ed−bf(ad-bc)x=ed-bf. This equation is a necessary consequence of the system: any pair (x,y)(x,y) that solves both original equations must also satisfy it, since it was built only by adding/subtracting multiples of the two original equations.

Deriving the twin condition (eliminating x). Symmetrically, multiply the first equation by cc and the second by aa, then subtract the first from the second to cancel the xx terms: this leaves (ad−bc)y=af−ec(ad-bc)y=af-ec, again a necessary consequence of any solution.

Existence when D≠0. If ad−bc≠0ad-bc\neq0, the single-unknown equation (ad−bc)x=ed−bf(ad-bc)x=ed-bf has, by the theorem on linear equations in one unknown, exactly the one solution x=ed−bfad−bcx=\dfrac{ed-bf}{ad-bc}; likewise (ad−bc)y=af−ec(ad-bc)y=af-ec gives exactly y=af−ecad−bcy=\dfrac{af-ec}{ad-bc}. Substituting these two values into the original equations of {ax+by=ecx+dy=f\begin{cases}ax+by=e\\cx+dy=f\end{cases} and simplifying algebraically confirms both are satisfied simultaneously (the reader can verify a⋅ed−bfad−bc+b⋅af−ecad−bc=ea\cdot\dfrac{ed-bf}{ad-bc}+b\cdot\dfrac{af-ec}{ad-bc}=e by combining fractions over the common denominator DD) — so a solution genuinely exists.

Uniqueness when D≠0. Since (ad−bc)x=ed−bf(ad-bc)x=ed-bf and (ad−bc)y=af−ec(ad-bc)y=af-ec are necessary for every solution of {ax+by=ecx+dy=f\begin{cases}ax+by=e\\cx+dy=f\end{cases} (not merely sufficient), any solution (x,y)(x,y) of the original system, whatever it may be, is forced to satisfy x=ed−bfad−bcx=\dfrac{ed-bf}{ad-bc} and y=af−ecad−bcy=\dfrac{af-ec}{ad-bc} exactly, by the uniqueness part of the one-unknown theorem. So there cannot be two different solutions: combined with existence, the solution is unique precisely when ad−bc≠0ad-bc\neq0.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.