In mathematics, a solution set is a set of possible values that a variable can take on in order to satisfy a given set of conditions (which may include equations and inequalities).
Formally, for a collection of polynomials over some ring , a solution set is defined to be the set .
1. The solution set of over the real numbers is the set {0}.
2. For any non-zero polynomial over the complex numbers in one variable, the solution set is made up of finitely many points. However, for a complex polynomial in more than one variable the solution set has no isolated points.
In algebraic geometry solution sets are used to define the Zariski topology. See affine varieties.
More generally, the solution set to an arbitrary collection E of relations (Ei) (i varying in some index set I) for a collection of unknowns , supposed to take values in respective spaces , is the set S of all solutions to the relations E, where a solution is a family of values such that substituting by in the collection E makes all relations "true".
(Instead of relations depending on unknowns, one should speak more correctly of predicates, the collection E is their logical conjunction, and the solution set is the inverse image of the boolean value true by the associated boolean-valued function.)
The above meaning is a special case of this one, if the set of polynomials fi if interpreted as the set of equations fi(x)=0.
This article is licensed under the GNU Free Documentation License.
It uses material from the
"Solution set".
Home Page • arts • business • computers • games • health • hospitals • home • kids & teens • news • physicians • recreation• reference • regional • science • shopping • society • sports • world