Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://reference.wolfram.com/language/ref/Resolve.html below:

Resolve—Wolfram Language Documentation

We deliver solutions for the AI era—combining symbolic computation, data-driven insights and deep technology expertise.

• Data & Computational Intelligence
• Model-Based Design
• Algorithm Development
• Wolfram|Alpha for Business
• Blockchain Technology
• Education Technology
• Quantum Computation

WolframConsulting.com

• See Also
  • Reduce
  • FindInstance
  • Exists
  • ForAll
  • Conjunction
  • Disjunction
  • CylindricalDecomposition
  • PolynomialSumOfSquaresList
• Related Guides
  • Polynomial Systems
  • Theorem Proving
  • Polynomial Algebra
  • Boolean Computation
  • Logic & Boolean Algebra
  • Solvers over Regions
  • Operations on Sets
  • Finite Fields
• Tech Notes
  • Quantifiers
  • Complex Polynomial Systems
  • Implementation notes: Algebra and Calculus

Resolve[expr]

attempts to resolve expr into a form that eliminates ForAll and Exists quantifiers.

• 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 statement expr can be any logical combination of:
• lhs==rhs equations lhs!=rhs inequations lhs>rhs or lhs>=rhs inequalities expr∈dom domain specifications {x,y,…}∈reg region specification ForAll[x,cond,expr] universal quantifiers Exists[x,cond,expr] existential quantifiers
• 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 principle always eliminate quantifiers for any Boolean expression expr.

Prove that the unit disk is nonempty:

Find the conditions for a quadratic form over the reals to be positive:

Find conditions for a quadratic to have at least two distinct complex roots:

Find the projection of a geometric region:

Decide the existence of solutions of a univariate polynomial equation:

Decide the existence of solutions of a multivariate polynomial system:

Decide the truth value of fully quantified polynomial formulas:

Find conditions under which a polynomial equation has solutions:

Find conditions under which a polynomial system has solutions:

Find conditions under which a quantified polynomial formula is true:

Decide the existence of solutions of a univariate polynomial equation:

Decide the existence of solutions of a univariate polynomial inequality:

Decide the existence of solutions of a multivariate polynomial system:

Decide the truth value of fully quantified polynomial formulas:

Decide the existence of solutions of an exp-log equation:

Decide the existence of solutions of an exp-log inequality:

Decide the existence of solutions of an elementary function equation in a bounded interval:

Decide the existence of solutions of a holomorphic function equation in a bounded interval:

Decide the existence of solutions of a periodic elementary function equation:

Fully quantified formulas exp-log in the first variable and polynomial in the other variables:

Fully quantified formulas elementary and bounded in the first variable:

Fully quantified formulas holomorphic and bounded in the first variable:

Find conditions under which a linear system has solutions:

Find conditions under which a quadratic system has solutions:

Find conditions under which a polynomial system has solutions:

Find conditions under which a formula linear in quantified variables is true:

Find conditions under which a formula quadratic in quantified variables is true:

Find conditions under which a quantified polynomial formula is true:

Decide the existence of solutions of a linear system of equations:

Decide the existence of solutions of a linear system of equations and inequalities:

Decide the existence of solutions of a univariate polynomial equation:

Decide the existence of solutions of a univariate polynomial inequality:

Decide the existence of solutions of Frobenius equations:

Decide the existence of solutions of binary quadratic equations:

Decide the existence of solutions of a Thue equation:

Decide the existence of solutions of a sum of squares equation:

Decide the existence of solutions of a bounded system of equations and inequalities:

Decide the existence of solutions of a system of congruences:

Decide the satisfiability of a Boolean formula:

Find conditions under which a quantified Boolean formula is true:

Decide the existence of solutions of univariate equations:

Verify that a univariate equation is satisfied by all field elements:

Decide the existence of solutions of systems of linear equations:

Decide the existence of solutions of systems of polynomial equations:

Eliminate quantifiers:

Decide the existence of solutions of an equation involving a real and a complex variable:

Decide the existence of solutions of an inequality involving Abs[x]:

Find under what conditions a fourth power of a complex number is real:

Test :

Get conditions for :

Project a cone to the - plane:

Plot it:

An implicitly defined region:

A parametrically defined region:

Derived regions:

Plot it:

Regions dependent on parameters:

The conditions on indicate when the line intersects the circle:

A condition for :

The condition tells when :

Vector variables:

Here the solutions for x are expressed in terms of y:

With Backsubstitution->True, Resolve gives explicit numeric values for x:

By default, Resolve does not use general formulas for solving cubics in radicals:

With Cubics->True, Resolve expresses roots of cubics in terms of radicals:

By default, Resolve does not use general formulas for solving quartics in radicals:

With Quartics->True, Resolve expresses roots of quartics in terms of radicals:

This computation takes a long time due to high degrees of algebraic numbers involved:

With WorkingPrecision->100 you get an answer faster, but it may be incorrect:

Find conditions for a quintic to have all roots equal:

Find conditions for a quadratic to be always positive:

Prove the inequality between the arithmetic mean and the geometric mean:

Prove a special case of Hölder's inequality:

Prove a special case of Minkowski's inequality:

The region is a subset of , if is true. Show that Disk[{0,0},{2,1}] is a subset of Rectangle[{-2,-1},{2,1}]:

Plot it:

Show that Cylinder[]⊆Ball[{0,0,0},2]:

Plot it:

A region is disjoint from if . Show that Circle[{0,0},2] and Disk[{0,0},1] are disjoint:

There are no points in the intersection, so they are disjoint:

Plot it:

A region intersects if . Show that Circle[{0,0},1] intersects Disk[{1/2,0},1]:

There are points in the intersection:

Plot it:

For fully quantified systems of equations and inequalities, Resolve is equivalent to Reduce:

A solution instance can be found with FindInstance:

For systems with free variables, Resolve may return an unsolved system:

Reduce eliminates quantifiers and solves the resulting system:

Eliminate can be used to eliminate variables from systems of complex polynomial equations:

Resolve gives the same equations, but may also give inequations:

Find a formula description of a TransformedRegion:

Compute a formula description of using RegionMember:

Check that the formulas are equivalent:

Resolve shows that the polynomial is non-negative:

Use PolynomialSumOfSquaresList to represent as a sum of squares:

The Motzkin polynomial is non-negative, but is not a sum of squares:

Because x appears in an inequality, it is assumed to be real:

This allows complex values of x for which both sides of the inequality are real:

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4