skip to main content


Title: Classification of Constructible Cosheaves
In this paper we prove an equivalence theorem originally observed by Robert MacPherson. On one side of the equivalence is the category of cosheaves that are constructible with respect to a locally cone-like stratification. Our constructibility condition is new and only requires that certain inclusions of open sets are sent to isomorphisms. On the other side of the equivalence is the category of functors from the entrance path category, which has points for objects and certain homotopy classes of paths for morphisms. When our constructible cosheaves are valued in Set we prove an additional equivalence with the category of stratified coverings.  more » « less
Award ID(s):
1717159
NSF-PAR ID:
10293398
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Theory and applications of categories
Volume:
35
Issue:
27
ISSN:
1201-561X
Page Range / eLocation ID:
1012-1047
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. In this paper we prove an equivalence theorem originally observed by Robert MacPherson. On one side of the equivalence is the category of cosheaves that are constructible with respect to a locally cone-like stratification. Our constructibility condition is new and only requires that certain inclusions of open sets are sent to isomorphisms. On the other side of the equivalence is the category of functors from the entrance path category, which has points for objects and certain homotopy classes of paths for morphisms. When our constructible cosheaves are valued in Set we prove an additional equivalence with the category of stratified coverings. 
    more » « less
  2. In database-as-a-service platforms, automated ver-ification of query equivalence helps eliminate redundant computation in the form of overlapping sub-queries. Researchers have proposed two pragmatic techniques to tackle this problem. The first approach consists of reducing the queries to algebraic expressions and proving their equivalence using an algebraic theory. The limitations of this technique are threefold. It cannot prove the equivalence of queries with significant differences in the attributes of their relational operators (e.g., predicates in the filter operator). It does not support certain widely-used SQL features (e.g., NULL values). Its verification procedure is computationally intensive. The second approach transforms this problem to a constraint satisfaction problem and leverages a general-purpose solver to determine query equivalence. This technique consists of deriving the symbolic representation of the queries and proving their equivalence by determining the query containment relationship between the symbolic expressions. While the latter approach addresses all the limitations of the former technique, it only proves the equivalence of queries under set semantics (i.e., output tables must not contain duplicate tuples). However, in practice, database applications use bag semantics (i.e., output tables may contain duplicate tuples) In this paper, we introduce a novel symbolic approach for proving query equivalence under bag semantics. We transform the problem of proving query equivalence under bag semantics to that of proving the existence of a bijective, identity map between tuples returned by the queries on all valid inputs. We classify SQL queries into four categories, and propose a set of novel category-specific verification algorithms. We implement this symbolic approach in SPES and demonstrate that it proves the equivalence of a larger set of query pairs (95/232) under bag semantics compared to the SOTA tools based on algebraic (30/232) and symbolic approaches (67/232) under set and bag semantics, respectively. Furthermore, SPES is 3X faster than the symbolic tool that proves equivalence under set semantics. 
    more » « less
  3. We generalize Jones’ planar algebras by internalising the notion to a pivotal braided tensor categoryC\mathcal {C}. To formulate the notion, the planar tangles are now equipped with additional ‘anchor lines’ which connect the inner circles to the outer circle. We call the resulting notion ananchored planar algebra. If we restrict to the case whenC\mathcal {C}is the category of vector spaces, then we recover the usual notion of a planar algebra.

    Building on our previous work on categorified traces, we prove that there is an equivalence of categories between anchored planar algebras inC\mathcal {C}and pivotal module tensor categories overC\mathcal {C}equipped with a chosen self-dual generator. Even in the case of usual planar algebras, the precise formulation of this theorem, as an equivalence of categories, has not appeared in the literature. Using our theorem, we describe many examples of anchored planar algebras.

     
    more » « less
  4. Let V V be a vertex operator superalgebra with the natural order 2 automorphism σ \sigma . Under suitable conditions on V V , the σ \sigma -fixed subspace V 0 ¯ V_{\bar 0} is a vertex operator algebra and the V 0 ¯ V_{\bar 0} -module category C V 0 ¯ \mathcal {C}_{V_{\bar 0}} is a modular tensor category. In this paper, we prove that C V 0 ¯ \mathcal {C}_{V_{\bar 0}} is a fermionic modular tensor category and the Müger centralizer C V 0 ¯ 0 \mathcal {C}_{V_{\bar 0}}^0 of the fermion in C V 0 ¯ \mathcal {C}_{V_{\bar 0}} is generated by the irreducible V 0 ¯ V_{\bar 0} -submodules of the V V -modules. In particular, C V 0 ¯ 0 \mathcal {C}_{V_{\bar 0}}^0 is a super-modular tensor category and C V 0 ¯ \mathcal {C}_{V_{\bar 0}} is a minimal modular extension of C V 0 ¯ 0 \mathcal {C}_{V_{\bar 0}}^0 . We provide a construction of a vertex operator superalgebra V l V^l for each positive integer l l such that C ( V l ) 0 ¯ \mathcal {C}_{{(V^l)_{\bar 0}}} is a minimal modular extension of C V 0 ¯ 0 \mathcal {C}_{V_{\bar 0}}^0 . We prove that these modular tensor categories C ( V l ) 0 ¯ \mathcal {C}_{{(V^l)_{\bar 0}}} are uniquely determined, up to equivalence, by the congruence class of l l modulo 16. 
    more » « less
  5. null (Ed.)
    We prove a rank-finiteness conjecture for modular categories: up to equivalence, there are only finitely many modular categories of any fixed rank. Our technical advance is a generalization of the Cauchy theorem in group theory to the context of spherical fusion categories. For a modular category C \mathcal {C} with N = ord ( T ) N= \textrm {ord}(T) , the order of the modular T T -matrix, the Cauchy theorem says that the set of primes dividing the global quantum dimension D 2 D^2 in the Dedekind domain Z [ e 2 π i N ] \mathbb {Z}[e^{\frac {2\pi i}{N}}] is identical to that of N N . 
    more » « less