Equaliser (mathematics)

Last updated

In mathematics, an equalizer is a set of arguments where two or more functions have equal values. An equalizer is the solution set of an equation. In certain contexts, a difference kernel is the equalizer of exactly two functions.

Contents

Definitions

Let X and Y be sets. Let f and g be functions, both from X to Y. Then the equaliser of f and g is the set of elements x of X such that f(x) equals g(x) in Y. Symbolically:

The equaliser may be denoted Eq(f, g) or a variation on that theme (such as with lowercase letters "eq"). In informal contexts, the notation {f = g} is common.

The definition above used two functions f and g, but there is no need to restrict to only two functions, or even to only finitely many functions. In general, if F is a set of functions from X to Y, then the equalizer of the members of F is the set of elements x of X such that, given any two members f and g of F, f(x) equals g(x) in Y. Symbolically:

This equaliser may be written as Eq(f, g, h, ...) if is the set {f, g, h, ...}. In the latter case, one may also find {f = g = h = ···} in informal contexts.

As a degenerate case of the general definition, let F be a singleton {f}. Since f(x) always equals itself, the equaliser must be the entire domain X. As an even more degenerate case, let F be the empty set. Then the equaliser is again the entire domain X, since the universal quantification in the definition is vacuously true.

Difference kernels

A binary equalizer (that is, an equalizer of just two functions) is also called a difference kernel. This may also be denoted DiffKer(f, g), Ker(f, g), or Ker(fg). The last notation shows where this terminology comes from, and why it is most common in the context of abstract algebra: The difference kernel of f and g is simply the kernel of the difference fg. Furthermore, the kernel of a single function f can be reconstructed as the difference kernel Eq(f, 0), where 0 is the constant function with value zero.

Of course, all of this presumes an algebraic context where the kernel of a function is its preimage under zero; that is not true in all situations. However, the terminology "difference kernel" has no other meaning.

In category theory

Equalizers can be defined by a universal property, which allows the notion to be generalized from the category of sets to arbitrary categories.

In the general context, X and Y are objects, while f and g are morphisms from X to Y. These objects and morphisms form a diagram in the category in question, and the equalizer is simply the limit of that diagram.

In more explicit terms, the equalizer consists of an object E and a morphism eq : EX satisfying , and such that, given any object O and morphism m : OX, if , then there exists a unique morphism u : OE such that .

Equalizer-01.svg

A morphism is said to equalize and if . [1]

In any universal algebraic category, including the categories where difference kernels are used, as well as the category of sets itself, the object E can always be taken to be the ordinary notion of equalizer, and the morphism eq can in that case be taken to be the inclusion function of E as a subset of X.

The generalization of this to more than two morphisms is straightforward; simply use a larger diagram with more morphisms in it. The degenerate case of only one morphism is also straightforward; then eq can be any isomorphism from an object E to X.

The correct diagram for the degenerate case with no morphisms is slightly subtle: one might initially draw the diagram as consisting of the objects X and Y and no morphisms. This is incorrect, however, since the limit of such a diagram is the product of X and Y, rather than the equalizer. (And indeed products and equalizers are different concepts: the set-theoretic definition of product doesn't agree with the set-theoretic definition of the equalizer mentioned above, hence they are actually different.) Instead, the appropriate insight is that every equalizer diagram is fundamentally concerned with X, including Y only because Y is the codomain of morphisms which appear in the diagram. With this view, we see that if there are no morphisms involved, Y does not make an appearance and the equalizer diagram consists of X alone. The limit of this diagram is then any isomorphism between E and X.

It can be proved that any equalizer in any category is a monomorphism. If the converse holds in a given category, then that category is said to be regular (in the sense of monomorphisms). More generally, a regular monomorphism in any category is any morphism m that is an equalizer of some set of morphisms. Some authors require more strictly that m be a binary equalizer, that is an equalizer of exactly two morphisms. However, if the category in question is complete, then both definitions agree.

The notion of difference kernel also makes sense in a category-theoretic context. The terminology "difference kernel" is common throughout category theory for any binary equalizer. In the case of a preadditive category (a category enriched over the category of Abelian groups), the term "difference kernel" may be interpreted literally, since subtraction of morphisms makes sense. That is, Eq(f, g) = Ker(f - g), where Ker denotes the category-theoretic kernel.

Any category with fibre products (pullbacks) and products has equalizers.

See also

Notes

  1. Barr, Michael; Wells, Charles (1998). Category theory for computing science (PDF). p. 266. Archived from the original (PDF) on 2016-03-04. Retrieved 2013-07-20.

Related Research Articles

In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type. The word homomorphism comes from the ancient Greek language: ὁμός (homos) meaning "same" and μορφή (morphe) meaning "form" or "shape". However, the word was apparently introduced to mathematics due to a (mis)translation of German ähnlich meaning "similar" to ὁμός meaning "same". The term "homomorphism" appeared as early as 1892 ; it was attributed to the German mathematician Felix Klein (1849–1925).

In category theory, a branch of mathematics, the abstract notion of a limit captures the essential properties of universal constructions such as products, pullbacks and inverse limits. The dual notion of a colimit generalizes constructions such as disjoint unions, direct sums, coproducts, pushouts and direct limits.

In mathematics, specifically abstract algebra, the isomorphism theorems are three theorems that describe the relationship between quotients, homomorphisms, and subobjects. Versions of the theorems exist for groups, rings, vector spaces, modules, Lie algebras, and various other algebraic structures. In universal algebra, the isomorphism theorems can be generalized to the context of algebras and congruences.

In mathematics, specifically category theory, adjunction is a relationship that two functors may have. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems, such as the construction of a free group on a set in algebra, or the construction of the Stone–Čech compactification of a topological space in topology.

In mathematics, specifically in category theory, a preadditive category is another name for an Ab-category, i.e., a category that is enriched over the category of abelian groups, Ab. That is, an Ab-categoryC is a category 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:

In the context of abstract algebra or universal algebra, a monomorphism is an injective homomorphism. A monomorphism from X to Y is often denoted with the notation X ↪ Y.

In category theory, an epimorphism is a morphism f : XY that is right-cancellative in the sense that, for all objects Z and all morphisms g1, g2: YZ,

In mathematics, specifically in category theory, a pre-abelian category is an additive category that has all kernels and cokernels.

An exact sequence is a concept in mathematics, especially in group theory, ring and module theory, homological algebra, as well as in differential geometry. An exact sequence is a sequence, either finite or infinite, of objects and morphisms between them such that the image of one morphism equals the kernel of the next.

Commutative diagram

In mathematics, and especially in category theory, a commutative diagram is a diagram such that all directed paths in the diagram with the same start and endpoints lead to the same result. It is said that commutative diagrams play the role in category theory that equations play in algebra.

Homological algebra area of mathematics

Homological algebra is the branch of mathematics that studies homology in a general algebraic setting. It is a relatively young discipline, whose origins can be traced to investigations in combinatorial topology and abstract algebra at the end of the 19th century, chiefly by Henri Poincaré and David Hilbert.

In category theory and its applications to other branches of mathematics, kernels are a generalization of the kernels of group homomorphisms, the kernels of module homomorphisms and certain other kernels from algebra. Intuitively, the kernel of the morphism f : XY is the "most general" morphism k : KX that yields zero when composed with f.

In mathematics, the cokernel of a linear mapping of vector spaces f : XY is the quotient space Y / im(f) of the codomain of f by the image of f. The dimension of the cokernel is called the corank of f.

In category theory, a branch of mathematics, the image of a morphism is a generalization of the image of a function.

In category theory, a branch of mathematics, a pullback is the limit of a diagram consisting of two morphisms f : X → Z and g : Y → Z with a common codomain. The pullback is often written

This is a glossary of properties and concepts in category theory in mathematics.

In category theory, a regular category is a category with finite limits 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.

Stereotype space topological vector space such that the natural map into the second dual space is an isomorphism of topological vector spaces

In functional analysis and related areas of mathematics, stereotype spaces are topological vector spaces defined by a special variant of reflexivity condition. They form a class of spaces with a series of remarkable properties, in particular, this class is very wide, it consists of spaces satisfying a natural condition of completeness, and it forms a cosmos and a *-autonomous category with the standard analytical tools for constructing new spaces, like taking dual spaces, spaces of operators, tensor products, products and coproducts, limits and colimits, and in addition, immediate subspaces, and immediate quotient spaces.

In Category theory and related fields of mathematics, an envelope is a construction that generalizes the operations of "exterior completion", like completion of a locally convex space, or Stone–Čech compactification of a topological space. A dual construction is called refinement.

Nodal decomposition mathematical term

In category theory, an abstract mathematical discipline, a nodal decomposition of a morphism is a representation of as a product , where is a strong epimorphism, a bimorphism, and a strong monomorphism.

References