next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
TestIdeals :: compatibleIdeals

compatibleIdeals -- finds all ideals compatibly Frobenius split ideals

Synopsis

Description

Given an element u of the polynomial ring R over a prime field, this function returns a list of all prime ideals P such that:

(a) u P ⊆P[p], and

(b) u is not in P[p].

Condition (b) is equivalent to the non-vanishing of the corresponding Frobenius map on annihilator of P on the injective hull of the residue field of R. This is an implementation of the algorithm described in Moty Katzman and Karl Schwede’s paper "An algorithm for computing compatibly Frobenius split subvarieties" J. Symbolic Comput. 47 (2012), no. 8, 996-1008.

We begin with a simple example (what is split with the coordinate axes in A2).

i1 : R = ZZ/3[u,v];
i2 : u = u^2*v^2;
i3 : compatibleIdeals(u)

o3 = {ideal v, ideal (v, u), ideal u}

o3 : List

Here is a more substantial example.

i4 : R=ZZ/2[x_{21},x_{31},x_{32},x_{41},x_{42},x_{43}];
i5 : u=x_{41}*(x_{31}*x_{42}-x_{41}*x_{32})*(x_{41}-x_{21}*x_{42}-x_{31}*x_{43}+x_{21}*x_{32}*x_{43});
i6 : C=compatibleIdeals (u);
i7 : apply(C, print);
ideal(x    x    x     + x    x     + x    x     + x    )
       {21} {32} {43}    {21} {42}    {31} {43}    {41}
ideal (x    , x    , x    )
        {41}   {31}   {21}
ideal (x    , x    , x    , x    x     + x    )
        {41}   {31}   {21}   {32} {43}    {42}
ideal (x    , x    , x    )
        {43}   {42}   {41}
ideal (x    , x    , x    , x    x     + x    )
        {43}   {42}   {41}   {21} {32}    {31}
ideal (x    , x    , x    , x    , x    )
        {43}   {42}   {41}   {31}   {32}
ideal (x    , x    , x    , x    , x    , x    )
        {43}   {42}   {41}   {32}   {31}   {21}
ideal (x    , x    , x    , x    , x    )
        {43}   {42}   {41}   {31}   {21}
ideal (x    , x    , x    , x    )
        {43}   {42}   {41}   {31}
ideal (x    , x    , x    , x    , x    )
        {42}   {41}   {32}   {31}   {21}
ideal (x    , x    , x    , x    )
        {41}   {31}   {21}   {42}
ideal (x    x     + x    x    , x    x     + x    , x    x     + x    )
        {32} {41}    {31} {42}   {31} {43}    {41}   {32} {43}    {42}
ideal (x    , x    )
        {42}   {41}
ideal (x    , x    , x    )
        {42}   {41}   {31}
ideal (x    , x    , x    , x    )
        {42}   {41}   {31}   {32}
ideal (x    , x    , x    x     + x    )
        {42}   {41}   {21} {32}    {31}
ideal (x    x     + x    x    , x    x     + x    , x    x     + x    , x    x     + x    , x    x     + x    )
        {32} {41}    {31} {42}   {31} {43}    {41}   {32} {43}    {42}   {21} {42}    {41}   {21} {32}    {31}
ideal x
       {41}
ideal (x    , x    x    x     + x    x     + x    x    )
        {41}   {21} {32} {43}    {21} {42}    {31} {43}
ideal (x    , x    , x    x     + x    )
        {41}   {31}   {32} {43}    {42}
ideal (x    , x    )
        {41}   {31}
ideal (x    x     + x    , x    x     + x    x    , x    x     + x    )
        {21} {32}    {31}   {32} {41}    {31} {42}   {21} {42}    {41}
ideal(x    x     + x    x    )
       {32} {41}    {31} {42}

Ways to use compatibleIdeals :