One Assignment Must Satisfy Every Equation
A system of equations is a collection of conditions on the same variables. The word same matters: a solution is not a collection of separate assignments, one for each equation. It is one assignment of values that makes every equation true at once. This distinction is the key to reading what a system asks, whether it has one equation or many.
Suppose the variables are \(x\) and \(y\), in that order. An assignment is an ordered pair \((x,y)\). For instance, the pair \((3,2)\) assigns \(x=3\) and \(y=2\). When we test a pair against a system, we use those same values in every equation. We do not choose a different value of \(x\) or \(y\) as we move from one equation to the next.
Each equation in a system is one condition. A tuple that satisfies only some of the conditions is not a solution of the system. Conversely, a tuple that satisfies all the conditions is a solution, even if there are other tuples that also work. A system can therefore have no solutions, one solution, or more than one; interpreting the word “system” does not itself decide which case occurs.
Worked Examples: Separate Conditions and Shared Values
Worked Example: One Pair for Two Equations
Consider the system
Test the ordered pair \((3,2)\). Its first coordinate gives \(x=3\), and its second gives \(y=2\). In the first equation, the left side is \(3+2=5\), which equals the right side. In the second equation, the left side is \(3-2=1\), which also equals the right side. Thus \((3,2)\) satisfies both conditions using the same values, so it is a solution of the system.
Now compare two pairs that work for the equations separately. The pair \((5,0)\) satisfies the first equation because \(5+0=5\). But in the second equation it gives \(5-0=5\), not \(1\). The pair \((0,-1)\) satisfies the second equation because \(0-(-1)=1\). But in the first equation it gives \(0+(-1)=-1\), not \(5\). Each pair works for one equation, but neither pair works for the whole system.
Check: Substituting \((3,2)\) into the two left sides gives \(3+2=5\) and \(3-2=1\), matching both right sides. The shared assignment is what makes it a system solution.
Worked Example: Each Equation Has Solutions, but No Pair Works for Both
Consider the system
The two equations impose different requirements on the same quantity, \(x+2y\). For a pair to satisfy the first equation, that quantity must equal \(8\). For the very same pair to satisfy the second equation, it must equal \(10\). Since \(8\ne10\), no pair can meet both requirements.
Each equation does have pairs that satisfy it when considered by itself. For the first equation, \((8,0)\) gives \(8+2(0)=8\). For the second equation, \((10,0)\) gives \(10+2(0)=10\). These are different assignments, however. The first pair does not satisfy the second equation, since \(8+2(0)=8\ne10\); the second pair does not satisfy the first, since \(10+2(0)=10\ne8\).
Check: If a shared pair existed, its single value of \(x+2y\) would have to be both \(8\) and \(10\). No number has both values, confirming that the system has no solution.
Worked Example: Three Variables, Three Shared Conditions
Consider the system
Test the ordered triple \((2,3,4)\), which assigns \(x=2\), \(y=3\), and \(z=4\). For the first equation, \(x+y=2+3=5\). For the second, \(y+z=3+4=7\). For the third, \(x+z=2+4=6\). Every equality holds with the same triple, so \((2,3,4)\) is a solution.
To see why the same-triple requirement matters, the first equation alone would also be satisfied by \((5,0,0)\), since \(5+0=5\). The second equation alone would be satisfied by \((0,7,0)\), since \(7+0=7\). The third equation alone would be satisfied by \((6,0,0)\), since \(6+0=6\). These examples use three different assignments. They do not, just by existing, establish a solution to the whole system.
Check: Using the one tuple \((2,3,4)\), the three left sides evaluate to \(2+3=5\), \(3+4=7\), and \(2+4=6\). Each matches its right side, so the tuple meets all three conditions simultaneously.
Solution Sets as Intersections of Conditions
The idea of one shared assignment can be expressed precisely using sets. For each equation, consider the set of all ordered tuples that satisfy that equation by itself. For example, the first equation in a system restricts the possible tuples to its own solution set. The system’s solutions are the tuples that remain after requiring membership in every one of those sets.
Proof. Let the system have equations \(E_1,\dots,E_m\), and let \(\mathbf{x}\) be an ordered tuple of values for its variables. By definition, \(\mathbf{x}\) is a solution of the system exactly when it makes every equation \(E_i\) true. For each \(i\), making \(E_i\) true is exactly the condition \(\mathbf{x}\in S_i\), where \(S_i\) is the solution set of \(E_i\). Therefore, \(\mathbf{x}\) is a solution of the system exactly when \(\mathbf{x}\in S_i\) for every \(i\). That is precisely the condition \(\mathbf{x}\in S_1\cap\cdots\cap S_m\). Both directions follow from these equivalent conditions. \(\square\)
This statement explains why solving or checking equations one at a time is not enough to establish a solution of the system. A tuple must remain in every individual solution set. If even one equation fails for that tuple, the tuple is outside the intersection and therefore is not a solution of the system.
Reordering Conditions Does Not Change the System’s Solutions
The order in which equations are written does not change what they require. Nor does writing an identical equation twice add a new restriction: meeting that equation once means meeting it every time it is repeated. These facts follow from the requirement that all the listed conditions hold, not from any particular way of solving them.
Proof. Let the original system contain equations \(E_1,\dots,E_m\). A tuple is a solution exactly when it satisfies \(E_i\) for every index \(i\) from \(1\) to \(m\). Reordering the equations changes only the order in which those same requirements are listed. A tuple satisfies every equation before reordering if and only if it satisfies every equation after reordering, so the solution sets are equal. If an equation \(E_k\) is repeated, a tuple that satisfies all the original equations already satisfies \(E_k\); requiring the same equation again does not remove any such tuple. A tuple that fails \(E_k\) fails the original system and also fails the system with the repeated equation. Thus the solution sets are unchanged in either case. \(\square\)
For instance, the system with conditions \(x+y=5\) and \(x-y=1\) asks for the same tuples whether its equations are written in that order or in the reverse order. Adding a second copy of \(x+y=5\) does not alter which pairs satisfy both conditions. By contrast, changing an equation can change the requirements: replacing \(x-y=1\) with \(x-y=2\) asks for a different condition. Reordering and repeating preserve equations; changing one does not.
A Common Mistake: Mixing Assignments
A common error is to take a value that works in one equation and a value from a different trial that works in another, then treat the pieces as though they were already a solution. In the first worked example, \((5,0)\) works for \(x+y=5\), while \((0,-1)\) works for \(x-y=1\). Combining the first coordinate of \((5,0)\) with the second coordinate of \((0,-1)\) gives the proposed pair \((5,-1)\). But this pair must be tested against both equations: \(5+(-1)=4\ne5\), and \(5-(-1)=6\ne1\). It satisfies neither condition.
The correction is to keep one complete tuple fixed while considering every equation. The pair \((3,2)\) works because the same \(x=3\) and \(y=2\) give \(3+2=5\) and \(3-2=1\). In general, a list of separate successful trials is not itself a system solution. What matters is whether one ordered tuple meets all the conditions.
It is also useful to distinguish the statement “this equation has a solution” from “this system has a solution.” The first statement considers one condition at a time; the second asks for at least one shared assignment across all conditions. In the second worked example, each equation separately has solutions, but their requirements on \(x+2y\) cannot hold together. Checking what is required of the same quantity can reveal this without searching through pairs one by one.
Why the Simultaneous Interpretation Matters
Systems model situations in which several facts apply to one object or one choice of values: a balance must meet multiple totals, a mixture must satisfy several composition requirements, or a set of unknown quantities must obey several measured relationships. If different equations were allowed to use different values of the variables, the equations would describe separate cases rather than a single situation. The shared-assignment interpretation is therefore not just notation; it is what makes a system represent combined constraints.
When reading a system, keep three questions separate. What are the variables and their fixed order? What condition does each equation impose? Which single tuple is being considered as a possible solution? Answering the last question requires checking every condition with that tuple unchanged. This simple discipline prevents separate equations from being mistaken for a simultaneous solution.
Check Your Understanding
For each question, focus on whether one assignment can meet all the stated conditions.
- Does \((2,1)\) satisfy both \(x+y=3\) and \(2x-y=3\)? Show the left-side calculation for each equation.
- The pair \((4,0)\) satisfies \(x+y=4\), and the pair \((0,2)\) satisfies \(x+2y=4\). Do these two facts alone show that the system containing both equations has a solution? Explain.
- Can one pair satisfy both \(x-y=2\) and \(x-y=5\)? State what the shared value of \(x-y\) would have to be.
- Why does reversing the order of the equations in a system leave its solution set unchanged?
- Give a concrete example of how repeating an equation can fail to add a new condition.
