Related papers: Examples and counterexamples of injective types
The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…
If there exists a completely bounded projection of B(H) onto a von Neumann algebra M on H, then M is injective. If there exists a bounded projection and M is properly infinite, the same conclusion holds.
Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has renewed the interest in type theories, as they are not just the object of mere historical research, but have an…
We describe a fully faithful embedding of projective geometries, given in terms of closure operators, into $\mathbb{F}_1$-modules, in the sense of Connes and Consani. This factors through a faithful functor out of simple pointed matroids.…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
Irreversible aggregation is an archetypal example of a system driven far from equilibrium by sources and sinks of a conserved quantity (mass). The source is a steady input of monomers and the evaporation of colliding particles with a small…
Let M be a von Neumann algebra of type II_1 which is also a complemented subspace of B(H). We establish an algebraic criterion, which ensures that M is an injective von Neumann algebra. As a corollary we show that if M is a complemented…
The term UniMath refers both to a formal system for mathematics, as well as a computer-checked library of mathematics formalized in that system. The UniMath system is a core dependent type theory, augmented by the univalence axiom. The…
We give a precise definition of incidence theorems in plane projective geometry and introduce the notion of ``absolute incidence theorems,'' which hold over any ring. Fomin and Pylyavskyy describe how to obtain incidence theorems from…
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a…
We investigate predicative aspects of constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work complements…
Suppose that $(\mathcal{F},\mathcal{M})$ is an injective structure of $R$-Mod such that the class $\mathcal{F}$ is closed for direct limits, then two modules in $\mathcal{M}$ are isomorphic if there are maps in $\mathcal{F}$ from each one…
Let A be a simple, sigma-unital, non-unital C*-algebra, with metrizable tracial simplex T(A), which is projection-surjective and injective and has strict comparison of positive elements by traces. Then the following are equivalent: (i) A…
Examples are given to show that the support of a complex of modules over a commutative noetherian ring may not be read off the minimal semi-injective resolution of the complex. The same examples also show that a localization of a…
Let X be a countably infinite set, Inj(X) the monoid of all injective endomaps of X, and Sym(X) the group of all permutations of X. We classify all submonoids of Inj(X) that are closed under conjugation by elements of Sym(X).
Even a functor without an adjoint induces a monad, namely, its codensity monad; this is subject only to the existence of certain limits. We clarify the sense in which codensity monads act as substitutes for monads induced by adjunctions. We…
Type systems certify program properties in a compositional way. From a bigger program one can abstract out a part and certify the properties of the resulting abstract program by just using the type of the part that was abstracted away.…
We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…
Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is type $1$ if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…
This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…