F-algebra

In mathematics, specifically in category theory, F-algebras generalize the notion of algebraic structure.

Rewriting the algebraic laws in terms of morphisms eliminates all references to quantified elements from the axioms, and these algebraic laws may then be glued together in terms of a single functor F, the signature.

F-algebras can also be used to represent data structures used in programming, such as lists and trees.

The main related concepts are initial F-algebras which may serve to encapsulate the induction principle, and the dual construction F-coalgebras.

When it is permissible from context, algebras are often referred to by their carrier only instead of the tuple.

, according to the following commutative diagram: Equipped with these morphisms,

, satisfying three axioms: the existence of an identity element, the existence of an inverse for each element of the group, and associativity.

To put this in a categorical framework, first define the identity and inverse as functions (morphisms of the set

It is then possible to write the axioms of a group in terms of functions (note how the existential quantifier is absent): Then this can be expressed with commutative diagrams:[1][2]

Now use the coproduct (the disjoint union of sets) to glue the three morphisms in one:

The above construction is used to define group objects over an arbitrary category with finite products and a terminal object

When the category admits finite coproducts, the group objects are

-algebras in the category of finite sets and Lie groups are

For example, abelian groups are F-algebras for the same functor F(G) = 1 + G + G×G as for groups, with an additional axiom for commutativity: m∘t = m, where t(x,y) = (y,x) is the transpose on GxG.

In the same vein, semigroups are F-algebras of signature F(S) = S×S Rings, domains and fields are also F-algebras with a signature involving two laws +,•: R×R → R, an additive identity 0: 1 → R, a multiplicative identity 1: 1 → R, and an additive inverse for each element -: R → R. As all these functions share the same codomain R they can be glued into a single signature function 1 + 1 + R + R×R + R×R → R, with axioms to express associativity, distributivity, and so on.

This makes rings F-algebras on the category of sets with signature 1 + 1 + R + R×R + R×R.

Alternatively, we can look at the functor F(R) = 1 + R×R in the category of abelian groups.

In that context, the multiplication is a homomorphism, meaning m(x + y, z) = m(x,z) + m(y,z) and m(x,y + z) = m(x,y) + m(x,z), which are precisely the distributivity conditions.

Therefore, a ring is an F-algebra of signature 1 + R×R over the category of abelian groups which satisfies two axioms (associativity and identity for the multiplication).

When we come to vector spaces and modules, the signature functor includes a scalar multiplication k×E → E, and the signature F(E) = 1 + E + k×E is parametrized by k over the category of fields, or rings.

Algebras over a field can be viewed as F-algebras of signature 1 + 1 + A + A×A + A×A + k×A over the category of sets, of signature 1 + A×A over the category of modules (a module with an internal multiplication), and of signature k×A over the category of rings (a ring with a scalar multiplication), when they are associative and unitary.

For example, a poset P may be defined in categorical terms with a morphism s:P × P → Ω, on a subobject classifier (Ω = {0,1} in the category of sets and s(x,y)=1 precisely when x≤y).

This is because they can equivalently be defined in terms of the algebraic operations: x∨y = inf(x,y) and x∧y = sup(x,y), subject to certain axioms (commutativity, associativity, absorption and idempotency).

denotes the usual coproduct given by the disjoint union, and

is a terminal object (i.e. any singleton set).

Various finite data structures used in programming, such as lists and trees, can be obtained as initial algebras of specific endofunctors.

Types defined by using least fixed point construct with functor F can be regarded as an initial F-algebra, provided that parametricity holds for the type.

In a dual way, a similar relationship exists between notions of greatest fixed point and terminal F-coalgebra.

These can be used for allowing potentially infinite objects while maintaining strong normalization property.

[3] In the strongly normalizing Charity programming language (i.e. each program terminates in it), coinductive data types can be used to achieve surprising results, enabling the definition of lookup constructs to implement such “strong” functions like the Ackermann function.