Phantom depth and stable phantom exactness

Mathematics – Commutative Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

35 pages

Scientific paper

Phantom depth, phantom nonzerodivisors, and phantom exact sequences are analogues of the non-"phantom" notions which have been useful in tackling the (very difficult) localization problem in tight closure theory. In the present paper, these notions are developed further and partially reworked. For instance, although no analogue of a long exact sequence arises from a short stably phantom exact sequence of complexes, we provide a method for recovering the kind of information obtainable from such a long sequence. Also, we give alternate characterizations of the notion of phantom depth, including one based on Koszul homology which we use to show that with very mild conditions on a finitely generated module $M$, any two maximal phantom $M$-regular sequences in an ideal $I$ have the same length. In order to do so, we prove a "Nakayama lemma for tight closure" which is of independent interest. We strengthen the connection of phantom depth with minheight, we explore several analogues of "associated prime" in tight closure theory, and we discuss a connection with the problem of when tight closure commutes with localization.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Phantom depth and stable phantom exactness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Phantom depth and stable phantom exactness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Phantom depth and stable phantom exactness will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-163071

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.