Heyting algebraIn mathematics, a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with least element 0 and greatest element 1) equipped with a binary operation a → b of implication such that (c ∧ a) ≤ b is equivalent to c ≤ (a → b). From a logical standpoint, A → B is by this definition the weakest proposition for which modus ponens, the inference rule A → B, A ⊢ B, is sound. Like Boolean algebras, Heyting algebras form a variety axiomatizable with finitely many equations.
Quasi-isomorphismIn homological algebra, a branch of mathematics, a quasi-isomorphism or quism is a morphism A → B of chain complexes (respectively, cochain complexes) such that the induced morphisms of homology groups (respectively, of cohomology groups) are isomorphisms for all n. In the theory of , quasi-isomorphisms are sometimes used as the class of weak equivalences when the objects of the category are chain or cochain complexes. This results in a homology-local theory, in the sense of Bousfield localization in homotopy theory.
Retraction (topology)In topology, a branch of mathematics, a retraction is a continuous mapping from a topological space into a subspace that preserves the position of all points in that subspace. The subspace is then called a retract of the original space. A deformation retraction is a mapping that captures the idea of continuously shrinking a space into a subspace. An absolute neighborhood retract (ANR) is a particularly well-behaved type of topological space. For example, every topological manifold is an ANR.
EpimorphismIn , an epimorphism (also called an epic morphism or, colloquially, an epi) is a morphism f : X → Y that is right-cancellative in the sense that, for all objects Z and all morphisms , Epimorphisms are categorical analogues of onto or surjective functions (and in the the concept corresponds exactly to the surjective functions), but they may not exactly coincide in all contexts; for example, the inclusion is a ring epimorphism. The of an epimorphism is a monomorphism (i.e. an epimorphism in a C is a monomorphism in the Cop).
Inclusion mapIn mathematics, if is a subset of then the inclusion map (also inclusion function, insertion, or canonical injection) is the function that sends each element of to treated as an element of A "hooked arrow" () is sometimes used in place of the function arrow above to denote an inclusion map; thus: (However, some authors use this hooked arrow for any embedding.) This and other analogous injective functions from substructures are sometimes called natural injections.
Ring of symmetric functionsIn algebra and in particular in algebraic combinatorics, the ring of symmetric functions is a specific limit of the rings of symmetric polynomials in n indeterminates, as n goes to infinity. This ring serves as universal structure in which relations between symmetric polynomials can be expressed in a way independent of the number n of indeterminates (but its elements are neither polynomials nor functions). Among other things, this ring plays an important role in the representation theory of the symmetric group.
CofibrationIn mathematics, in particular homotopy theory, a continuous mapping between topological spaces is a cofibration if it has the homotopy extension property with respect to all topological spaces . That is, is a cofibration if for each topological space , and for any continuous maps and with , for any homotopy from to , there is a continuous map and a homotopy from to such that for all and . (Here, denotes the unit interval .
Natural transformationIn , a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure (i.e., the composition of morphisms) of the involved. Hence, a natural transformation can be considered to be a "morphism of functors". Informally, the notion of a natural transformation states that a particular map between functors can be done consistently over an entire category. Indeed, this intuition can be formalized to define so-called .
Regular categoryIn , a regular category is a category with and coequalizers of a pair of morphisms called kernel pairs, satisfying certain exactness conditions. In that way, regular categories recapture many properties of abelian categories, like the existence of images, without requiring additivity. At the same time, regular categories provide a foundation for the study of a fragment of first-order logic, known as regular logic. A category C is called regular if it satisfies the following three properties: C is .
Complete homogeneous symmetric polynomialIn mathematics, specifically in algebraic combinatorics and commutative algebra, the complete homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial can be expressed as a polynomial expression in complete homogeneous symmetric polynomials. The complete homogeneous symmetric polynomial of degree k in n variables X1, ..., Xn, written hk for k = 0, 1, 2, ..., is the sum of all monomials of total degree k in the variables.