[back] [prev] [next] [index] [root]

<p>&nbsp;<p>
<hr noshade size="5">
<h2><a name="ModuleMove"></a>
ModuleMove
</h2>

Changes the coefficient order of the module.

<p><p>

<h3>
Syntax:
</h3>
<pre>M2 := ModuleMove(M1, o);</pre>

<p>

<table>
<tr>
<td>same type as M1</td>
<td><pre>  M2  </pre></td>
<td></td>
</tr>
<tr>
<td>module | list of modules</td>
<td><pre>  M1  </pre></td>
<td></td>
</tr>
<tr>
<td>order</td>
<td><pre>  o  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#EltMove">EltMove</a>, <a href="kashref.html#IdealMove">IdealMove</a>

<p>

<h3>
Description:
</h3>
Suppose <tt> M1</tt> is an o_1-module and there is an
order o_2 such that there is an homomorphism from
\phi:o_1\too_2 this function will compute \phi(<tt> M1</tt>).
This is done simply by applying \phi to all the
matrix elements and to the coefficient ideals of <tt> M1</tt>.
\phi must be known to the system before using this
function.

If <tt> M1</tt> is a list of modules all modules contained are
moved.

<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>

<pre>

kash> O:=Order(Poly(Zx,[1,1,-4,-14,3,1]));;
kash> o:=OrderMaximal(O);;
kash> M:=Module([Ideal(2,Elt(o,[0, 0, 0, 1, 1])),1*o],
> Mat(o,[[1,Elt(o, [2, 2, 0, 2, 0])],[0,1]]));
{<2, [0, 0, 0, 1, 1]><1>
[1 [2, 2, 0, 2, 0]]
[0 1]
}

kash> M1:=ModuleMove(M, O);
{<2, [2, 1, 1, 1, 1] / 2><1>
[1 [3, 3, 1, 1, 0]]
[0 1]
}

kash> M2:=ModuleMove(M1, o);
{<2, [0, 0, 0, 1, 1]><1>
[1 [2, 2, 0, 2, 0]]
[0 1]
}

kash> M=M2;
> true

</pre>

<p>


<hr>

<p>
<a href="../kashref.html"><- back</a>[back] [prev] [next] [index] [root]