We develop a method for generating the complete set of basic data under the torsorial actions of and on a -crossed braided tensor category , where is the set of invertible simple objects in the braided tensor category . When is a modular tensor category, the and torsorial action gives a complete generation of possible -crossed extensions, and hence provides a classification. This torsorial classification can be (partially) collapsed by relabeling equivalences that appear when computing the set of -crossed braided extensions of . The torsor method presented here reduces these redundancies by systematizing relabelings by -valued -cochains. We also use our methods to compute the composition rule of these torsor functors.

生成讲解博客的中文版本

生成AI智能校验的中文版本