Anafunctor

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, an anafunctor is a notion introduced by for ordinary categories that is a generalization of functors. In category theory, some statements require the axiom of choice, but the axiom of choice can sometimes be avoided when using an anafunctor. For example, the statement "every fully faithful and essentially surjective functor is an equivalence of categories" is equivalent to the axiom of choice, but we can usually follow the same statement without the axiom of choice by using anafunctor instead of functor.

In mathematics, an anafunctor is a notion introduced by for ordinary categories that is a generalization of functors. In category theory, some statements require the axiom of choice, but the axiom of choice can sometimes be avoided when using an anafunctor. For example, the statement "every fully faithful and essentially surjective functor is an equivalence of categories" is equivalent to the axiom of choice, but we can usually follow the same statement without the axiom of choice by using anafunctor instead of functor.

Set-theoretic definition

An anafunctor F: X \xrightarrow{a} A following condition: A set |F| of specifications of F , with maps \sigma : |F| \to \mathrm{Ob} (X) (source), \tau : |F| \to \mathrm{Ob} (A) (target). |F| is the set of specifications, s \in |F| specifies the value \tau (s) at the argument \sigma (s) . For X \in \mathrm{Ob} (X) , we write |F| \; X for the class \{s \in |F| : \sigma (s) = X\} and F_{s} (X) for \tau (s) the notation F_{s} (X) presumes that s \in |F| \; X .

For each X, \; Y \in \mathrm{Ob} (X) , x \in |F| \; X , y \in |F| \; Y and f : X \to Y in the class of all arrows \mathrm{Arr (X)} an arrows F_{x,y} (f) : F_{x} (X) \to F_{y} (Y) in A . For every X \in \mathrm{Ob} (X) , such that |F| \; X is inhabited (non-empty). F hold identity. For all X \in \mathrm{Ob} (X) and x \in |F| \; X , we have F_{x,x} (\mathrm{id}_x) = \mathrm{id}_{F_{x}X} F hold composition. Whenever X, Y, Z \in \mathrm{Ob} (X) , x \in |F| \; X , y \in |F| \; Y , z \in |F| \; Z, and F_{x,z} (gf) = F_{y,z} (g) \circ F_{x,y} (f) .

Notes

Bibliography

Further reading

- Kelly had already noticed a notion that was essentially the same as anafunctor in this paper, but did not seem to develop the notion further.

External links

Text derived from https://en.wikipedia.org/w/index.php?oldid=1311269904 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001311269904 · captured 1757843231.0 · version history

Cite this page as: encyclopegia.org, “Anafunctor”, snapshot enwiki-001311269904. https://encyclopegia.org/a/anafunctor

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.