68.9 Solution Verification and Domain Definitions

Solution Verification and Domain Definitions establishes the precise vocabulary used throughout elementary algebra to describe the different stages a potential answer passes through on its way to being accepted as a genuine solution, distinguishing a raw candidate value from a fully admissible solution, and defining the domain against which every candidate must be checked.

Elementary Algebra Candidate Value Definition

Defining a Candidate Value

A candidate value is any number produced by the solving process that has not yet been checked against the original equation or the situation it represents.

Why This Value Is Not Yet Called a Solution

Because a candidate value has only passed through the mechanical steps of algebraic manipulation, and those steps can sometimes introduce values that do not genuinely satisfy the original statement, it is treated as provisional until it has been checked.

Elementary Algebra Admissible Solution Definition

Defining an Admissible Solution

An admissible solution is a candidate value that has been checked and confirmed to satisfy both the original equation and any additional real-world or domain-based conditions the problem imposes.

Why Two Conditions Must Both Be Met

A value must satisfy the algebraic equation itself and must also fit within whatever practical constraints the situation imposes, such as representing a positive quantity or a whole number of items; meeting only one of these two conditions is not sufficient for the value to be called admissible.

Elementary Algebra Verification Domain Definition

Defining the Verification Domain

The verification domain is the complete set of values that are considered acceptable answers for a given problem, based on both the mathematical structure of the equation and the practical context the problem describes.

Why the Verification Domain Combines Two Sources of Restriction

This domain is narrower than the equation's mathematical domain alone whenever the situation imposes additional practical restrictions, such as excluding negative values for a physical measurement, making both sources of restriction necessary to fully define it.

Elementary Algebra Extraneous Candidate Definition

Defining an Extraneous Candidate

An extraneous candidate is a candidate value produced by the solving process that fails to satisfy either the original equation, the verification domain, or both, and is therefore excluded from the final solution set.

Why Identifying Extraneous Candidates Is a Necessary Step

Because certain algebraic manipulations can introduce a candidate value that satisfies an intermediate step of the solving process without genuinely satisfying the original statement, checking every candidate against the verification domain is what allows such a value to be correctly identified and excluded before the final solution set is reported.