Comparing powers and symbolic powers of ideals 论文

2009Journal of Algebraic Geometry引用 217
Commutative Algebra and Its ApplicationsAlgebraic structures and combinatorial modelsPolynomial and algebraic computation

摘要

We develop tools to study the problem of containment of symbolic powers <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I Superscript left-parenthesis m right-parenthesis"> <mml:semantics> <mml:msup> <mml:mi>I</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo stretchy="false">(</mml:mo> <mml:mi>m</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:msup> <mml:annotation encoding="application/x-tex">I^{(m)}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in powers <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I Superscript r"> <mml:semantics> <mml:msup> <mml:mi>I</mml:mi> <mml:mi>r</mml:mi> </mml:msup> <mml:annotation encoding="application/x-tex">I^r</mml:annotation> </mml:semantics> </mml:math> </inline-formula> for a homogeneous ideal <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I"> <mml:semantics> <mml:mi>I</mml:mi> <mml:annotation encoding="application/x-tex">I</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in a polynomial ring <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="k left-bracket bold upper P Superscript upper N Baseline right-bracket"> <mml:semantics> <mml:mrow> <mml:mi>k</mml:mi> <mml:mo stretchy="false">[</mml:mo> <mml:msup> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mtext mathvariant="bold">P</mml:mtext> </mml:mrow> <mml:mi>N</mml:mi> </mml:msup> <mml:mo stretchy="false">]</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">k[\textbf {P}^N]</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper N plus 1"> <mml:semantics> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">N+1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> variables over an arbitrary algebraically closed field <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="k"> <mml:semantics> <mml:mi>k</mml:mi> <mml:annotation encoding="application/x-tex">k</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We obtain results on the structure of the set of pairs <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="left-parenthesis r comma m right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>r</mml:mi> <mml:mo>,</mml:mo> <mml:mi>m</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">(r,m)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> such that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I Superscript left-parenthesis m right-parenthesis Baseline subset-of-or-equal-to upper I Superscript r"> <mml:semantics> <mml:mrow> <mml:msup> <mml:mi>I</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo stretchy="false">(</mml:mo> <mml:mi>m</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:msup> <mml:mo> ⊆ </mml:mo> <mml:msup> <mml:mi>I</mml:mi> <mml:mi>r</mml:mi> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">I^{(m)}\subseteq I^r</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . As corollaries, we show that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I squared"> <mml:semantics> <mml:msup> <mml:mi>I</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:annotation encoding="application/x-tex">I^2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> contains <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I Superscript left-parenthesis 3 right-parenthesis"> <mml:semantics> <mml:msup> <mml:mi>I</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo stretchy="false">(</mml:mo> <mml:mn>3</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:msup> <mml:annotation encoding="application/x-tex">I^{(3)}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> whenever <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper S"> <mml:semantics> <mml:mi>S</mml:mi> <mml:annotation encoding="application/x-tex">S</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a finite generic set of points in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="bold upper P Superscript 2"> <mml:semantics> <mml:msup> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mtext mathvariant="bold">P</mml:mtext> </mml:mrow> <mml:mn>2</mml:mn> </mml:msup> <mml:annotation encoding="application/x-tex">\textbf {P}^2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> (thereby giving a partial answer to a question of Huneke), and we show that the containment theorems of Ein–Lazarsfeld–Smith [Invent. Math. 144 (2001), pp. 241–252] and Hochster–Huneke [Invent. Math. 147 (2002), pp. 349–369] are optimal for every fixed dimension and codimension.