The idea of a

**free object**in mathematics is one of the basics of abstract algebra. It is part of universal algebra, in the sense that it relates to all types of algebraic structure (with finitary operations); but on the other hand it has a clean formulation in terms of category theory (in yet more abstract terms). It is probably better to master some special case such as free groups first.

Starting from a familiar concept in group theory, of defining a group 'by generators and relations', we can say that in general a **free object** of a certain specific algebraic type will have 'generators and no relations'. Yet. If we want to use the method of generators and relations in generality, we split the approach up as (i) create an object with the generators which are left *as general as possible*; and then (ii) impose relations, in the form of an equivalence relation which is a congruence. Therefore in these terms from universal algebra we need to understand free objects for step (i), and the nature of congruences for step (ii).

An example would be free monoids. These are rather simpler than free groups: the free monoid on a set *X*, is the monoid of all finite strings using *X* as alphabet, with operation concatenation of strings. The identity is the empty string. (See Kleene star.)

As that example suggests, free objects look like constructions from syntax; and we can reverse that to some extent by saying that major uses of syntax can be explained and characterised as free objects, in a way that makes apparently heavy 'punctuation' explicable (and more memorable). An example for that is the way a free magma on *X* turns out to be the magma of binary trees labelled at the leaves by *X*. That construction generalises (from a single binary operation to any collection of 'arities') in a way the free object concept makes much more palatable. (See also Herbrand universe.)

In general, the setting for a free object is like this: a category **C** of algebraic structures (sets plus operations, obeying some laws) has a functor *F* to **Sets**, the category of sets and functions, that simply ignores the operations. We call *F* a *forgetful functor*. Free objects are created by a left adjoint *G* to *F*: for a set *X* the free object on *X* as 'generators' is *G(X)*. There are general existence theorems that apply.

Other types of forgetfulness also give rise to objects quite like free objects: for example the tensor algebra construction on a vector space as left adjoint to the function on algebras over a field that ignores the algebra structure.