Zero ringIn ring theory, a branch of mathematics, the zero ring or trivial ring is the unique ring (up to isomorphism) consisting of one element. (Less commonly, the term "zero ring" is used to refer to any rng of square zero, i.e., a rng in which xy = 0 for all x and y. This article refers to the one-element ring.) In the , the zero ring is the terminal object, whereas the ring of integers Z is the initial object. The zero ring, denoted {0} or simply 0, consists of the one-element set {0} with the operations + and · defined such that 0 + 0 = 0 and 0 · 0 = 0.
Rng (algebra)In mathematics, and more specifically in abstract algebra, a rng (or non-unital ring or pseudo-ring) is an algebraic structure satisfying the same properties as a ring, but without assuming the existence of a multiplicative identity. The term rng (IPA: rʊŋ) is meant to suggest that it is a ring without i, that is, without the requirement for an identity element. There is no consensus in the community as to whether the existence of a multiplicative identity must be one of the ring axioms (see ).
Tensor product of algebrasIn mathematics, the tensor product of two algebras over a commutative ring R is also an R-algebra. This gives the tensor product of algebras. When the ring is a field, the most common application of such products is to describe the product of algebra representations. Let R be a commutative ring and let A and B be R-algebras. Since A and B may both be regarded as R-modules, their tensor product is also an R-module. The tensor product can be given the structure of a ring by defining the product on elements of the form a ⊗ b by and then extending by linearity to all of A ⊗R B.
Symmetric monoidal categoryIn , a branch of mathematics, a symmetric monoidal category is a (i.e. a category in which a "tensor product" is defined) such that the tensor product is symmetric (i.e. is, in a certain strict sense, naturally isomorphic to for all objects and of the category). One of the prototypical examples of a symmetric monoidal category is the over some fixed field k, using the ordinary tensor product of vector spaces.
Monoid (category theory)In , a branch of mathematics, a monoid (or monoid object, or internal monoid, or algebra) (M, μ, η) in a (C, ⊗, I) is an M together with two morphisms μ: M ⊗ M → M called multiplication, η: I → M called unit, such that the pentagon and the unitor diagram commute. In the above notation, 1 is the identity morphism of M, I is the unit element and α, λ and ρ are respectively the associativity, the left identity and the right identity of the monoidal category C. Dually, a comonoid in a monoidal category C is a monoid in the Cop.
Isomorphism of categoriesIn , two categories C and D are isomorphic if there exist functors F : C → D and G : D → C which are mutually inverse to each other, i.e. FG = 1D (the identity functor on D) and GF = 1C. This means that both the s and the morphisms of C and D stand in a one-to-one correspondence to each other. Two isomorphic categories share all properties that are defined solely in terms of category theory; for all practical purposes, they are identical and differ only in the notation of their objects and morphisms.
Free product of associative algebrasIn algebra, the free product (coproduct) of a family of associative algebras over a commutative ring R is the associative algebra over R that is, roughly, defined by the generators and the relations of the 's. The free product of two algebras A, B is denoted by A ∗ B. The notion is a ring-theoretic analog of a free product of groups. In the , the free product of two algebras (in that ) is their tensor product. We first define a free product of two algebras. Let A and B be algebras over a commutative ring R.
Pullback (category theory)In , a branch of mathematics, a pullback (also called a fiber product, fibre product, fibered product or Cartesian square) is the of a consisting of two morphisms f : X → Z and g : Y → Z with a common codomain. The pullback is written P = X ×f, Z, g Y. Usually the morphisms f and g are omitted from the notation, and then the pullback is written P = X ×Z Y. The pullback comes equipped with two natural morphisms P → X and P → Y. The pullback of two morphisms f and g need not exist, but if it does, it is essentially uniquely defined by the two morphisms.
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 .
Preadditive categoryIn mathematics, specifically in , a preadditive category is another name for an Ab-category, i.e., a that is over the , Ab. That is, an Ab-category C is a such that every hom-set Hom(A,B) in C has the structure of an abelian group, and composition of morphisms is bilinear, in the sense that composition of morphisms distributes over the group operation. In formulas: and where + is the group operation. Some authors have used the term additive category for preadditive categories, but here we follow the current trend of reserving this term for certain special preadditive categories (see below).
