Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Quotients of modules #826

Merged
merged 7 commits into from
Sep 19, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
60 changes: 59 additions & 1 deletion src/module/module.jl
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
export jet, minimal_generating_set, ModuleClass, rank, smodule, slimgb,
eliminate, modulo, lift, division, divrem, prune_with_map,
prune_with_map_projection
prune_with_map_projection, quotient, contains, saturation, saturation2

###############################################################################
#
Expand Down Expand Up @@ -446,6 +446,7 @@ function nres(I::smodule{spoly{T}}, max_length::Int) where T <: Nemo.FieldElem
return sresolution{spoly{T}}(R, r, Bool(minimal), false)
end


###############################################################################
#
# Module constructors
Expand Down Expand Up @@ -650,3 +651,60 @@ function hilbert_series(M::smodule{spoly{T}}, w::Vector{<:Integer}, shifts::Vect
GC.@preserve M R libSingular.scHilbWeighted(M.ptr, R.ptr, w, shifts, z)
return z
end

###############################################################################
#
# Containment
#
###############################################################################

function contains(I::smodule{spoly{T}}, J::smodule{spoly{T}}) where T <: Nemo.FieldElem
check_parent(I, J)
if !I.isGB
I = std(I)
end
return iszero(reduce(J, I))
end

###############################################################################
#
# Quotient
#
###############################################################################

function quotient(I::smodule{spoly{T}}, J::smodule{spoly{T}}) where T <: Nemo.FieldElem
R = base_ring(I)
S = elem_type(R)
ptr = GC.@preserve I J R libSingular.id_Quotient(I.ptr, J.ptr, I.isGB, R.ptr)
return Module(smatrix{spoly{T}}(R, ptr))
end

###############################################################################
#
# Saturation
#
###############################################################################
function saturation(I::smodule{spoly{T}}, J::smodule{spoly{T}}) where T <: Nemo.FieldElem
check_parent(I, J)
has_global_ordering(base_ring(I)) || error("Must be over a ring with global ordering")
if !I.isGB
I = std(I)
end
k = 0
done = false
while !done
Q = quotient(I, J)
done = contains(I, Q)
I = std(Q)
k += 1
end
return I, k - 1
end

function saturation2(I::smodule{spoly{T}}, J::smodule{spoly{T}}) where T <: Nemo.FieldElem
check_parent(I, J)
R = base_ring(I)
has_global_ordering(R) || error("Must be over a ring with global ordering")
ptr_res,k=libSingular.id_Saturation(I.ptr,J.ptr,R.ptr)
return (Module(smatrix{spoly{T}}(R,ptr_res))),k
end
42 changes: 42 additions & 0 deletions test/module/smodule-test.jl
Original file line number Diff line number Diff line change
Expand Up @@ -330,3 +330,45 @@ end
@test p[3] == 2

end

@testset "smodule.contains" begin
R, (x, y) = polynomial_ring(QQ, ["x", "y"])

I = Singular.Module(R, vector(R,y^3))
J = Singular.Module(R, vector(R,y^2))

@test contains(I, J) == false
@test contains(J, I) == true
end

@testset "smodule.quotient" begin
R, (x, y) = polynomial_ring(QQ, ["x", "y"])

I = Singular.Module(R, vector(R,x^2 + x*y + 1), vector(R,2y^2 + 3))
J = Singular.Module(R, vector(R,x*y^2 + x + 1), vector(R,2x*y + 1), vector(R,x*y + 1))

A = quotient(I, J)
B = Singular.Module(R, vector(R, 2*y^2+3), vector(R, x^2+x*y+1))
@test A[1] == B[1]
@test A[2] == B[2]
end

@testset "smodule.saturation" begin
R, (x, y) = polynomial_ring(QQ, ["x", "y"])

I = Singular.Module(R, vector(R,(x^2 + x*y + 1)*(2y^2+1)^3), vector(R,(2y^2 + 3)*(2y^2+1)^2))
J = Singular.Module(R, vector(R,2y^2 + 1))

A,k = saturation(I, J)

B = Singular.Module(R, vector(R,2*y^2+3), vector(R,x^2+x*y+1))
@test A[1] == B[1]
@test A[2] == B[2]
@test k == 2

A,k = saturation2(I, J)

@test A[1] == B[1]
@test A[2] == B[2]
@test k == 2
end
Loading