Fix in staircase dependence (#60)

* Fix in staircase dependence * Fix format
JuliaAlgebra · Jul 25, 2023 · f443719 · f443719 · blegat · Jul 25, 2023
1 parent 89b3dfe
commit f443719
Show file tree

Hide file tree

Showing 4 changed files with 38 additions and 12 deletions.
diff --git a/src/dependence.jl b/src/dependence.jl
@@ -161,7 +161,7 @@ function StaircaseDependence(
             border = shift * mono
             if isnothing(_monomial_index(standard, border)) &&
                isnothing(_monomial_index(corners, border))
-                i = _index(basis, mono)
+                i = _index(basis, border)
                 if isnothing(i) || !is_dependent(i)
                     push!(independent_border, border)
                 else

diff --git a/test/extract.jl b/test/extract.jl
@@ -24,12 +24,7 @@ end
 
 Mod.@polyvar x
 
-function testelements(X, Y, atol)
-    @test length(X) == length(Y)
-    for y in Y
-        @test any(x -> isapprox(x, y, atol = atol), X)
-    end
-end
+include("utils.jl")
 
 function _atoms(atoms, rank_check, solver)
     Mod.@polyvar x[1:2]

diff --git a/test/null.jl b/test/null.jl
@@ -7,7 +7,31 @@ import MultivariateMoments as MM
 
 b(x) = MB.MonomialBasis(x)
 
-function test_univariate_infinity(x)
+include("utils.jl")
+
+function test_dreesen1(x, y)
+    matrix = Float64[
+        1 0 0 0
+        0 1 0 0
+        0 0 1 0
+        0 0 0 1
+        0 0 1 0
+        1 0 0 0
+    ]
+    basis = MB.MonomialBasis([1, y, x, y^2, x * y, x^2])
+    null = MM.MacaulayNullspace(matrix, basis, 1e-8)
+    @testset "$D" for D in [MM.AnyDependence, MM.StaircaseDependence]
+        @testset "$name" for (solver, name) in [
+            (MM.ShiftNullspace{D}(), "shift"),
+            #(MM.Echelon{D}(fallback = false), "echelon no fallback"),
+            #(MM.Echelon{D}(fallback = true), "echelon fallback"),
+        ]
+            @test isnothing(MM.solve(null, solver))
+        end
+    end
+end
+
+function _test_univariate_infinity(x, y)
     Z = Float64[
         1 0
         2 0
@@ -51,12 +75,12 @@ using Test
 
 import DynamicPolynomials
 @testset "DynamicPolynomials" begin
-    DynamicPolynomials.@polyvar x
-    TestNull.runtests(x)
+    DynamicPolynomials.@polyvar x y
+    TestNull.runtests(x, y)
 end
 
 import TypedPolynomials
 @testset "TypedPolynomials" begin
-    TypedPolynomials.@polyvar x
-    TestNull.runtests(x)
+    TypedPolynomials.@polyvar x y
+    TestNull.runtests(x, y)
 end
diff --git a/test/utils.jl b/test/utils.jl
@@ -0,0 +1,7 @@
+function testelements(X, Y, atol)
+    @test length(X) == length(Y)
+    for y in Y
+        @show y
+        @test any(x -> isapprox(x, y, atol = atol), X)
+    end
+end