Solutions, solution sets, and checking

An equation asserts that two expressions have the same value. A solution is a value in the stated domain that makes that assertion true. Solving is therefore not a ritual for moving symbols; it is the process of finding every value that survives substitution into the original equation.

A solution set records all solutions. It may contain one value, several values, every value in $a$ domain, or no values at all. The braces in $\{5\}$ describe a set containing $5$; they are not grouping symbols in a calculation. An empty solution set is written $\varnothing$.

Checking closes the reasoning loop. Substitute a candidate into the original equation, simplify each side independently, and compare the results. A check can reject an arithmetic error and can also reveal a domain problem, such as a value that makes a denominator zero.

A solution to an equation is an input that makes the original equality true. It is not simply the number appearing after the last algebraic step. To test $x = 4$ in $3x - 2 = 10,$ substitute into both sides: $3(4) - 2 = 10$ and $10 = 10$. The equality verifies the candidate. If the two sides differ, the candidate is not $a$ solution, even if it emerged from familiar-looking manipulation.

The solution set records every solution, not merely one example. An equation can have no solutions, one solution, several solutions, or infinitely many solutions. The equation $x^{2} = 9$ has solution set $\{-3, 3\}$; $x + 1 = x + 4$ has the empty set; and $2(x + 1) = 2x + 2$ is true for every real $x$. Reporting a complete set forces the solver to consider whether the method found all candidates and whether any candidate was invalid.

Checking belongs in the original equation because transformations can change visible structure and some operations can create extra candidates. Squaring both sides, multiplying by an expression that may be zero, or clearing denominators can enlarge the candidate set. Even equality-preserving linear steps are vulnerable to copied signs or arithmetic errors. Substituting into the original statement tests both the algebra and every original restriction at once.

An equation can also be understood as an intersection question. The solutions to $f(x) = g(x)$ are the inputs where the graphs $y = f(x)$ and $y = g(x)$ have equal outputs. A table shows the same idea row by row. These representations do not replace symbolic proof, but they can predict the number and approximate location of solutions and reveal when a reported answer contradicts the visible relationship.

A solution must answer the domain of the problem. If $x$ counts students, a negative or fractional algebraic candidate may fail the context even if it satisfies a related symbolic equation. Distinguish equation restrictions from context restrictions: both matter, but they arise for different reasons. A complete check states the substitution, shows equality, confirms original-domain restrictions, and interprets the value in the situation.

A solution is a value that makes the original equation true. Solving produces a candidate; substitution decides whether the candidate belongs to the solution set. This distinction matters when later operations can introduce extraneous values or lose restrictions, but it is already useful for linear equations because it catches sign and distribution errors. Substitute into the untouched original equation, simplify the left and right sides independently, and compare them without assuming they must match.

Solution sets can contain one number, no numbers, many numbers, or—in later work—structured collections. For a one-variable linear equation, write a singleton solution as $x = 4$ or $\{4\}$; do not report the check line $9 = 9$ as though $9$ were the solution. If a context restricts possible values, intersect the algebraic solution with that domain. A negative length or a fractional number of indivisible objects may solve the symbolic equation but fail the model.

An equation may also be viewed as an intersection question: for which inputs do the left-hand expression and right-hand expression have the same output? A table can test selected candidates, and a graph can display intersections, but algebra gives an exact solution when the expressions are manageable. Whichever representation is used, the definition is unchanged. A candidate belongs only when both sides evaluate to exactly the same value within the stated number system.