In

_{1}. The following definition translates this to any category.
A concrete category is a category that is equipped with a faithful functor to Set, the category of sets. Let ''C'' be a concrete category with faithful functor . Let ''X'' be an object in Set (that is, ''X'' is a set, here called a ''basis''), let ''A'' be an object in C, and let be an injective map between the sets ''X'' and ''F''(''A'') (called the ''canonical insertion''). Then ''A'' is said to be the free object on ''X'' (with respect to ''i'') if and only if it satisfies the following universal property:
:for any object ''B'' in C and any map between sets , there exists a unique morphism in C such that . That is, the following Commutative diagram, diagram commutes:
::$\backslash begin\; X\; \backslash xrightarrow\; F(A)\; \backslash \backslash \; \_f\; \backslash searrow\; \backslash quad\; \backslash swarrow\; \_\; \backslash \backslash \; F(B)\; \backslash quad\; \backslash \backslash \; \backslash end$
In this way the free functor that builds the free object ''A'' from the set ''X'' becomes left adjoint to the forgetful functor.

{{DEFAULTSORT:Free Object
Mathematics articles needing expert attention
Abstract algebra
Free algebraic structures,
Combinatorics on words
Adjoint functors

mathematics
Mathematics (from Greek: ) includes the study of such topics as numbers (arithmetic and number theory), formulas and related structures (algebra), shapes and spaces in which they are contained (geometry), and quantities and their changes (cal ...

, the idea of a free object is one of the basic concepts of abstract algebra
In algebra, which is a broad division of mathematics, abstract algebra (occasionally called modern algebra) is the study of algebraic structures. Algebraic structures include group (mathematics), groups, ring (mathematics), rings, field (mathema ...

. It is a part of universal algebra Universal algebra (sometimes called general algebra) is the field of mathematics
Mathematics (from Greek: ) includes the study of such topics as numbers (arithmetic and number theory), formulas and related structures (algebra), shapes and spa ...

, in the sense that it relates to all types of algebraic structure (with finitary
In mathematics and logic, an Operation (mathematics), operation is finitary if it has Finite cardinality, finite arity, i.e. if it has a finite number of input values. Similarly, an infinitary operation is one with an Infinite set, infinite numbe ...

operations). It also has a formulation in terms of category theory, although this is in yet more abstract terms. Examples include free groups, tensor algebras, or free lattices. Informally, a free object over a set ''A'' can be thought of as being a "generic" algebraic structure over ''A'': the only equations that hold between elements of the free object are those that follow from the defining axioms of the algebraic structure.
Definition

Free objects are the direct generalization to Category (mathematics), categories of the notion of Basis (linear algebra), basis in a vector space. A linear function between vector spaces is entirely determined by its values on a basis of the vector space ''E''Examples

The creation of free objects proceeds in two steps. For algebras that conform to the associative law, the first step is to consider the collection of all possible string (computer science), words formed from an alphabet (computer science), alphabet. Then one imposes a set of equivalence relations upon the words, where the relations are the defining relations of the algebraic object at hand. The free object then consists of the set of equivalence classes. Consider, for example, the construction of the free group in two Generating set of a group, generators. One starts with an alphabet consisting of the five letters $\backslash $. In the first step, there is not yet any assigned meaning to the "letters" $a^$ or $b^$; these will be given later, in the second step. Thus, one could equally well start with the alphabet in five letters that is $S=\backslash $. In this example, the set of all words or strings $W(S)$ will include strings such as ''aebecede'' and ''abdc'', and so on, of arbitrary finite length, with the letters arranged in every possible order. In the next step, one imposes a set of equivalence relations. The equivalence relations for a group (mathematics), group are that of multiplication by the identity, $ge=eg=g$, and the multiplication of inverses: $gg^=g^g=e$. Applying these relations to the strings above, one obtains :$aebecede\; =\; aba^b^,$ where it was understood that $c$ is a stand-in for $a^$, and $d$ is a stand-in for $b^$, while $e$ is the identity element. Similarly, one has :$abdc\; =\; abb^a^\; =\; e.$ Denoting the equivalence relation or congruence relation, congruence by $\backslash sim$, the free object is then the collection of equivalence classes of words. Thus, in this example, the free group in two generators is the quotient set, quotient :$F\_2=W(S)/\backslash sim.$ This is often written as $F\_2=W(S)/E$ where $W(S)\; =\; \backslash $ is the set of all words, and $E\; =\; \backslash $ is the equivalence class of the identity, after the relations defining a group are imposed. A simpler example are the free monoids. The free monoid on a set ''X'', is the monoid of all finite string (computer science), strings using ''X'' as alphabet, with operation concatenation of strings. The identity is the empty string. In essence, the free monoid is simply the set of all words, with no equivalence relations imposed. This example is developed further in the article on the Kleene star.General case

In the general case, the algebraic relations need not be associative, in which case the starting point is not the set of all words, but rather, strings punctuated with parentheses, which are used to indicate the non-associative groupings of letters. Such a string may equivalently be represented by a binary tree or a free magma; the leaves of the tree are the letters from the alphabet. The algebraic relations may then be general arity, arities or finitary relations on the leaves of the tree. Rather than starting with the collection of all possible parenthesized strings, it can be more convenient to start with the Herbrand universe. Properly describing or enumerating the contents of a free object can be easy or difficult, depending on the particular algebraic object in question. For example, the free group in two generators is easily described. By contrast, little or nothing is known about the structure of free Heyting algebras in more than one generator.Peter T. Johnstone, ''Stone Spaces'', (1982) Cambridge University Press, . ''(A treatment of the one-generator free Heyting algebra is given in chapter 1, section 4.11)'' The problem of determining if two different strings belong to the same equivalence class is known as the word problem (mathematics), word problem. As the examples suggest, free objects look like constructions from syntax; one may 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).Free universal algebras

Let $S$ be any set, and let $\backslash mathbf$ be an algebraic structure of type $\backslash rho$ generated by $S$. Let the underlying set of this algebraic structure $\backslash mathbf$, sometimes called its universe, be $A$, and let $\backslash psi:\; S\; \backslash to\; A$ be a function. We say that $(A,\; \backslash psi)$ (or informally just $\backslash mathbf$) is a ''free algebra'' (of type $\backslash rho$) on the set $S$ of ''free generators'' if, for every algebra $\backslash mathbf$ of type $\backslash rho$ and every function $\backslash tau:\; S\; \backslash to\; B$, where $B$ is a universe of $\backslash mathbf$, there exists a unique homomorphism $\backslash sigma:\; A\; \backslash to\; B$ such that $\backslash sigma\; \backslash circ\; \backslash psi\; =\; \backslash tau.$Free functor

The most general setting for a free object is in category theory, where one defines a functor, the free functor, that is the left adjoint to the forgetful functor. Consider a category C of algebraic structures; the objects can be thought of as sets plus operations, obeying some laws. This category has a functor, $U:\backslash mathbf\backslash to\backslash mathbf$, the forgetful functor, which maps objects and functions in C to Set, the category of sets. The forgetful functor is very simple: it just ignores all of the operations. The free functor ''F'', when it exists, is the left adjoint to ''U''. That is, $F:\backslash mathbf\backslash to\backslash mathbf$ takes sets ''X'' in Set to their corresponding free objects ''F''(''X'') in the category C. The set ''X'' can be thought of as the set of "generators" of the free object ''F''(''X''). For the free functor to be a left adjoint, one must also have a Set-morphism $\backslash eta:X\backslash to\; U(F(X))\backslash ,\backslash !$. More explicitly, ''F'' is, up to isomorphisms in C, characterized by the following universal property: :Whenever ''A'' is an algebra in C, and is a function (a morphism in the category of sets), then there is a unique C-morphism such that . Concretely, this sends a set into the free object on that set; it is the "inclusion of a basis". Abusing notation, $X\; \backslash to\; F(X)$ (this abuses notation because ''X'' is a set, while ''F''(''X'') is an algebra; correctly, it is $X\; \backslash to\; U(F(X))$). The natural transformation $\backslash eta:\backslash operatorname\_\backslash mathbf\backslash to\; UF$ is called the unit (category theory), unit; together with the counit $\backslash varepsilon:FU\backslash to\; \backslash operatorname\; \_\backslash mathbf$, one may construct a T-algebra, and so a monad (category theory), monad. The cofree functor is the right adjoint to the forgetful functor.Existence

There are general existence theorems that apply; the most basic of them guarantees that :Whenever C is a variety (universal algebra), variety, then for every set ''X'' there is a free object ''F''(''X'') in C. Here, a variety is a synonym for a finitary algebraic category, thus implying that the set of relations are finitary relation, finitary, and ''algebraic'' because it is monad (category theory), monadic over Set.General case

Other types of forgetfulness also give rise to objects quite like free objects, in that they are left adjoint to a forgetful functor, not necessarily to sets. For example, the tensor algebra construction on a vector space is the left adjoint to the functor on associative algebras that ignores the algebra structure. It is therefore often also called a free algebra. Likewise the symmetric algebra and exterior algebra are free symmetric and anti-symmetric algebras on a vector space.List of free objects

Specific kinds of free objects include: *free algebra **free associative algebra **free commutative algebra *free category **free strict monoidal category *free group **free abelian group **free partially commutative group *Kleene algebra#Examples, free Kleene algebra *free lattice **free Boolean algebra **distributive lattice#Free distributive lattices, free distributive lattice **free Heyting algebra ** free modular lattice *free Lie algebra *free magma *free module, and in particular, vector space *free monoid **free monoid#The free commutative monoid, free commutative monoid **free partially commutative monoid *free ring *free semigroup *free semiring **semiring#Examples, free commutative semiring *free theory *term algebra *discrete spaceSee also

*Generating setNotes