Symbolic expression simplifier
Simplify an algebraic expression exactly, with every rewrite listed. Rewrites that would change where the expression is defined are only applied when your assumptions allow them.
Expressions are limited to 1,000 characters, 512 symbols, 24 nesting levels and 100 digits per number, with at most 12 assumed variables. Supported functions are sin, cos, tan, asin, acos, atan, exp, ln, log, sqrt and abs. Everything is computed on your device in a background worker with a 15 second limit. Downloads are a JSON report and a CSV of steps. Use ^ for powers, * or nothing for products, and functions such as sqrt(x) or ln(x). Up to 1,000 characters. Review the settings before running.
Your result
How to use Symbolic expression simplifier
- Type the expression, such as sqrt(x^2)*x^3/x + 3x^3 - x^3.
- Add assumptions such as x > 0 if you want them used.
- Run the simplifier and read the simplified form, the steps and any gated rewrites.
- Check the spot checks, then download the JSON report or the CSV of steps.
Useful next steps
Expressions are limited to 1,000 characters, 512 symbols, 24 nesting levels and 100 digits per number, with at most 12 assumed variables. Supported functions are sin, cos, tan, asin, acos, atan, exp, ln, log, sqrt and abs. Everything is computed on your device in a background worker with a 15 second limit. Downloads are a JSON report and a CSV of steps.
How it simplifies
The simplifier folds exact numbers, collects like terms, expands polynomial parts and applies identities that hold everywhere, such as sqrt(u^2) = abs(u). Fractions stay exact, so 1/3 stays 1/3. Method: OpenStax, College Algebra 2e, chapter 1 Prerequisites (2021).
Assumptions and gated rewrites
Cancelling x/x, turning abs(x) into x or exp(ln(x)) into x is only valid for some values. Those rewrites are applied when an assumption such as x > 0 or x != 0 proves them, and are otherwise listed as gated rewrites with the condition they need.
Spot checks are evidence, not proof
The original and simplified expressions are evaluated at five sample points. Agreement supports the result; the rewrites themselves are the proof.