3 corrected spelling

I want to ask: is there any general method for variable substitution in multiple summation?

For example in the following equation a new variable $\lambda=n+m-2\mu$ is introduced to transform the LHS to the RHS $$\sum_{n=0}^\infty \sum_{m=0}^\infty \sum_{\mu=0}^{\left\lfloor \frac{m+n}{2}\right\rfloor}f(n,m,\mu,n+m-2\mu) = \sum_{\lambda=0}^\infty \sum_{\mu=0}^\infty \sum_{n=0}^{2\mu+\lambda}f(n,2\mu+\lambda-n,\mu,\lambda)$$

Another example, in which a new variable $\delta=m+n+2 p-2 k-2 \mu-2 \sigma$ is introduced

$$\sum _{n=0}^{\infty } \sum _{m=0}^{\infty } \sum _{p=0}^M \sum _{k=0}^p \sum _{\sigma =0}^{p-k}\quad \sum _{\mu =0}^{\left\lfloor \frac{m+n}{2}+p-k-\sigma \right\rfloor } f(n,m,\mu ,p,k,\sigma ,m+n+2 p-2 k-2 \mu-2 \sigma )$$ $$= \sum _{\delta =0}^{\infty } \sum _{\mu =0}^{\infty } \sum _{p=0}^M \quad\sum _{\beta =0}^{\min \left(p,\left\lfloor \frac{\delta }{2}+\mu \right\rfloor \right)}\quad \sum _{n=0}^{2 (\mu -\beta )+\delta }\quad \sum _{k=0}^{p-\beta }\;\; f(n,\delta +2 \mu-2 \beta -n,\mu ,p,k,p-\beta -k,\delta )$$

Additional remarks: my goal is using a new summation index, e.g. $\lambda$, to express a particular linear combination of the old indices, which is appointed by me, e.g. $n+m-2\mu$. So this is a linear coordinate transformation. My problem is how to determine all the lower and upper bound bounds of the new summation indices frame, as well as the summation steps which are possibly not $1$.

I wonder whether there is a systematical and efficient technology, so I may be able to do those transformations automatically by programming.

I want to ask: is there any general method for variable substitution in multiple summation?

For example in the following equation a new variable $\lambda=n+m-2\mu$ is introduced to transform the LHS to the RHS $$\sum_{n=0}^\infty \sum_{m=0}^\infty \sum_{\mu=0}^{\left\lfloor \frac{m+n}{2}\right\rfloor}f(n,m,\mu,n+m-2\mu) = \sum_{\lambda=0}^\infty \sum_{\mu=0}^\infty \sum_{n=0}^{2\mu+\lambda}f(n,2\mu+\lambda-n,\mu,\lambda)$$

Another example, in which a new variable $\delta=m+n+2 p-2 k-2 \mu-2 \sigma$ is introduced

$$\sum _{n=0}^{\infty } \sum _{m=0}^{\infty } \sum _{p=0}^M \sum _{k=0}^p \sum _{\sigma =0}^{p-k}\quad \sum _{\mu =0}^{\left\lfloor \frac{m+n}{2}+p-k-\sigma \right\rfloor } f(n,m,\mu ,p,k,\sigma ,m+n+2 p-2 k-2 \mu-2 \sigma )$$ $$= \sum _{\delta =0}^{\infty } \sum _{\mu =0}^{\infty } \sum _{p=0}^M \quad\sum _{\beta =0}^{\min \left(p,\left\lfloor \frac{\delta }{2}+\mu \right\rfloor \right)}\quad \sum _{n=0}^{2 (\mu -\beta )+\delta }\quad \sum _{k=0}^{p-\beta }\;\; f(n,\delta +2 \mu-2 \beta -n,\mu ,p,k,p-\beta -k,\delta )$$

Additional remarks: my goal is using a new summation index, e.g. $\lambda$, to express a particular linear combination of the old indices, which is appointed by me, e.g. $n+m-2\mu$. So this is a linear coordinate transformation. My problem is how to determine all the lower and upper bound of the new summation indices frame, as well as the summation steps which are possibly not $1$.

I wonder whether there is a systematical and efficient technology, so I may be able to do those transformations by programming.

1