53.9 Rational Equation Verification

Rational Equation Verification is the collection of checks used to confirm that a rational equation was solved correctly at every stage, from the original domain restriction through denominator clearing, candidate generation, and final acceptance, and that any accompanying model has been correctly translated back into its real-world context. Because solving a rational equation involves several linked stages, restriction preparation, clearing, and screening, verification revisits each stage individually rather than relying on a single check applied only to the final answer.

These checks extend the verification techniques already used for individual rational expressions and rational operations, adding the additional considerations specific to solving an equation, generating candidates, and, where relevant, interpreting a modeled scenario.

Verifying the Setup

Original Restriction Recheck

The domain restriction determined during equation restriction preparation is recomputed independently from the original, uncleared equation, and compared against the restriction actually used during candidate screening, confirming no denominator or its excluded value was overlooked.

Verifying the Clearing Step

LCD Multiplication Audit

The constructed LCD is re-examined to confirm it is genuinely evenly divisible by every original denominator in the equation, since an incorrect LCD would fail to clear all the fractions properly during the clearing step.

Rational Clearing Equivalence Check

The cleared polynomial equation is checked by dividing it back by the LCD term by term, confirming that this reverses the clearing step correctly and reproduces the original rational equation exactly.

Verifying the Candidates

Original-Equation Candidate Substitution

Every candidate that survived the domain screening is substituted directly into the original, uncleared rational equation, confirming it produces a true numerical statement rather than relying solely on its status within the cleared polynomial equation.

Final Denominator Nonzero Check

For each accepted candidate, every original denominator is evaluated at that candidate's value and confirmed to be nonzero, providing a direct arithmetic confirmation that complements the earlier restriction-based screening.

Verifying the Complete Solution Set

Rational Solution Set Completeness

The final solution set is checked to confirm it includes every candidate that passed both the domain screening and the substitution check, and excludes every candidate that failed either, ensuring no valid solution was dropped and no invalid one was mistakenly retained.

Verifying a Modeled Scenario

Model Unit and Context Check

For an equation arising from an elementary rational model, the accepted solution's units and physical plausibility are rechecked against the original word problem, confirming the numerical answer, once translated back into the modeled context, genuinely represents a sensible response to the scenario described.