# FullSimplify

FullSimplify[expr]

tries a wide range of transformations on expr involving elementary and special functions and returns the simplest form it finds.

FullSimplify[expr,assum]

does simplification using assumptions.

# Details and Options • FullSimplify will always yield at least as simple a form as Simplify, but may take substantially longer.
• FullSimplify uses RootReduce on expressions that involve Root objects.
• FullSimplify does transformations on most kinds of special functions.
• With assumptions of the form ForAll[vars,axioms], FullSimplify can simplify expressions and equations involving symbolic functions. »
• You can specify default assumptions for FullSimplify using Assuming.
• The following options can be given:
•  Assumptions \$Assumptions default assumptions to append to assum ComplexityFunction Automatic how to assess the complexity of each form generated ExcludedForms {} patterns specifying forms of subexpression that should not be touched TimeConstraint Infinity for how many seconds to try doing any particular transformation TransformationFunctions Automatic functions to try in transforming the expression Trig True whether to do trigonometric as well as algebraic transformations
• Assumptions can consist of equations, inequalities, domain specifications such as xIntegers, and logical combinations of these.
• With the setting TimeConstraint->{tloc,ttot}, at most tloc seconds are spent for any particular transformation, and at most ttot seconds are spent for all transformations before the best result is returned.

# Examples

open all close all

## Basic Examples(3)

Simplify an expression involving special functions:

 In:= Out= Simplify using assumptions:

 In:= Out= Prove a simple theorem from the assumption of associativity:

 In:= Out= ## Neat Examples(1)

Introduced in 1996
(3.0)
|
Updated in 2014
(10.0)