mathjs 10.0.0 → 10.6.4

package/lib/cjs/function/algebra/simplify.js

@@ -15,18 +15,14 @@ var _factory = require("../../utils/factory.js");
 
 var _util = require("./simplify/util.js");
 
-var _simplifyCore = require("./simplify/simplifyCore.js");
-
 var _simplifyConstant = require("./simplify/simplifyConstant.js");
 
-var _resolve = require("./simplify/resolve.js");
-
 var _object = require("../../utils/object.js");
 
 var _map = require("../../utils/map.js");
 
 var name = 'simplify';
-var dependencies = ['config', 'typed', 'parse', 'add', 'subtract', 'multiply', 'divide', 'pow', 'isZero', 'equal', '?fraction', '?bignumber', 'mathWithTransform', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+var dependencies = ['config', 'typed', 'parse', 'add', 'subtract', 'multiply', 'divide', 'pow', 'isZero', 'equal', 'resolve', 'simplifyCore', '?fraction', '?bignumber', 'mathWithTransform', 'matrix', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
 var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var config = _ref.config,
       typed = _ref.typed,
@@ -38,11 +34,18 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       pow = _ref.pow,
       isZero = _ref.isZero,
       equal = _ref.equal,
+      resolve = _ref.resolve,
+      simplifyCore = _ref.simplifyCore,
       fraction = _ref.fraction,
       bignumber = _ref.bignumber,
       mathWithTransform = _ref.mathWithTransform,
+      matrix = _ref.matrix,
+      AccessorNode = _ref.AccessorNode,
+      ArrayNode = _ref.ArrayNode,
       ConstantNode = _ref.ConstantNode,
       FunctionNode = _ref.FunctionNode,
+      IndexNode = _ref.IndexNode,
+      ObjectNode = _ref.ObjectNode,
       OperatorNode = _ref.OperatorNode,
       ParenthesisNode = _ref.ParenthesisNode,
       SymbolNode = _ref.SymbolNode;
@@ -50,31 +53,17 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
     typed: typed,
     config: config,
     mathWithTransform: mathWithTransform,
+    matrix: matrix,
     fraction: fraction,
     bignumber: bignumber,
+    AccessorNode: AccessorNode,
+    ArrayNode: ArrayNode,
     ConstantNode: ConstantNode,
-    OperatorNode: OperatorNode,
-    FunctionNode: FunctionNode,
-    SymbolNode: SymbolNode
-  });
-  var simplifyCore = (0, _simplifyCore.createSimplifyCore)({
-    equal: equal,
-    isZero: isZero,
-    add: add,
-    subtract: subtract,
-    multiply: multiply,
-    divide: divide,
-    pow: pow,
-    ConstantNode: ConstantNode,
-    OperatorNode: OperatorNode,
-    FunctionNode: FunctionNode,
-    ParenthesisNode: ParenthesisNode
-  });
-  var resolve = (0, _resolve.createResolve)({
-    parse: parse,
     FunctionNode: FunctionNode,
+    IndexNode: IndexNode,
+    ObjectNode: ObjectNode,
     OperatorNode: OperatorNode,
-    ParenthesisNode: ParenthesisNode
+    SymbolNode: SymbolNode
   });
 
   var _createUtil = (0, _util.createUtil)({
@@ -82,12 +71,17 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
     OperatorNode: OperatorNode,
     SymbolNode: SymbolNode
   }),
+      hasProperty = _createUtil.hasProperty,
       isCommutative = _createUtil.isCommutative,
       isAssociative = _createUtil.isAssociative,
+      mergeContext = _createUtil.mergeContext,
       flatten = _createUtil.flatten,
       unflattenr = _createUtil.unflattenr,
       unflattenl = _createUtil.unflattenl,
-      createMakeNodeFunction = _createUtil.createMakeNodeFunction;
+      createMakeNodeFunction = _createUtil.createMakeNodeFunction,
+      defaultContext = _createUtil.defaultContext,
+      realContext = _createUtil.realContext,
+      positiveContext = _createUtil.positiveContext;
   /**
    * Simplify an expression tree.
    *
@@ -118,17 +112,49 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
    * The default list of rules is exposed on the function as `simplify.rules`
    * and can be used as a basis to built a set of custom rules.
    *
+   * To specify a rule as a string, separate the left and right pattern by '->'
+   * When specifying a rule as an object, the following keys are meaningful:
+   * - l - the left pattern
+   * - r - the right pattern
+   * - s - in lieu of l and r, the string form that is broken at -> to give them
+   * - repeat - whether to repeat this rule until the expression stabilizes
+   * - assuming - gives a context object, as in the 'context' option to
+   *     simplify. Every property in the context object must match the current
+   *     context in order, or else the rule will not be applied.
+   * - imposeContext - gives a context object, as in the 'context' option to
+   *     simplify. Any settings specified will override the incoming context
+   *     for all matches of this rule.
+   *
    * For more details on the theory, see:
    *
    * - [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)
    * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
    *
    *  An optional `options` argument can be passed as last argument of `simplify`.
-   *  There is currently one option available:
-   *  - `exactFractions`: a boolean which is `true` by default.
-   *  - `fractionsLimit`: when `exactFractions` is true, a fraction will be returned
-   *    only when both numerator and denominator are smaller than `fractionsLimit`.
-   *    Default value is 10000.
+   *  Currently available options (defaults in parentheses):
+   *  - `consoleDebug` (false): whether to write the expression being simplified
+   *    and any changes to it, along with the rule responsible, to console
+   *  - `context` (simplify.defaultContext): an object giving properties of
+   *    each operator, which determine what simplifications are allowed. The
+   *    currently meaningful properties are commutative, associative,
+   *    total (whether the operation is defined for all arguments), and
+   *    trivial (whether the operation applied to a single argument leaves
+   *    that argument unchanged). The default context is very permissive and
+   *    allows almost all simplifications. Only properties differing from
+   *    the default need to be specified; the default context is used as a
+   *    fallback. Additional contexts `simplify.realContext` and
+   *    `simplify.positiveContext` are supplied to cause simplify to perform
+   *    just simplifications guaranteed to preserve all values of the expression
+   *    assuming all variables and subexpressions are real numbers or
+   *    positive real numbers, respectively. (Note that these are in some cases
+   *    more restrictive than the default context; for example, the default
+   *    context will allow `x/x` to simplify to 1, whereas
+   *    `simplify.realContext` will not, as `0/0` is not equal to 1.)
+   *  - `exactFractions` (true): whether to try to convert all constants to
+   *    exact rational numbers.
+   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will
+   *    be expressed as fractions only when both numerator and denominator
+   *    are smaller than `fractionsLimit`.
    *
    * Syntax:
    *
@@ -151,7 +177,7 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
    *
    * See also:
    *
-   *     derivative, parse, evaluate, rationalize
+   *     simplifyCore, derivative, evaluate, parse, rationalize, resolve
    *
    * @param {Node | string} expr
    *            The expression to be simplified
@@ -199,7 +225,8 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       return this(expr, rules, (0, _map.createMap)(scope), options);
     },
     'Node, Array, Map, Object': function NodeArrayMapObject(expr, rules, scope, options) {
-      rules = _buildRules(rules);
+      var debug = options.consoleDebug;
+      rules = _buildRules(rules, options.context);
       var res = resolve(expr, scope);
       res = removeParens(res);
       var visited = {};
@@ -211,15 +238,40 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
         visited[str] = true;
         _lastsym = 0; // counter for placeholder symbols
 
+        var laststr = str;
+        if (debug) console.log('Working on: ', str);
+
         for (var i = 0; i < rules.length; i++) {
+          var rulestr = '';
+
           if (typeof rules[i] === 'function') {
             res = rules[i](res, options);
+            if (debug) rulestr = rules[i].name;
           } else {
-            flatten(res);
-            res = applyRule(res, rules[i]);
+            flatten(res, options.context);
+            res = applyRule(res, rules[i], options.context);
+
+            if (debug) {
+              rulestr = "".concat(rules[i].l.toString(), " -> ").concat(rules[i].r.toString());
+            }
           }
 
-          unflattenl(res); // using left-heavy binary tree here since custom rule functions may expect it
+          if (debug) {
+            var newstr = res.toString({
+              parenthesis: 'all'
+            });
+
+            if (newstr !== laststr) {
+              console.log('Applying', rulestr, 'produced', newstr);
+              laststr = newstr;
+            }
+          }
+          /* Use left-heavy binary tree internally,
+           * since custom rule functions may expect it
+           */
+
+
+          unflattenl(res, options.context);
         }
 
         str = res.toString({
@@ -230,8 +282,9 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       return res;
     }
   });
-  simplify.simplifyCore = simplifyCore;
-  simplify.resolve = resolve;
+  simplify.defaultContext = defaultContext;
+  simplify.realContext = realContext;
+  simplify.positiveContext = positiveContext;
 
   function removeParens(node) {
     return node.transform(function (node, path, parent) {
@@ -241,8 +294,8 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
 
 
   var SUPPORTED_CONSTANTS = {
-    "true": true,
-    "false": true,
+    true: true,
+    false: true,
     e: true,
     i: true,
     Infinity: true,
@@ -280,72 +333,255 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
     l: 'log(e)',
     r: '1'
   }, // temporary rules
+  // Note initially we tend constants to the right because like-term
+  // collection prefers the left, and we would rather collect nonconstants
   {
-    l: 'n-n1',
-    r: 'n+-n1'
-  }, // temporarily replace 'subtract' so we can further flatten the 'add' operator
+    s: 'n-n1 -> n+-n1',
+    // temporarily replace 'subtract' so we can further flatten the 'add' operator
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n-n -> 0',
+    // partial alternative when we can't always subtract
+    assuming: {
+      subtract: {
+        total: false
+      }
+    }
+  }, {
+    s: '-(c*v) -> v * (-c)',
+    // make non-constant terms positive
+    assuming: {
+      multiply: {
+        commutative: true
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(c*v) -> (-c) * v',
+    // non-commutative version, part 1
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(v*c) -> v * (-c)',
+    // non-commutative version, part 2
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    l: '-(n1/n2)',
+    r: '-n1/n2'
+  }, {
+    l: '-v',
+    r: 'v * (-1)'
+  }, // finish making non-constant terms positive
   {
-    l: '-(c*v)',
-    r: '(-c) * v'
-  }, // make non-constant terms positive
+    l: '(n1 + n2)*(-1)',
+    r: 'n1*(-1) + n2*(-1)',
+    repeat: true
+  }, // expand negations to achieve as much sign cancellation as possible
   {
-    l: '-v',
-    r: '(-1) * v'
-  }, {
     l: 'n/n1^n2',
     r: 'n*n1^-n2'
   }, // temporarily replace 'divide' so we can further flatten the 'multiply' operator
   {
     l: 'n/n1',
     r: 'n*n1^-1'
+  }, {
+    s: '(n1*n2)^n3 -> n1^n3 * n2^n3',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: '(n1*n2)^(-1) -> n2^(-1) * n1^(-1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
   }, // expand nested exponentiation
   {
-    l: '(n ^ n1) ^ n2',
-    r: 'n ^ (n1 * n2)'
-  }, // collect like factors
+    s: '(n ^ n1) ^ n2 -> n ^ (n1 * n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // 1/(1/n) = n needs 1/n to exist
+
+  }, // collect like factors; into a sum, only do this for nonconstants
   {
+    l: ' v   * ( v   * n1 + n2)',
+    r: 'v^2       * n1 +  v   * n2'
+  }, {
+    s: ' v   * (v^n4 * n1 + n2)   ->  v^(1+n4)  * n1 +  v   * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // v*1/v = v^(1+-1) needs 1/v
+
+  }, {
+    s: 'v^n3 * ( v   * n1 + n2)   ->  v^(n3+1)  * n1 + v^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
+    s: 'v^n3 * (v^n4 * n1 + n2)   ->  v^(n3+n4) * n1 + v^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
     l: 'n*n',
     r: 'n^2'
   }, {
-    l: 'n * n^n1',
-    r: 'n^(n1+1)'
+    s: 'n * n^n1 -> n^(n1+1)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // n*1/n = n^(-1+1) needs 1/n
+
   }, {
-    l: 'n^n1 * n^n2',
-    r: 'n^(n1+n2)'
-  }, // collect like terms
+    s: 'n^n1 * n^n2 -> n^(n1+n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // ditto for n^2*1/n^2
+
+  }, // Unfortunately, to deal with more complicated cancellations, it
+  // becomes necessary to simplify constants twice per pass. It's not
+  // terribly expensive compared to matching rules, so this should not
+  // pose a performance problem.
+  simplifyConstant, // First: before collecting like terms
+  // collect like terms
   {
-    l: 'n+n',
-    r: '2*n'
+    s: 'n+n -> 2*n',
+    assuming: {
+      add: {
+        total: true
+      }
+    } // 2 = 1 + 1 needs to exist
+
   }, {
     l: 'n+-n',
     r: '0'
   }, {
-    l: 'n1*n2 + n2',
-    r: '(n1+1)*n2'
+    l: 'v*n + v',
+    r: 'v*(n+1)'
+  }, // NOTE: leftmost position is special:
+  {
+    l: 'n3*n1 + n3*n2',
+    r: 'n3*(n1+n2)'
+  }, // All sub-monomials tried there.
+  {
+    l: 'n3^(-n4)*n1 +   n3  * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+1) *n2)'
+  }, {
+    l: 'n3^(-n4)*n1 + n3^n5 * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+n5)*n2)'
+  }, {
+    s: 'n*v + v -> (n+1)*v',
+    // noncommutative additional cases
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3 + n2*n3 -> (n1+n2)*n3',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    l: 'n*c + c',
+    r: '(n+1)*c'
   }, {
-    l: 'n1*n3 + n2*n3',
-    r: '(n1+n2)*n3'
-  }, // remove parenthesis in the case of negating a quantitiy
+    s: 'c*n + c -> c*(n+1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, simplifyConstant, // Second: before returning expressions to "standard form"
+  // make factors positive (and undo 'make non-constant terms positive')
   {
-    l: 'n1 + -1 * (n2 + n3)',
-    r: 'n1 + -1 * n2 + -1 * n3'
-  }, simplifyConstant, {
-    l: '(-n)*n1',
-    r: '-(n*n1)'
-  }, // make factors positive (and undo 'make non-constant terms positive')
-  // ordering of constants
+    s: '(-n)*n1 -> -(n*n1)',
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n1*(-n) -> -(n1*n)',
+    // in case * non-commutative
+    assuming: {
+      subtract: {
+        total: true
+      },
+      multiply: {
+        commutative: false
+      }
+    }
+  }, // final ordering of constants
   {
-    l: 'c+v',
-    r: 'v+c',
-    context: {
+    s: 'c+v -> v+c',
+    assuming: {
+      add: {
+        commutative: true
+      }
+    },
+    imposeContext: {
       add: {
         commutative: false
       }
     }
   }, {
-    l: 'v*c',
-    r: 'c*v',
-    context: {
+    s: 'v*c -> c*v',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    },
+    imposeContext: {
       multiply: {
         commutative: false
       }
@@ -357,33 +593,127 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
     r: 'n-n1'
   }, // undo replace 'subtract'
   {
-    l: 'n*(n1^-1)',
-    r: 'n/n1'
-  }, // undo replace 'divide'
-  {
-    l: 'n*n1^-n2',
-    r: 'n/n1^n2'
+    s: 'n*(n1^-1) -> n/n1',
+    // undo replace 'divide'; for * commutative
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+
   }, {
-    l: 'n1^-1',
-    r: '1/n1'
+    s: 'n*n1^-n2 -> n/n1^n2',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+
   }, {
-    l: 'n*(n1/n2)',
-    r: '(n*n1)/n2'
-  }, // '*' before '/'
+    s: 'n^-1 -> 1/n',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+
+  }, {
+    l: 'n^1',
+    r: 'n'
+  }, // can be produced by power cancellation
   {
-    l: 'n-(n1+n2)',
-    r: 'n-n1-n2'
-  }, // '-' before '+'
-  // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },
+    s: 'n*(n1/n2) -> (n*n1)/n2',
+    // '*' before '/'
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    s: 'n-(n1+n2) -> n-n1-n2',
+    // '-' before '+'
+    assuming: {
+      addition: {
+        associative: true,
+        commutative: true
+      }
+    }
+  }, // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },
   // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },
+  // simplifyConstant can leave an extra factor of 1, which can always
+  // be eliminated, since the identity always commutes
   {
     l: '1*n',
-    r: 'n'
-  }, // this pattern can be produced by simplifyConstant
-  {
-    l: 'n1/(n2/n3)',
-    r: '(n1*n3)/n2'
+    r: 'n',
+    imposeContext: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: 'n1/(n2/n3) -> (n1*n3)/n2',
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    l: 'n1/(-n2)',
+    r: '-n1/n2'
   }];
+  /**
+   * Takes any rule object as allowed by the specification in simplify
+   * and puts it in a standard form used by applyRule
+   */
+
+  function _canonicalizeRule(ruleObject, context) {
+    var newRule = {};
+
+    if (ruleObject.s) {
+      var lr = ruleObject.s.split('->');
+
+      if (lr.length === 2) {
+        newRule.l = lr[0];
+        newRule.r = lr[1];
+      } else {
+        throw SyntaxError('Could not parse rule: ' + ruleObject.s);
+      }
+    } else {
+      newRule.l = ruleObject.l;
+      newRule.r = ruleObject.r;
+    }
+
+    newRule.l = removeParens(parse(newRule.l));
+    newRule.r = removeParens(parse(newRule.r));
+
+    for (var _i = 0, _arr = ['imposeContext', 'repeat', 'assuming']; _i < _arr.length; _i++) {
+      var prop = _arr[_i];
+
+      if (prop in ruleObject) {
+        newRule[prop] = ruleObject[prop];
+      }
+    }
+
+    if (ruleObject.evaluate) {
+      newRule.evaluate = parse(ruleObject.evaluate);
+    }
+
+    if (isAssociative(newRule.l, context)) {
+      var makeNode = createMakeNodeFunction(newRule.l);
+
+      var expandsym = _getExpandPlaceholderSymbol();
+
+      newRule.expanded = {};
+      newRule.expanded.l = makeNode([newRule.l.clone(), expandsym]); // Push the expandsym into the deepest possible branch.
+      // This helps to match the newRule against nodes returned from getSplits() later on.
+
+      flatten(newRule.expanded.l, context);
+      unflattenr(newRule.expanded.l, context);
+      newRule.expanded.r = makeNode([newRule.r, expandsym]);
+    }
+
+    return newRule;
+  }
   /**
    * Parse the string array of rules into nodes
    *
@@ -401,60 +731,26 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
    * 'n1 * c1 -> c1 * n1'
    */
 
-  function _buildRules(rules) {
+
+  function _buildRules(rules, context) {
     // Array of rules to be used to simplify expressions
     var ruleSet = [];
 
     for (var i = 0; i < rules.length; i++) {
       var rule = rules[i];
       var newRule = void 0;
-      var ruleType = (0, _typeof2["default"])(rule);
+      var ruleType = (0, _typeof2.default)(rule);
 
       switch (ruleType) {
         case 'string':
-          {
-            var lr = rule.split('->');
-
-            if (lr.length === 2) {
-              rule = {
-                l: lr[0],
-                r: lr[1]
-              };
-            } else {
-              throw SyntaxError('Could not parse rule: ' + rule);
-            }
-          }
+          rule = {
+            s: rule
+          };
 
         /* falls through */
 
         case 'object':
-          newRule = {
-            l: removeParens(parse(rule.l)),
-            r: removeParens(parse(rule.r))
-          };
-
-          if (rule.context) {
-            newRule.evaluate = rule.context;
-          }
-
-          if (rule.evaluate) {
-            newRule.evaluate = parse(rule.evaluate);
-          }
-
-          if (isAssociative(newRule.l)) {
-            var makeNode = createMakeNodeFunction(newRule.l);
-
-            var expandsym = _getExpandPlaceholderSymbol();
-
-            newRule.expanded = {};
-            newRule.expanded.l = makeNode([newRule.l.clone(), expandsym]); // Push the expandsym into the deepest possible branch.
-            // This helps to match the newRule against nodes returned from getSplits() later on.
-
-            flatten(newRule.expanded.l);
-            unflattenr(newRule.expanded.l);
-            newRule.expanded.r = makeNode([newRule.r, expandsym]);
-          }
-
+          newRule = _canonicalizeRule(rule, context);
           break;
 
         case 'function':
@@ -478,71 +774,156 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
   function _getExpandPlaceholderSymbol() {
     return new SymbolNode('_p' + _lastsym++);
   }
+
+  function mapRule(nodes, rule, context) {
+    var resNodes = nodes;
+
+    if (nodes) {
+      for (var i = 0; i < nodes.length; ++i) {
+        var newNode = applyRule(nodes[i], rule, context);
+
+        if (newNode !== nodes[i]) {
+          if (resNodes === nodes) {
+            resNodes = nodes.slice();
+          }
+
+          resNodes[i] = newNode;
+        }
+      }
+    }
+
+    return resNodes;
+  }
   /**
    * Returns a simplfied form of node, or the original node if no simplification was possible.
    *
    * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {Object | Function} rule
+   * @param  {Object} context -- information about assumed properties of operators
    * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.
    */
 
 
-  var applyRule = typed('applyRule', {
-    'Node, Object': function NodeObject(node, rule) {
-      // console.log('Entering applyRule(' + node.toString() + ')')
-      // Do not clone node unless we find a match
-      var res = node; // First replace our child nodes with their simplified versions
-      // If a child could not be simplified, the assignments will have
-      // no effect since the node is returned unchanged
-
-      if (res instanceof OperatorNode || res instanceof FunctionNode) {
-        if (res.args) {
-          for (var i = 0; i < res.args.length; i++) {
-            res.args[i] = applyRule(res.args[i], rule);
+  function applyRule(node, rule, context) {
+    //    console.log('Entering applyRule("', rule.l.toString({parenthesis:'all'}), '->', rule.r.toString({parenthesis:'all'}), '",', node.toString({parenthesis:'all'}),')')
+    // check that the assumptions for this rule are satisfied by the current
+    // context:
+    if (rule.assuming) {
+      for (var symbol in rule.assuming) {
+        for (var property in rule.assuming[symbol]) {
+          if (hasProperty(symbol, property, context) !== rule.assuming[symbol][property]) {
+            return node;
           }
         }
-      } else if (res instanceof ParenthesisNode) {
-        if (res.content) {
-          res.content = applyRule(res.content, rule);
+      }
+    }
+
+    var mergedContext = mergeContext(rule.imposeContext, context); // Do not clone node unless we find a match
+
+    var res = node; // First replace our child nodes with their simplified versions
+    // If a child could not be simplified, applying the rule to it
+    // will have no effect since the node is returned unchanged
+
+    if (res instanceof OperatorNode || res instanceof FunctionNode) {
+      var newArgs = mapRule(res.args, rule, context);
+
+      if (newArgs !== res.args) {
+        res = res.clone();
+        res.args = newArgs;
+      }
+    } else if (res instanceof ParenthesisNode) {
+      if (res.content) {
+        var newContent = applyRule(res.content, rule, context);
+
+        if (newContent !== res.content) {
+          res = new ParenthesisNode(newContent);
         }
-      } // Try to match a rule against this node
+      }
+    } else if (res instanceof ArrayNode) {
+      var newItems = mapRule(res.items, rule, context);
 
+      if (newItems !== res.items) {
+        res = new ArrayNode(newItems);
+      }
+    } else if (res instanceof AccessorNode) {
+      var newObj = res.object;
 
-      var repl = rule.r;
+      if (res.object) {
+        newObj = applyRule(res.object, rule, context);
+      }
 
-      var matches = _ruleMatch(rule.l, res)[0]; // If the rule is associative operator, we can try matching it while allowing additional terms.
-      // This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.
+      var newIndex = res.index;
 
+      if (res.index) {
+        newIndex = applyRule(res.index, rule, context);
+      }
 
-      if (!matches && rule.expanded) {
-        repl = rule.expanded.r;
-        matches = _ruleMatch(rule.expanded.l, res)[0];
+      if (newObj !== res.object || newIndex !== res.index) {
+        res = new AccessorNode(newObj, newIndex);
       }
+    } else if (res instanceof IndexNode) {
+      var newDims = mapRule(res.dimensions, rule, context);
 
-      if (matches) {
-        // const before = res.toString({parenthesis: 'all'})
-        // Create a new node by cloning the rhs of the matched rule
-        // we keep any implicit multiplication state if relevant
-        var implicit = res.implicit;
-        res = repl.clone();
+      if (newDims !== res.dimensions) {
+        res = new IndexNode(newDims);
+      }
+    } else if (res instanceof ObjectNode) {
+      var changed = false;
+      var newProps = {};
 
-        if (implicit && 'implicit' in repl) {
-          res.implicit = true;
-        } // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes
+      for (var prop in res.properties) {
+        newProps[prop] = applyRule(res.properties[prop], rule, context);
 
+        if (newProps[prop] !== res.properties[prop]) {
+          changed = true;
+        }
+      }
 
-        res = res.transform(function (node) {
-          if (node.isSymbolNode && (0, _object.hasOwnProperty)(matches.placeholders, node.name)) {
-            return matches.placeholders[node.name].clone();
-          } else {
-            return node;
-          }
-        }); // const after = res.toString({parenthesis: 'all'})
-        // console.log('Simplified ' + before + ' to ' + after)
+      if (changed) {
+        res = new ObjectNode(newProps);
       }
+    } // Try to match a rule against this node
 
-      return res;
+
+    var repl = rule.r;
+
+    var matches = _ruleMatch(rule.l, res, mergedContext)[0]; // If the rule is associative operator, we can try matching it while allowing additional terms.
+    // This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.
+
+
+    if (!matches && rule.expanded) {
+      repl = rule.expanded.r;
+      matches = _ruleMatch(rule.expanded.l, res, mergedContext)[0];
     }
-  });
+
+    if (matches) {
+      // const before = res.toString({parenthesis: 'all'})
+      // Create a new node by cloning the rhs of the matched rule
+      // we keep any implicit multiplication state if relevant
+      var implicit = res.implicit;
+      res = repl.clone();
+
+      if (implicit && 'implicit' in repl) {
+        res.implicit = true;
+      } // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes
+
+
+      res = res.transform(function (node) {
+        if (node.isSymbolNode && (0, _object.hasOwnProperty)(matches.placeholders, node.name)) {
+          return matches.placeholders[node.name].clone();
+        } else {
+          return node;
+        }
+      }); // const after = res.toString({parenthesis: 'all'})
+      // console.log('Simplified ' + before + ' to ' + after)
+    }
+
+    if (rule.repeat && res !== node) {
+      res = applyRule(res, rule, context);
+    }
+
+    return res;
+  }
   /**
    * Get (binary) combinations of a flattened binary node
    * e.g. +(node1, node2, node3) -> [
@@ -552,6 +933,7 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
    *
    */
 
+
   function getSplits(node, context) {
     var res = [];
     var right, rightArgs;
@@ -565,9 +947,18 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
         res.push(makeNode([node.args[i], right]));
       }
     } else {
-      rightArgs = node.args.slice(1);
-      right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
-      res.push(makeNode([node.args[0], right]));
+      // Keep order, but try all parenthesizations
+      for (var _i2 = 1; _i2 < node.args.length; _i2++) {
+        var left = node.args[0];
+
+        if (_i2 > 1) {
+          left = makeNode(node.args.slice(0, _i2));
+        }
+
+        rightArgs = node.args.slice(_i2);
+        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
+        res.push(makeNode([left, right]));
+      }
     }
 
     return res;
@@ -670,15 +1061,19 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
    *
    * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} rule
    * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param {Object} context -- provides assumed properties of operators
+   * @param {Boolean} isSplit -- whether we are in process of splitting an
+   *                    n-ary operator node into possible binary combinations.
+   *                    Defaults to false.
    * @return {Object} Information about the match, if it exists.
    */
 
 
-  function _ruleMatch(rule, node, isSplit) {
+  function _ruleMatch(rule, node, context, isSplit) {
     //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')
     //    console.log('rule = ' + rule)
     //    console.log('node = ' + node)
-    //    console.log('Entering _ruleMatch(' + rule.toString() + ', ' + node.toString() + ')')
+    //    console.log('Entering _ruleMatch(', rule.toString({parenthesis:'all'}), ', ', node.toString({parenthesis:'all'}), ', ', context, ')')
     var res = [{
       placeholders: {}
     }];
@@ -696,32 +1091,65 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       } // rule and node match. Search the children of rule and node.
 
 
-      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node) && node.args.length === rule.args.length || isSplit) {
-        // Expect non-associative operators to match exactly
+      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node, context) && node.args.length === rule.args.length || isSplit) {
+        // Expect non-associative operators to match exactly,
+        // except in any order if operator is commutative
         var childMatches = [];
 
         for (var i = 0; i < rule.args.length; i++) {
-          var childMatch = _ruleMatch(rule.args[i], node.args[i]);
+          var childMatch = _ruleMatch(rule.args[i], node.args[i], context);
 
           if (childMatch.length === 0) {
             // Child did not match, so stop searching immediately
-            return [];
+            break;
           } // The child matched, so add the information returned from the child to our result
 
 
           childMatches.push(childMatch);
         }
 
+        if (childMatches.length !== rule.args.length) {
+          if (!isCommutative(node, context) || // exact match in order needed
+          rule.args.length === 1) {
+            // nothing to commute
+            return [];
+          }
+
+          if (rule.args.length > 2) {
+            /* Need to generate all permutations and try them.
+             * It's a bit complicated, and unlikely to come up since there
+             * are very few ternary or higher operators. So punt for now.
+             */
+            throw new Error('permuting >2 commutative non-associative rule arguments not yet implemented');
+          }
+          /* Exactly two arguments, try them reversed */
+
+
+          var leftMatch = _ruleMatch(rule.args[0], node.args[1], context);
+
+          if (leftMatch.length === 0) {
+            return [];
+          }
+
+          var rightMatch = _ruleMatch(rule.args[1], node.args[0], context);
+
+          if (rightMatch.length === 0) {
+            return [];
+          }
+
+          childMatches = [leftMatch, rightMatch];
+        }
+
         res = mergeChildMatches(childMatches);
       } else if (node.args.length >= 2 && rule.args.length === 2) {
         // node is flattened, rule is not
         // Associative operators/functions can be split in different ways so we check if the rule matches each
         // them and return their union.
-        var splits = getSplits(node, rule.context);
+        var splits = getSplits(node, context);
         var splitMatches = [];
 
-        for (var _i = 0; _i < splits.length; _i++) {
-          var matchSet = _ruleMatch(rule, splits[_i], true); // recursing at the same tree depth here
+        for (var _i3 = 0; _i3 < splits.length; _i3++) {
+          var matchSet = _ruleMatch(rule, splits[_i3], context, true); // recursing at the same tree depth here
 
 
           splitMatches = splitMatches.concat(matchSet);