A note on Chern character, loop spaces and derived algebraic geometry

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages; submitted to Proc. of the 2007 Abel Symposium

Scientific paper

In this note we present a work in progress whose main purpose is to establish a categorified version of sheaf theory. We present a notion of derived categorical sheaves, which is a categorified version of the notion of complexes of sheaves of modules on schemes, as well as its quasi-coherent and perfect versions. We also explain how ideas from derived algebraic geometry and higher category theory can be used in order to construct a Chern character for these categorical sheaves, which is a categorified version of the Chern character for perfect complexes with values in cyclic homology. Our construction uses in an essential way the derived loop space of a scheme X, which is a derived scheme whose theory of functions is closely related to cyclic homology of X. This work can be seen as an attempt to define algebraic analogs of elliptic objects and characteristic classes for them. The present text is an overview of a work in progress and details will appear elsewhere.

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

A note on Chern character, loop spaces and derived algebraic geometry 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 A note on Chern character, loop spaces and derived algebraic geometry, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on Chern character, loop spaces and derived algebraic geometry will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-540590

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