Thank you very much for your short introduction. It definitely helped me along a bit. All the same I still have some issues with that.
First, an interpretation question on the lines
if andmap( l -> l :: (identical(q) = anything), L) then
L := map(l -> [l,op([2,2],l)], L);
I´m pretty sure I know what is done by the first given line, but I don´t know on what way this is done. Mainly I can´t figure out what "l -> l" does and what is actually meant by l as you didn´t define it. It is only set as a local variable for this procedure (as I see it).
In the second line I´m not sure what is done there!? And what is meant by l here as you used l before?
Then, another issue, but I think it will be answered along with an explanation to the lines mentioned: how do you tell Maple how often to check whether all "q"´s are identical? What I mean is, on what way does Maple figure out in how many pieces this pw is split up into and then check the q for exactly this amount? I couldn´t find how this is done anywhere.
And last my main issue, as I could just ignore the other issues and c/p your suggestion without real comprehension of what is done in each step. But in this case I couldn´t do that anyway. The way you set up the procedure doesn´t work with the piecewise function as I have them in my problem.
The way you defined the pw is:
piecewise(x < 1,q[O] = x,q[O] = x^2)
whereas I have them in a form like:
piecewise(x < 1,q[O] = x, )
And of course the "otherwise" part of the function is not an equation. That way the procedure can´t solve the way you suggested. Is there a way around this problem? For example by somehow omitting the check for the "otherwise" part of the piecewise?
Thanks again for your great help, I really appreciate it.