Unique solution exactly when D≠0
Statement
The system has exactly one solution if and only if , in which case and .
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 by and the second by : and . Subtracting the second from the first cancels the terms exactly, leaving . This equation is a necessary consequence of the system: any pair 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 and the second by , then subtract the first from the second to cancel the terms: this leaves , again a necessary consequence of any solution.
Existence when D≠0. If , the single-unknown equation has, by the theorem on linear equations in one unknown, exactly the one solution ; likewise gives exactly . Substituting these two values into the original equations of and simplifying algebraically confirms both are satisfied simultaneously (the reader can verify by combining fractions over the common denominator ) — so a solution genuinely exists.
Uniqueness when D≠0. Since and are necessary for every solution of (not merely sufficient), any solution of the original system, whatever it may be, is forced to satisfy and 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 .
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.