Cartesian monoidal categoryIn mathematics, specifically in the field known as , a where the monoidal ("tensor") product is the is called a cartesian monoidal category. Any with finite products (a "finite product category") can be thought of as a cartesian monoidal category. In any cartesian monoidal category, the terminal object is the monoidal unit. , a monoidal finite coproduct category with the monoidal structure given by the coproduct and unit the initial object is called a cocartesian monoidal category, and any finite coproduct category can be thought of as a cocartesian monoidal category.
Accessible categoryThe theory of accessible categories is a part of mathematics, specifically of . It attempts to describe categories in terms of the "size" (a cardinal number) of the operations needed to generate their objects. The theory originates in the work of Grothendieck completed by 1969, and Gabriel and Ulmer (1971). It has been further developed in 1989 by Michael Makkai and Robert Paré, with motivation coming from model theory, a branch of mathematical logic. A standard text book by Adámek and Rosický appeared in 1994.
Dagger symmetric monoidal categoryIn the mathematical field of , a dagger symmetric monoidal category is a that also possesses a . That is, this category comes equipped not only with a tensor product in the sense but also with a , which is used to describe unitary morphisms and self-adjoint morphisms in : abstract analogues of those found in FdHilb, the . This type of was introduced by Peter Selinger as an intermediate structure between and the that are used in categorical quantum mechanics, an area that now also considers dagger symmetric monoidal categories when dealing with infinite-dimensional quantum mechanical concepts.
Statistical classificationIn statistics, classification is the problem of identifying which of a set of categories (sub-populations) an observation (or observations) belongs to. Examples are assigning a given email to the "spam" or "non-spam" class, and assigning a diagnosis to a given patient based on observed characteristics of the patient (sex, blood pressure, presence or absence of certain symptoms, etc.). Often, the individual observations are analyzed into a set of quantifiable properties, known variously as explanatory variables or features.
Derived algebraic geometryDerived algebraic geometry is a branch of mathematics that generalizes algebraic geometry to a situation where commutative rings, which provide local charts, are replaced by either differential graded algebras (over ), simplicial commutative rings or -ring spectra from algebraic topology, whose higher homotopy groups account for the non-discreteness (e.g., Tor) of the structure sheaf. Grothendieck's scheme theory allows the structure sheaf to carry nilpotent elements.
RationalityRationality is the quality of being guided by or based on reasons. In this regard, a person acts rationally if they have a good reason for what they do or a belief is rational if it is based on strong evidence. This quality can apply to an ability, as in rational animal, to a psychological process, like reasoning, to mental states, such as beliefs and intentions, or to persons who possess these other forms of rationality.
Rational numberIn mathematics, a rational number is a number that can be expressed as the quotient or fraction \tfrac p q of two integers, a numerator p and a non-zero denominator q. For example, \tfrac{-3}{7} is a rational number, as is every integer (e.g., 5 = 5/1). The set of all rational numbers, also referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by boldface Q, or blackboard bold \Q. A rational number is a real number.
Commutative ringIn mathematics, a commutative ring is a ring in which the multiplication operation is commutative. The study of commutative rings is called commutative algebra. Complementarily, noncommutative algebra is the study of ring properties that are not specific to commutative rings. This distinction results from the high number of fundamental properties of commutative rings that do not extend to noncommutative rings. A ring is a set equipped with two binary operations, i.e. operations combining any two elements of the ring to a third.
Model theoryIn mathematical logic, model theory is the study of the relationship between formal theories (a collection of sentences in a formal language expressing statements about a mathematical structure), and their models (those structures in which the statements of the theory hold). The aspects investigated include the number and size of models of a theory, the relationship of different models to each other, and their interaction with the formal language itself.
Multiclass classificationIn machine learning and statistical classification, multiclass classification or multinomial classification is the problem of classifying instances into one of three or more classes (classifying instances into one of two classes is called binary classification). While many classification algorithms (notably multinomial logistic regression) naturally permit the use of more than two classes, some are by nature binary algorithms; these can, however, be turned into multinomial classifiers by a variety of strategies.
Bousfield localizationIn , a branch of mathematics, a (left) Bousfield localization of a replaces the model structure with another model structure with the same cofibrations but with more weak equivalences. Bousfield localization is named after Aldridge Bousfield, who first introduced this technique in the context of localization of topological spaces and spectra. Given a class C of morphisms in a M the left Bousfield localization is a new model structure on the same category as before.
Flat moduleIn algebra, flat modules include free modules, projective modules, and, over a principal ideal domain, torsion free modules. Formally, a module M over a ring R is flat if taking the tensor product over R with M preserves exact sequences. A module is faithfully flat if taking the tensor product with a sequence produces an exact sequence if and only if the original sequence is exact. Flatness was introduced by in his paper Géometrie Algébrique et Géométrie Analytique.
