PRODUCTS
Mathematica
Mathematica Home Edition
Mathematica for Students
Mathematica for the Classroom
grid
Mathematica
Wolfram Lightweight Grid Manager
web
Mathematica
Mathematica Player
(free download)
Mathematica Player Pro
Wolfram
Workbench
Mathematica
Applications
SOLUTIONS
Industry
Chemical Engineering
Image Processing
Mechanical Engineering
Petroleum Engineering
Environmental Sciences
Bioinformatics
Data Analysis and Mining
Financial Risk Management
Statistics
Software Engineering
More...
Education
Higher Education
Precollege Education
Students
Technology
Interactive Deployment
High-Performance and Parallel Computing (HPC)
See Also: Technology Guide
PURCHASE
Online Store
Other Ways to Buy
Volume & Site Licensing
Contact Sales
Software
Service
Upgrades
Training
Books
FOR USERS
All User Resources
Product Registration
Technical Support
Customer Service
Developer Support
Does My Site Have a License?
Free Seminars
Learning Center
Training
Custom Group Seminars
Documentation & Examples
Tutorial Screencasts
Video Gallery
Demonstrations Project
Education Portal
Student Resources
COMPANY
About Wolfram Research
News & Events
Wolfram Blog
Employment Opportunities
History of
Mathematica
Stephen Wolfram's Home Page
Contact Us
OUR SITES
Wolfram|Alpha
Demonstrations Project
Wolfram Blog
MathWorld
Integrator
Wolfram Functions Site
Mathematica Journal
Wolfram Library Archive
Wolfram
Tones
Wolfram Science
Stephen Wolfram
DOCUMENTATION CENTER SEARCH
Mathematica
>
Mathematics and Algorithms
>
Polynomial Algebra
>
Polynomial Systems
>
Built-in
Mathematica
Symbol
Quantifiers
Complex Polynomial Systems
Tutorials »
|
Reduce
FindInstance
Exists
ForAll
Conjunction
Disjunction
CylindricalDecomposition
See Also »
|
Boolean Computation
Logic & Boolean Algebra
Polynomial Algebra
Polynomial Systems
More About »
Resolve
Resolve
[
expr
]
attempts to resolve
expr
into a form that eliminates
ForAll
and
Exists
quantifiers.
Resolve
[
expr
,
dom
]
works over the domain
dom
. Common choices of
dom
are
Complexes
,
Reals
and
Booleans
.
MORE INFORMATION
Resolve
is in effect automatically applied by
Reduce
.
expr
can contain equations, inequalities, domain specifications and quantifiers, in the same form as in
Reduce
.
The result of
Resolve
[
expr
]
always describes exactly the same mathematical set as
expr
, but without quantifiers.
Resolve
[
expr
]
assumes by default that quantities appearing algebraically in inequalities are real, while all other quantities are complex.
When a quantifier such as
ForAll
[
x
,
...
]
is eliminated the result will contain no mention of the localized variable
x
.
Resolve
[
expr
]
can in principle always eliminate quantifiers if
expr
contains only polynomial equations and inequalities over the reals or complexes.
Resolve
[
expr
]
can in principles always eliminate quantifiers for any Boolean expression
expr
.
EXAMPLES
CLOSE ALL
Basic Examples
(1)
Prove that the unit disk is nonempty:
In[1]:=
Out[1]=
Find the conditions for a quadratic form over the reals to be positive:
In[2]:=
Out[2]=
Find conditions for a quadratic to have at least two distinct complex roots:
In[3]:=
Out[3]=
Scope
(39)
Options
(4)
Applications
(6)
Properties & Relations
(3)
Possible Issues
(1)
SEE ALSO
Reduce
FindInstance
Exists
ForAll
Conjunction
Disjunction
CylindricalDecomposition
TUTORIALS
Quantifiers
Complex Polynomial Systems
RELATED LINKS
Implementation notes: Algebra and Calculus
MORE ABOUT
Boolean Computation
Logic & Boolean Algebra
Polynomial Algebra
Polynomial Systems
New in 5