We present an abstract version of Goerss-Hopkins theory in the setting of a prestable @math -category equipped with a suitable periodicity operator. In the case of the @math -category of synthetic spectra, this yields obstructions to realizing a comodule algebra as a homology of a commutative ring spectrum, recovering the results of Goerss and Hopkins.
A different approach to Goerss-Hopkins obstruction theory is present in the work of Mazel-Gee @cite_27 . Compared to ours, the approach of Mazel-Gee is closer in spirit to the original works of Goerss and Hopkins, generalizing the theory to a setting of an arbitrary presentable @math -category through the use of model @math -categories.
@cite_27
2904500875
Author(s): Mazel-Gee, Aaron | Advisor(s): Teichner, Peter | Abstract: We develop a theory of model ∞-categories -- that is, of model structures on ∞-categories -- which provides a robust theory of resolutions entirely native to the ∞-categorical context. Using model ∞-categories, we generalize Goerss--Hopkins obstruction theory from spectra to an arbitrary (presentably symmetric monoidal stable) ∞-category. We give a sample application of this generalized obstruction theory in the setting of motivic homotopy theory, where we construct E_∞ structures on the motivic Morava E-theories and compute their automorphism spaces (as E_∞ algebras). Goerss--Hopkins obstruction theory is a powerful tool for constructing structured ring spectra from purely algebraic data. Using the formalism of model @math -categories, we provide a generalization that applies in an arbitrary presentably symmetric monoidal stable @math -category (such as that of equivariant spectra or of motivic spectra). Prologue Point-set topology, change functors, and proper actions: Introduction to Part I The point-set topology of parametrized spaces Change functors and compatibility relations Proper actions, equivariant bundles and fibrations Model categories and parametrized spaces: Introduction to Part II Topologically bicomplete model categories Well-grounded topological model categories The @math -model structure on @math Equivariant @math -type model structures Ex-fibrations and ex-quasifibrations The equivalence between Ho @math and @math Parametrized equivariant stable homotopy theory: Introduction to Part III Enriched categories and @math -categories The category of orthogonal @math -spectra over @math Model structures for parametrized @math -spectra Adjunctions and compatibility relations Module categories, change of universe, and change of groups Parametrized duality theory: Introduction to Part IV Fiberwise duality and transfer maps Closed symmetric bicategories The closed symmetric bicategory of parametrized spectra Costenoble-Waner duality Fiberwise Costenoble-Waner duality Homology and cohomology, Thom spectra, and addenda: Introduction to Part V Parametrized homology and cohomology theories Equivariant parametrized homology and cohomology Twisted theories and spectral sequences Parametrized FSP's and generalized Thom spectra Epilogue: Cellular philosophy and alternative approaches Bibliography Index Index of notation. Whereas formal category theory is classically considered within a @math -category, in this paper a double-dimensional approach is taken. More precisely we develop such theory within the setting of hypervirtual double categories, a notion extending that of virtual double category by adding cells with nullary target. [...] After this the notion of weak' Kan extension within a hypervirtual double category is considered, together with three strengthenings. [...] The notion of yoneda embedding is then considered in a hypervirtual double category, and compared to that of a good yoneda structure on a @math -category; the latter in the sense of Street-Walters and Weber. Conditions are given ensuring that a yoneda embedding @math defines @math as the free small cocompletion of @math , in a suitable sense. In the second half we consider formal category theory in the presence of algebraic structures. In detail: to a monad @math on a hypervirtual double category @math several hypervirtual double categories @math of @math -algebras are associated, [...]. This is followed by the study of the creation of, amongst others, left Kan extensions by the forgetful functors @math . The main motivation of this paper is the description of conditions ensuring that yoneda embeddings in @math lift along these forgetful functors, as well as ensuring that such lifted algebraic yoneda embeddings again define free small cocompletions, now in @math . As a first example we apply the previous to monoidal structures on categories, hence recovering Day convolution of presheaves and Im-Kelly's result on free monoidal cocompletion, as well as obtaining a "monoidal Yoneda lemma". The interleaving distance was originally defined in the field of Topological Data Analysis (TDA) by as a metric on the class of persistence modules parametrized over the real line. subsequently extended the definition to categories of functors on a poset, the objects in these categories being regarded as generalized persistence modules'. These metrics typically depend on the choice of a lax semigroup of endomorphisms of the poset. The purpose of the present paper is to develop a more general framework for the notion of interleaving distance using the theory of actegories'. Specifically, we extend the notion of interleaving distance to arbitrary categories equipped with a flow, i.e. a lax monoidal action by the monoid @math . In this way, the class of objects in such a category acquires the structure of a Lawvere metric space. Functors that are colax @math -equivariant yield maps that are @math -Lipschitz. This leads to concise proofs of various known stability results from TDA, by considering appropriate colax @math -equivariant functors. Along the way, we show that several common metrics, including the Hausdorff distance and the @math -norm, can be realized as interleaving distances in this general perspective. We give a lower bound of @math for the degree-4 Sum-of-Squares SDP relaxation for the planted clique problem. Specifically, we show that on an Erd "os-R 'enyi graph @math , with high probability there is a feasible point for the degree-4 SOS relaxation of the clique problem with an objective value of @math , so that the program cannot distinguish between a random graph and a random graph with a planted clique of size @math . This bound is tight. We build on the works of Deshpande and Montanari and , who give lower bounds of @math and @math respectively. We improve on their results by making a perturbation to the SDP solution proposed in their work, then showing that this perturbation remains PSD as the objective value approaches @math . In an independent work, Hopkins, Kothari and Potechin [HKP15] have obtained a similar lower bound for the degree- @math SOS relaxation. Given the nilpotent cone of a complex reductive Lie algebra, we consider its equivariant constructible derived category of sheaves with coefficients in an arbitrary field. This category and its subcategory of perverse sheaves play an important role in Springer theory and the theory of character sheaves. We show that the composition of the Fourier--Sato transform on the Lie algebra followed by restriction to the nilpotent cone restricts to an autoequivalence of the derived category of the nilpotent cone. In the case of @math , we show that this autoequivalence can be regarded as a geometric version of Ringel duality for the Schur algebra. We show that if @math is a @math -local Landweber exact homology theory of height @math and @math , then there exists an equivalence @math between homotopy categories of @math -local spectra and differential @math -comodules, generalizing Bousfield's and Franke's results to heights @math . Homological Projective duality (HP-duality) theory, introduced by Kuznetsov [42], is one of the most powerful frameworks in the homological study of algebraic geometry. The main result (HP-duality theorem) of the theory gives complete descriptions of bounded derived categories of coherent sheaves of (dual) linear sections of HP-dual varieties. We show the theorem also holds for more general intersections beyond linear sections. More explicitly, for a given HP-dual pair @math , then analogue of HP-duality theorem holds for their intersections with another HP-dual pair @math , provided that they intersect properly. We also prove a relative version of our main result. Taking @math to be dual linear subspaces (resp. subbundles), our method provides a more direct proof of the original (relative) HP-duality theorem. Abstract We consider the efficiency bound for the estimation of the parameters of semiparametric models defined solely by restrictions on the means of a vector of correlated outcomes, Y, when the data on Y are missing at random. We show that the semiparametric variance bound is the asymptotic variance of the optimal estimator in a class of inverse probability of censoring weighted estimators and that this bound is unchanged if the data are missing completely at random. For this case we study the asymptotic performance of the generalized estimating equations (GEE) estimators of mean parameters and show that the optimal GEE estimator is inefficient except for special cases. The optimal weighted estimator depends on unknown population quantities. But for monotone missing data, we propose an adaptive estimator whose asymptotic variance can achieve the bound. A complete set of filters @math for the optimal-depth @math -input sorting network problem is such that if there exists an @math -input sorting network of depth @math then there exists one of the form @math for some @math . Previous work on the topic presents a method for finding complete set of filters @math and @math that consists only of networks of depths one and two respectively, whose outputs are minimal and representative up to permutation and reflection. We present a novel practical approach for finding a complete set of filters @math containing only networks of depth three whose outputs are minimal and representative up to permutation and reflection. In previous work, we have developed a highly efficient algorithm for finding extremal sets ( i.e. outputs of comparator networks; itemsets; ) up to permutation. In this paper we present a modification to this algorithm that identifies the representative itemsets up to permutation and reflection. Hence, the here presented practical approach is the successful combination of known theory and practice that we apply to the domain of sorting networks. For all @math , we empirically compute the complete set of filters @math of the representative minimal up to permutation and reflection @math -input networks of depth three. The higher-order clustering problem arises when data is drawn from multiple subspaces or when observations fit a higher-order parametric model. Most solutions to this problem either decompose higher-order similarity measures for use in spectral clustering or explicitly use low-rank matrix representations. In this paper we present our approach of Sparse Grassmann Clustering (SGC) that combines attributes of both categories. While we decompose the higher order similarity tensor, we cluster data by directly finding a low dimensional representation without explicitly building a similarity matrix. By exploiting recent advances in online estimation on the Grassmann manifold (GROUSE) we develop an efficient and accurate algorithm that works with individual columns of similarities or partial observations thereof. Since it avoids the storage and decomposition of large similarity matrices, our method is efficient, scalable and has low memory requirements even for large-scale data. We demonstrate the performance of our SGC method on a variety of segmentation problems including planar segmentation of Kinect depth maps and motion segmentation of the Hopkins 155 dataset for which we achieve performance comparable to the state-of-the-art. Agent-based models are a useful technique for rapidly prototyping complex social systems, they are widely used in a number of disciplines and can yield theoretical insights that are different from those produced by a variable based analysis. However, it remains difficult to compare the results of two models and to validate the performance of an agent-based simulation. In this paper, we present a case study on how to analyze the relationship between agent-based models using category theory. Category theory is a powerful mathematical methodology that was originally introduced to organize mathematical ideas according to their shared structure. It has been successfully employed in abstract mathematical domains, but has also enjoyed some success as a formalism for software engineering. Here we present a procedure for analyzing agent-based models using category theory and a case study in its usage at analyzing two different types of simulations. There has been continued interest in seeking a theorem describing optimal low-rank approximations to tensors of order 3 or higher that parallels the Eckart-Young theorem for matrices. In this paper, we argue that the naive approach to this problem is doomed to failure because, unlike matrices, tensors of order 3 or higher can fail to have best rank- @math approximations. The phenomenon is much more widespread than one might suspect: examples of this failure can be constructed over a wide range of dimensions, orders, and ranks, regardless of the choice of norm (or even Bregman divergence). Moreover, we show that in many instances these counterexamples have positive volume: they cannot be regarded as isolated phenomena. In one extreme case, we exhibit a tensor space in which no rank-3 tensor has an optimal rank-2 approximation. The notable exceptions to this misbehavior are rank-1 tensors and order-2 tensors (i.e., matrices). In a more positive spirit, we propose a natural way of overcoming the ill-posedness of the low-rank approximation problem, by using weak solutions when true solutions do not exist. For this to work, it is necessary to characterize the set of weak solutions, and we do this in the case of rank 2, order 3 (in arbitrary dimensions). In our work we emphasize the importance of closely studying concrete low-dimensional examples as a first step toward more general results. To this end, we present a detailed analysis of equivalence classes of @math tensors, and we develop methods for extending results upward to higher orders and dimensions. Finally, we link our work to existing studies of tensors from an algebraic geometric point of view. The rank of a tensor can in theory be given a semialgebraic description; in other words, it can be determined by a system of polynomial inequalities. We study some of these polynomials in cases of interest to us; in particular, we make extensive use of the hyperdeterminant @math on @math . We present an improved semidefinite programming based approximation algorithm for the MAX CUT problem in graphs of maximum degree at most 3. The approximation ratio of the new algorithm is at least 0.9326. This improves, and also somewhat simplifies, a result of Feige, Karpinski and Langberg. We also observe that results of Hopkins and Staton and of Bondy and Locke yield a simple combinatorial 4 5-approximation algorithm for the problem. Finally, we present a combinatorial 22 27-approximation algorithm for the MAX CUT problem for regular cubic graphs. We prove a homological mirror symmetry equivalence between an @math -brane category for the pair of pants, computed as a wrapped microlocal sheaf category, and a @math -brane category for a mirror LG model, understood as a category of matrix factorizations. The equivalence improves upon prior results in two ways: it intertwines evident affine Weyl group symmetries on both sides, and it exhibits the relation of wrapped microlocal sheaves along different types of Lagrangian skeleta for the same hypersurface. The equivalence proceeds through the construction of a combinatorial realization of the @math -model via arboreal singularities. The constructions here represent the start of a program to generalize to higher dimensions many of the structures which have appeared in topological approaches to Fukaya categories of surfaces. An algebraic left Kan extension is a left Kan extension which interacts well with the algebraic structure present in the given situation, and these appear in various subjects such as the homotopy theory of operads and in the study of conformal field theories. In the most interesting examples, the functor along which we left Kan extend goes between categories that enjoy universal properties which express the meaning of the calculation we are trying to understand. These universal properties say that the categories in question are universal examples of some categorical structure possessing some kind of internal structure, and so fall within the theory of internal algebra classifiers described in earlier work of the author. In this article conditions of a monad-theoretic nature are identified which give rise to morphisms between such universal objects, which satisfy the key condition of Guitart-exactness, which guarantees the algebraicness of left Kan extending along them. The resulting setting explains the algebraicness of the left Kan extensions arising in operad theory, for instance from the theory of Feynman categories of Kaufmann and Ward, generalisations thereof, and also includes the situations considered by Batanin and Berger in their work on the homotopy theory of algebras of polynomial monads. This work is a follow-up to our previous work "A numerical approach related to defect-type theories for some weakly random problems in homogenization" (preprint available on this archive). It extends and complements, both theoretically and experimentally, the results presented there. Under consideration is the homogenization of a model of a weakly random heterogeneous material. The material consists of a reference periodic material randomly perturbed by another periodic material, so that its homogenized behavior is close to that of the reference material. We consider laws for the random perturbations more general than in our previous work cited above. We prove the validity of an asymptotic expansion in a certain class of settings. We also extend the formal approach introduced in our former work. Our perturbative approach shares common features with a defect-type theory of solid state physics. The computational efficiency of the approach is demonstrated. In the generalized Russian cards problem, the three players Alice, Bob and Cath draw @math a , b and @math c cards, respectively, from a deck of @math a + b + c cards. Players only know their own cards and what the deck of cards is. Alice and Bob are then required to communicate their hand of cards to each other by way of public messages. For a natural number @math k , the communication is said to be @math k -safe if Cath does not learn whether or not Alice holds any given set of at most @math k cards that are not Cath's, a notion originally introduced as weak @math k -security by Swanson and Stinson. An elegant solution by Atkinson views the cards as points in a finite projective plane. We propose a general solution in the spirit of Atkinson's, although based on finite vector spaces rather than projective planes, and call it the geometric protocol'. Given arbitrary @math c , k > 0 , this protocol gives an informative and @math k -safe solution to the generalized Russian cards problem for infinitely many values of @math ( a , b , c ) with @math b = O ( a c ) . This improves on the collection of parameters for which solutions are known. In particular, it is the first solution which guarantees @math k -safety when Cath has more than one card. We define new invariants of 3d Calabi-Yau categories endowed with a stability structure. Intuitively, they count the number of semistable objects with fixed class in the K-theory of the category ("number of BPS states with given charge" in physics language). Formally, our motivic DT-invariants are elements of quantum tori over a version of the Grothendieck ring of varieties over the ground field. Via the quasi-classical limit "as the motive of affine line approaches to 1" we obtain numerical DT-invariants which are closely related to those introduced by Behrend. We study some properties of both motivic and numerical DT-invariants including the wall-crossing formulas and integrality. We discuss the relationship with the mathematical works (in the non-triangulated case) of Joyce, Bridgeland and Toledano-Laredo, as well as with works of physicists on Seiberg-Witten model (string junctions), classification of N=2 supersymmetric theories (Cecotti-Vafa) and structure of the moduli space of vector multiplets. Relating the theory of 3d Calabi-Yau categories with distinguished set of generators (called cluster collection) with the theory of quivers with potential we found the connection with cluster transformations and cluster varieties (both classical and quantum).