Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Non-semisimple WRT at the boundary of Crane-Yetter (2503.20905v1)

Published 26 Mar 2025 in math.QA, math.CT, and math.GT

Abstract: We prove the slogan, promoted by Walker and Freed-Teleman twenty years ago, that "The Witten-Reshetikhin-Turaev 3-TQFT is a boundary condition for the Crane-Yetter 4-TQFT" and generalize it to the non-semisimple case following ideas of Jordan, Reutter and Walker. To achieve this, we prove that the Crane-Yetter 4-TQFT and its non-semisimple version arXiv:2306.03225 are once-extended TQFTs, using the main result of arXiv:2412.14649. We define a boundary condition, partially defined in the non-semisimple case, for this 4D theory. When the ribbon category used is modular, possibly non-semisimple, we check that the composition of this boundary condition with the values of the 4-TQFT on bounding manifolds reconstructs the Witten-Reshetikhin-Turaev 3-TQFTs and their non-semisimple versions arXiv:1912.02063, in a sense that we make precise.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com