F-algebra

From Wikipedia, the free encyclopedia

In mathematics, specifically in category theory, an F-algebra for an endofunctor

F : \mathbf{C}\longrightarrow \mathbf{C}

is an object A of \mathbf{C} together with a \mathbf{C}-morphism

\alpha : FA \longrightarrow A.

In this sense F-algebras are dual to F-coalgebras.

The commutative diagram, which defines a property required by morphisms of the original category, so that they can be morphism of the newly defined category of F-algebras.
The commutative diagram, which defines a property required by morphisms of the original category, so that they can be morphism of the newly defined category of F-algebras.

A homomorphism from F-algebra (A,α) to F-algebra (B,β) is a morphism

f:A\longrightarrow B

in \mathbf{C} such that

f\circ \alpha = \beta \circ Ff.

Thus the F-algebras constitute a category.

Contents

[edit] Example

Consider the functor F: \mathbf{Set} \to\mathbf{Set} that sends a set X to 1 + X. Here, Set denotes the category of sets, + denotes the usual coproduct given by disjoint union, and 1 is a terminal object (i.e. any singleton set). Then the set N of natural numbers together with the function [\mathrm{zero},\mathrm{succ}] : 1+N\to N, which is the coproduct of the functions \mathrm{zero} : 1 \to N (whose image is 0) and \mathrm{succ} : N \to N (which sends an integer n to n+1), is an F-algebra.

[edit] Initial F-algebra

Main article: Initial algebra

If the category of F-algebras for a given endofunctor F has an initial object, it is called an initial algebra. The algebra (N,[zero,succ]) in the above example is an initial algebra. 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.[1]

See also Universal algebra.

[edit] Terminal F-coalgebra

In a dual way, 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.[1] In the strongly normalizing Charity programming language (i.e. each program terminates in it), coinductive data types can be used achieving surprising results, e.g. defining lookup constructs to implement such “strong” functions like the Ackermann function.[2]

[edit] See also

[edit] Notes

  1. ^ a b Philip Wadler: Recursive types for free! University of Glasgow, July 1998. Draft.
  2. ^ Robin Cockett: Charitable Thoughts (ps and ps.gz)

[edit] External links