Subfunctor¶

In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset.

Version: v1 · 2026-09-28 · History
Domain-specific #: 12340
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Category Theory → Mathematics

Core Idea¶

Subfunctor is treated here as the recurring category theory identity summarized by this source-grounded definition: In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset.

In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset. A contravariant functor G from \mathcal{C} to Set is a subfunctor of F if. For all arrows f: c' \rightarrow c of \mathcal{C} , G(f) is the restriction of F(f) to G(c') .

Notice that 1 T is the restriction of 1 S to T. The most important examples of subfunctors are subfunctors of the Hom functor. Such a subfunctor is called a sieve, and it is usually used when defining Grothendieck topologies.

For Subfunctor, the abstraction is narrower than the article's general subject matter: a positive case must preserve In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in category theory, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — Suppose that this inclusion morphism G → F is representable by open immersions, i.e., for any representable functor and any morphism , the fibered product is a representable functor and the morphism Y → X defined by the Yoneda lemma is an open immersion.
Constitutive relation — If F is covered by representable open subfunctors, then, under certain conditions, it can be shown that F is representable.
Operating condition — It was discovered and exploited heavily by Alexander Grothendieck, who applied it especially to the case of schemes.
Recognition evidence — Let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set.
Admissible variation — A contravariant functor G from \mathcal{C} to Set is a subfunctor of F if.
Characteristic consequence — For all objects c of \mathcal{C} , G© \subseteq F© , and.
Failure boundary — For all arrows f: c' \rightarrow c of \mathcal{C} , G(f) is the restriction of F(f) to G(c') .

What It Is Not¶

Not the whole field of category theory. The node requires the specific identity stated by In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset.
Not an over-broad reading. Let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set.
Not an over-broad reading. A contravariant functor G from \mathcal{C} to Set is a subfunctor of F if.
Not an over-broad reading. For all objects c of \mathcal{C} , G© \subseteq F© , and.
Not automatically Functor Category. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Subfunctor applies literally inside category theory wherever the source-defined carrier and relation can be established. Its documented habitats include:

Definition. A functor F: 1 → Set maps the unique object of 1 to some set S and the unique identity arrow of 1 to the identity function 1 S on S.
Definition. A subfunctor G of F maps the unique object of 1 to a subset T of S and maps the unique identity arrow to the identity function 1 T on T.
Remarks. Such a subfunctor is called a sieve, and it is usually used when defining Grothendieck topologies.
Open subfunctors. Subfunctors are also used in the construction of representable functors on the category of ringed spaces.
Definition. Let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set.
Definition. A contravariant functor G from \mathcal{C} to Set is a subfunctor of F if.

Outside category theory, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Classification or should be marked as analogy.

Clarity¶

A clear use of Subfunctor names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset. The strongest recognition evidence in the frozen account is: Let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification Let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Subfunctor compresses multiple category theory details into a stable diagnostic relation. The source shows both the central mechanism—if F is covered by representable open subfunctors, then, under certain conditions, it can be shown that F is representable.—and the practical consequence—for all objects c of \mathcal{C} , G© \subseteq F© , and. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the category theory entities to which the claim applies.
State the relation. Use the source-grounded identity: In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset.
Check operation and conditions. It was discovered and exploited heavily by Alexander Grothendieck, who applied it especially to the case of schemes.
Demand recognition evidence. Let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set.
Test variation. Change an implementation or setting while preserving a contravariant functor G from \mathcal{C} to Set is a subfunctor of F if.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Classification.

Knowledge Transfer¶

Within the home domain. Knowledge about Subfunctor transfers literally when a new case preserves the same carrier type, relation, and recognition test. A functor F: 1 → Set maps the unique object of 1 to some set S and the unique identity arrow of 1 to the identity function 1 S on S. A subfunctor G of F maps the unique object of 1 to a subset T of S and maps the unique identity arrow to the identity function 1 T on T.

Beyond the home domain. No canonical parent is asserted for Subfunctor. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

For example, let 1 be the category with a single object and a single arrow. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset; recognition evidence → Let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set

Applied / In Practice¶

It was discovered and exploited heavily by Alexander Grothendieck, who applied it especially to the case of schemes. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Open subfunctors; invariant → In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset; boundary → the case exits the class when let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set

Structural Tensions¶

T1 — Stable identity versus admissible variation. Let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. A contravariant functor G from \mathcal{C} to Set is a subfunctor of F if. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. For all objects c of \mathcal{C} , G© \subseteq F© , and. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. For all arrows f: c' \rightarrow c of \mathcal{C} , G(f) is the restriction of F(f) to G(c') . The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. Suppose that this inclusion morphism G → F is representable by open immersions, i.e., for any representable functor and any morphism , the fibered product is a representable functor and the morphism Y → X defined by the Yoneda lemma is an open immersion. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Subfunctor literally, co-instantiate Classification, or only resemble it?

T6 — Autonomy versus reduction. If F is covered by representable open subfunctors, then, under certain conditions, it can be shown that F is representable. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Subfunctor distinguish that the broader parent Classification leaves together?

Structural–Framed Character¶

Subfunctor is mixed or framed-leaning. Its structural side is the repeatable organization summarized by In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset. Its framed side is the category theory vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: It was discovered and exploited heavily by Alexander Grothendieck, who applied it especially to the case of schemes. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Classification. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Suppose that this inclusion morphism G → F is representable by open immersions, i.e., for any representable functor and any morphism , the fibered product is a representable functor and the morphism Y → X defined by the Yoneda lemma is an open immersion. If F is covered by representable open subfunctors, then, under certain conditions, it can be shown that F is representable. It further constrains recognition and variation through: It was discovered and exploited heavily by Alexander Grothendieck, who applied it especially to the case of schemes. Let \mathcal{C} be a category, and let F be a contravariant functor from \mathcal{C} to the category of sets Set.

What is domain-bound. category theory supplies the operative entities, technical vocabulary, warrants, and exceptions that make Subfunctor literal. Its documented scope includes the condition that A functor F: 1 → Set maps the unique object of 1 to some set S and the unique identity arrow of 1 to the identity function 1 S on S. Another bounded application condition is that A subfunctor G of F maps the unique object of 1 to a subset T of S and maps the unique identity arrow to the identity function 1 T on T. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—A contravariant functor G from \mathcal{C} to Set is a subfunctor of F if.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Functor.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Subfunctor. The reviewed identity is: In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Subfunctor Domain-specific

Parents (1) — more general patterns this builds on

Subfunctor is a kind of Functor Domain-specific

A subfunctor is a functor embedded componentwise inside another functor, with inclusion compatibility as its differentia.

Hierarchy paths (4) — routes to 4 parentless roots

Subfunctor → Functor → Category → Associativity → Invariance

Show alternative paths (3)

Neighborhood in Abstraction Space¶

Subfunctor sits in a moderately populated region (41^st percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Algebraic Structures, Groups & Operators (42 abstractions)

Nearest neighbors

Small category — 0.89
Hochschild homology — 0.87
Symplectic category — 0.87
Filling radius — 0.87
Julia set — 0.87

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Classification. The parent omits the specialist differentia. Tell: Can the case establish In category theory, a branch of mathematics, a subfunctor is a special type of functor that is an analogue of a subset?
Functor Category. For fixed categories C and D, the category whose objects are functors C→D and whose morphisms are natural transformations, with identities and composition defined componentwise. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Yoneda Extension. The left Kan extension of a functor along the Yoneda embedding, yielding its essentially unique colimit-preserving extension from a small category to that category’s presheaf completion. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Simplicial Presheaf. A simplicial presheaf is a contravariant functor from a category to simplicial sets, equivalently a simplicial object in set-valued presheaves, combining sectionwise homotopy data with functorial restriction. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Subfunctor remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside category theory lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Classification?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Subfunctor (revision 1326415680).

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.