Re: Simplifying expressions using rules with recursion

*To*: mathgroup at smc.vnet.net*Subject*: [mg127612] Re: Simplifying expressions using rules with recursion*From*: Bob Hanlon <hanlonr357 at gmail.com>*Date*: Tue, 7 Aug 2012 03:02:47 -0400 (EDT)*Delivered-to*: l-mathgroup@mail-archive0.wolfram.com*Delivered-to*: l-mathgroup@wolfram.com*Delivered-to*: mathgroup-newout@smc.vnet.net*Delivered-to*: mathgroup-newsend@smc.vnet.net*References*: <20120806083648.8090367FE@smc.vnet.net>

expr = A.B.A + C.A.B.A; expr /. A.B.A -> A A + C.A Bob Hanlon On Mon, Aug 6, 2012 at 4:36 AM, <wimmer.mike at googlemail.com> wrote: > I would like to use Mathematica to simplify a long expression consisting of tems of products of matrices. These matrices obey equations of the form A = A.B.A, and I would like Mathematica to use these identities to simplify my expression. > How can I tell Mathematica to do that? Just entering > > [1]: A = A.B.A > > does not work, as Mathematica will complain about too man recursions (which I understand). But how do > I do it properly? >

**References**:**Simplifying expressions using rules with recursion***From:*wimmer.mike@googlemail.com