intersect(M, N)
intersect(M, N, ..., P)
This function calculates the intersection of submodules of the same free module, or of ideals in the same ring.
The following example computes the intersection of a sequence of ideals.
|
|
The following example computes the intersection of a list of modules.
|
|
|
|
|
The command intersect does not accept subrings. To intersect an ideal with a subring, use selectInSubring along with the elimination ordering, see Eliminate.
Multiple strategies are implemented via hooks and can be listed using the function hooks. More strategies may be added using addHook.
|
|
By default, the strategies are attempted in the reverse order in which the were added, until one is successful. To run a specific strategy instead, use the optional argument Strategy.
|