Hello, I am wondering if I have say two modules R=QQ[[x,y,z]], S=QQ[[x,y^2+1,z]] (we can also make R and S as polynomial rings). R is naturally an S module as S can act on R by multiplication. Is there a command which determines whether R is free over S and the rank?
Revision history [back]
 | 1 | initial version |
Determining whether module is free for polynomial/power series rings
Determining whether module is free for polynomial/power series rings
Hello, I am wondering if Say I have say two modules R=QQ[[x,y,z]], S=QQ[[x,y^2+1,z]] modules
R = QQ[[x, y, z]]
S = QQ[[x, y^2 + 1, z]]
(we can also make R R and S S as polynomial rings). R rings).
R is naturally an S S module as S S can act on R R by multiplication. multiplication.
Is there a command which determines whether R R is free over S S and the rank? rank?
Determining whether module is free for polynomial/power series rings
Say I have two modules
R = QQ[[x, y, z]]
S = QQ[[x, y^2 + 1, y^2, z]]
(we can also make R and S as polynomial rings).
R is naturally an S module as S can act on R by multiplication.
Is there a command which determines whether R is free over S and the rank?
| | 4 | retagged |
Determining whether module is free for polynomial/power series rings
Say I have two modules
R = QQ[[x, y, z]]
S = QQ[[x, y^2, z]]
(we can also make R and S as polynomial rings).
R is naturally an S module as S can act on R by multiplication.
Is there a command which determines whether R is free over S and the rank?
