Related papers: Idempotents in intensional type theory
We present an extensive mechanization of the meta-theory of Martin-L\"of Type Theory (MLTT) in the Coq proof assistant. Our development builds on pre-existing work in Agda to show not only the decidability of conversion, but also the…
In this paper, we use the idempotent decomposition to give an explicit isomorphism from an arbitrary semisimple Artinian ring to an external direct sum of finitely many full matrix rings over division rings.
The Jones-Wenzl idempotents of the Temperley-Lieb algebra are celebrated elements defined over characteristic zero and for generic loop parameter. Given pointed field $(R, \delta)$, we extend the existing results of Burrull, Libedinsky and…
We classify all apartness relations definable in propositional logics extending intuitionistic logic using Heyting algebra semantics. We show that every Heyting algebra which contains a non-trivial apartness term satisfies the weak law of…
We provide a systematic method for nonlinear entanglement detection based on trace polynomial inequalities. In particular, this allows to employ multi-partite witnesses for the detection of bipartite states, and vice versa. We identify…
We apply poset cocalculus, a functor calculus framework for functors out of a poset, to study the problem of decomposing multipersistence modules into simpler components. We both prove new results in this topic and offer a new perspective…
In this paper the space of almost commuting elements in a Lie group is studied through a homotopical point of view. In particular a stable splitting after one suspension is derived for these spaces and their quotients under conjugation. A…
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) extend Linear Temporal Logic (LTL) for real-time constraints, with MTL using time-bounded modalities and TPTL employing freeze quantifiers. Satisfiability for both is…
One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact in a proof. The purpose of this note is to describe a specific instance where this can occur, namely in results…
An Independent Parallelism Theorem is proven in the theory of adhesive HLR categories. It shows the bijective correspondence between sequential independent and parallel independent direct derivations in the Weak Double-Pushout framework,…
We study superpotentials from worldsheet instantons in heterotic Calabi-Yau compactifications for vector bundles constructed from line bundle sums, monads and extensions. Within a certain class of manifolds and for certain second homology…
We describe certain sufficient conditions for an infinitely divisible probability measure on a class of connected Lie groups to be embeddable in a continuous one-parameter convolution semigroup of probability measures. (Theorem 1.3). This…
In this paper we provide concrete constructions of idempotents to represent typical singular matrices over a given ring as a product of idempotents and apply these factorizations for proving our main results. We generalize works due to…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
We introduce the continuous version of the (unstable) smashing spectrum functor. In the stable case, it assigns to each dualizably symmetric monoidal stable presentable $\infty$-category a stably compact space whose open subsets correspond…
We consider a class of nonlinear non-diagonal elliptic systems with $p$-growth and establish the $L^q$-integrability for all $q\in [p,p+2]$ of any weak solution provided the corresponding right hand side belongs to the corresponding…
We give a model of set theory based on multisets in homotopy type theory. The equality of the model is the identity type. The underlying type of iterative sets can be formulated in Martin-L\"of type theory, without Higher Inductive Types…
This paper presents robust inference methods for general linear hypotheses in linear panel data models with latent group structure in the coefficients. We employ a selective conditional inference approach, deriving the conditional…
For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…
In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a fixed (strong) Maltsev condition $\Sigma$. Our goal in this paper is to show that $\Sigma$-testing can be accomplished…