← Latest papers
🔢 mathematics

Equivariant Contact Darboux Quotients and Perversely Categorified Legendrian Correspondences

This paper establishes an equivariant Darboux theorem for $-1$-shifted contact derived Artin stacks to construct \ell-adic perverse sheaves with tame monodromy for deriving enumerative invariants, and subsequently linearizes non-linear Legendrian 2-categories into categorified counterparts via Fourier-Mukai functors.

Original authors: Efe żzbudak

Published 2026-06-10
📖 5 min read🧠 Deep dive

Original authors: Efe żzbudak

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to map a very strange, bumpy, and shifting landscape. In the world of advanced mathematics (specifically algebraic geometry), this landscape is called a "stack." It's a place where points can have hidden symmetries, like a spinning top that looks the same from every angle but is actually rotating.

For a long time, mathematicians knew how to describe the "flat" parts of this landscape using a rule called the Darboux Theorem. Think of this like a cartographer's rule that says, "If you zoom in close enough on any smooth part of the map, it looks like a flat sheet of paper." This was great for symplectic geometry (a type of math dealing with shapes and motion), but it wasn't enough for contact geometry, which deals with shapes that have a specific "twist" or "flow" (like a spinning vortex).

This paper, written by Efe İzbudak, does three main things to fix this problem and build a new kind of map for these twisted landscapes.

1. The New "Flat" Map (The Equivariant Darboux Theorem)

The Problem: The old maps worked for flat sheets, but they couldn't handle the "twist" of contact geometry, especially when the landscape had spinning symmetries (like a reductive group GG). If you tried to measure things on these spinning landscapes, the numbers would often cancel out to zero, making it impossible to count anything.

The Solution: The author proves a new version of the "flat sheet" rule. He shows that even these twisted, spinning landscapes can be zoomed in on and described as a specific, well-understood shape called a derived discriminant locus.

  • The Analogy: Imagine you have a complex, spinning kaleidoscope. The old rule said, "You can't describe the pattern." The new rule says, "Actually, if you look at the pattern through a specific lens, it's just a simple, repeating design (a quotient stack) that we already know how to handle."
  • Why it matters: This allows mathematicians to treat these complex, spinning shapes as if they were built from simple, manageable blocks.

2. The "Ghost" Counters (Perverse Sheaves and Monodromy)

The Problem: Once you have a map, you want to count the "features" on it (like hills or valleys) to create invariants (numbers that describe the shape). But because these shapes have a "spinning" nature (a GmG_m-action), if you just count the hills, the spinning makes the total count zero. It's like trying to count the steps on a treadmill; you're moving, but you're going nowhere.

The Solution: The author introduces a special kind of "ghost counter" called a perverse sheaf.

  • The Analogy: Imagine the landscape is a spinning carousel. If you stand still and count the horses, the spinning makes it look like nothing is there. But the author equips his counter with a "magic eye" (a monodromy automorphism). This eye doesn't just count the horses; it tracks how they spin. It distinguishes between a horse that is just spinning in place and one that is actually moving.
  • The Result: By using this "magic eye" (specifically an \ell-adic perverse sheaf with a tame geometric monodromy), the author can extract real, non-zero numbers from these spinning landscapes. He calls these Contact Donaldson-Thomas (DT) Invariants. It's like finally being able to count the riders on the carousel by ignoring the spin and focusing on the unique pattern of their movement.

3. The "Translation" Machine (Categorified Legendrian Correspondences)

The Problem: Mathematicians have been building a "dictionary" to translate between different shapes (Legendrians). However, this dictionary was written in a very complicated, non-linear language that was hard to use for calculations. They needed a way to "linearize" it—turn the complex language into simple, straight lines (like turning a tangled knot into a straight string).

The Solution: The author builds a new "translation machine" using the ghost counters mentioned above.

  • The Analogy: Imagine you have two different languages for describing shapes. The old way of translating was like trying to translate a poem by hand, word by word, which was messy and prone to errors. The author builds a machine (a categorified 2-category) that takes a shape in one language, runs it through the "ghost counter" machine, and spits out a clean, mathematical number in the other language.
  • The Result: This connects the study of these twisted contact shapes to a field called microlocal sheaf theory. It's like finding a secret tunnel that connects two distant islands, allowing mathematicians to travel between them easily.

Summary of the "Big Wins"

  • Local Models: We now have a standard, simple way to describe any small piece of these twisted, spinning shapes.
  • Counting: We can finally count the features of these shapes without the spinning motion making the answer zero. We do this by using a special "monodromy" tool that tracks the spin.
  • Connection: We have built a bridge between the geometry of these shapes and the theory of "microlocal sheaves," allowing us to use powerful tools from one field to solve problems in the other.

In short, this paper provides the blueprints for a new kind of map, the tools to count things on that map despite the spinning, and the bridge to connect this map to other parts of mathematics. It turns a chaotic, spinning mess into a structured, countable, and understandable system.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →