Macaulay2 » Documentation
Packages » NonPrincipalTestIdeals :: isFRationalThreshold
next | previous | forward | backward | up | index | toc

isFRationalThreshold -- determines if a given number is the F-rational threshold, or, equivalently in the case of a quasi-Gorenstein ring, the F-pure threshold

Description

Given an ideal $I$ in a domain $R$, this determines whether a rational $t$ is the $F$-rational threshold, that is whether or not $\tau(\omega_R, I^t) \neq \omega_R$ while $\tau(\omega_R, I^{t-\epsilon}) = \omega_R$. In the case of a quasi-Gorenstein strongly $F$-regular ring (ie, if $\omega_R$ is an invertible ideal, for instance if its principal), this is equivalent to the $F$-pure threshold of $(R, I)$. Hence, you may also call isFPT(R, I) in that case.

i1 : R = ZZ/3[x,y,z];
i2 : I = ideal(x^2,y^3,z^5); --fpt should be 1/2 + 1/3 + 1/5 = 31/30

o2 : Ideal of R
i3 : isFPT(31/30, I)

o3 = true
i4 : isFRationalThreshold(31/30, I)

o4 = true
i5 : isFRationalThreshold(1, I)

o5 = false
i6 : isFPT(32/30, I)

o6 = false

The option AtOrigin says that the computation must only be checked at the origin.

i7 : R = ZZ/3[u,v]

o7 = R

o7 : PolynomialRing
i8 : I = ideal( (u-1)^2, v^3) --fpt should be 1/2+1/3 = 5/6, but it's not the threshold at the origin

             2           3
o8 = ideal (u  + u + 1, v )

o8 : Ideal of R
i9 : isFPT(5/6, I)

o9 = true
i10 : isFRationalThreshold(5/6, I, AtOrigin=>true)

o10 = false

The Verbose option turns on debugging output if true. The option FrobeniusRootStrategy is passed on to the TestIdealsPackage.

See also

Ways to use isFRationalThreshold:

  • isFRationalThreshold(QQ,Ideal)
  • isFRationalThreshold(ZZ,Ideal)

For the programmer

The object isFRationalThreshold is a method function with options.


The source of this document is in NonPrincipalTestIdeals.m2:1292:0.