Coherent category¶

Equip a regular category with finite unions of subobjects that remain stable under pullback, providing categorical semantics for finite-limit, existential, and finite-disjunctive reasoning.

Version: v3 · 2026-09-19 · History
Domain-specific #: 1493
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Category Theory, Categorical Logic and Topos Theory → Mathematics

Core Idea¶

A coherent category is a regular category \(\mathcal C\) in which each subobject poset (Sub(X)) has finite joins and every inverse-image map \(f^*:Sub(Y)\to Sub(X)\) preserves those joins. Finite limits interpret conjunction and equality, regular images interpret existential quantification, and pullback-stable finite joins interpret disjunction; preservation makes these logical operations compatible with substitution along morphisms.

Its autonomous residual is the conjunction of regular categorical structure with pullback-stable finite subobject unions, and its role as semantics for coherent logic, not generic consistency, categorical coherence diagrams, or coherence of sheaves.

How would you explain it like I'm…

No faithful explanation at this level. A child-level picture can only lean on the everyday sense of "coherent" or on "a world with and, or, there is", both of which drop the defining regular structure with pullback-stable finite subobject unions and invite the ordinary-language misreading the concept excludes.

Where Or Keeps Working

Category theory is a part of math that studies objects and the arrows between them, a bit like a map of places and roads. In a coherent category, you can talk about the parts of each object and combine them using logic words: AND (the overlap of two parts), OR (putting two parts together), and 'THERE IS SOME'. The special rule is that when you follow an arrow backward from one object to another, these combinations are carried along correctly: the OR of two parts goes to the OR of the carried parts. That makes a coherent category a place where a certain kind of logic works properly.

Regular Category with Stable Unions

A coherent category is a kind of category designed to interpret a fragment of logic called coherent logic, which uses 'and', 'or', 'there exists', 'true', 'false', and equality. It starts from a regular category, which has finite limits (used for 'and' and equality) and well-behaved images (used for 'there exists'). A coherent category additionally requires that for each object, its subobjects (its 'parts') have finite unions, or joins, and that these unions are preserved when you pull parts back along any arrow. That preservation makes 'or' behave correctly under substitution, just as it does in ordinary logic. The name refers to coherent logic, not to everyday 'coherence' or to other mathematical uses like coherent sheaves.

A coherent category is a regular category in which each subobject poset Sub(X) has finite joins and every inverse-image map f*: Sub(Y) to Sub(X) preserves them. In the logical reading, finite limits interpret conjunction and equality, pullback-stable regular images (from regular epi-mono factorizations) interpret existential quantification, and pullback-stable finite joins interpret disjunction, including the empty join as falsity. Preservation by inverse image makes these operations compatible with substitution along morphisms. The concept fails when finite limits or stable images are missing, when subobject joins exist but are not pullback-stable, when only binary coproducts of objects are available, or when 'coherence' is meant in its everyday sense or in the unrelated senses of coherence diagrams or coherent sheaves. Verifying the structure requires checking finite limits, stable image factorizations, finite subobject joins, their stability under inverse image, and care with subobjects as equivalence classes rather than chosen representatives. Coherent categories provide semantics for coherent first-order theories, support classifying categories and toposes, and underpin completeness and conservativity results.

Scope of Application¶

Coherent category applies when the analyst can specify a category with finite limits, regular image factorizations, and a subobject poset for every object and establish that regular-category structure is present and finite unions of subobjects exist and are stable under pullback, equivalently the subobject inverse-image maps preserve finite joins under the adopted convention. The entry uses the standard categorical-logic definition. It does not assert that every functor category built from a coherent category is coherent without additional hypotheses, and all size and exactness assumptions must remain visible.

Clarity¶

A clear claim names the carrier, governing rule, assumptions, and recognition test. This matters because coherent describes proof systems, sheaves, rings, configurations and ordinary consistency, while category-theory coherence theorems concern commuting diagrams rather than coherent categories. The disciplined statement is that the object counts as Coherent category exactly when regular-category structure is present and finite unions of subobjects exist and are stable under pullback, equivalently the subobject inverse-image maps preserve finite joins under the adopted convention

Manages Complexity¶

The abstraction compresses syntactic categories of coherent theories, pretoposes, coherent toposes, categories of algebraic or relational structures, small and locally small settings, coherent functors, Heyting enrichments, geometric infinitary extensions, and alternative regularity axiom packages into a stable carrier, rule, invariant, and failure boundary. It makes comparison tractable while retaining the variables that control validity.

Abstract Reasoning¶

Type the carrier. Establish a category with finite limits, regular image factorizations, and a subobject poset for every object and reject examples from a different problem.
Lock the rule. Express that regular-category structure is present and finite unions of subobjects exist and are stable under pullback, equivalently the subobject inverse-image maps preserve finite joins under the adopted convention independently of one notation or implementation.

Knowledge Transfer¶

Transfer within category theory is strong when new cases preserve the same carrier, mechanism, and diagnostic. The move from For a coherent first-order theory, its syntactic category has formulas-in-context as objects and provably functional relations as arrows, with conjunction, existential quantification and finite disjunction represented by the coherent categorical operations to A coherent functor from a small coherent category into Set acts as a model whose interpretation preserves finite limits, regular images and finite unions of definable subobjects demonstrates that continuity.

Relationships to Other Abstractions¶

Current abstraction Coherent category Domain-specific

Parents (1) — outgoing typed relations

Coherent category is a kind of Category Prime

A coherent category is literally a category—objects and composable arrows—equipped with additional exactness and subobject-union structure.

Hierarchy paths (3) — routes to 3 parentless roots

Coherent category → is a kind of Category → includes Associativity → is a kind of Invariance

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Coherent category sits in a crowded region of the domain-specific corpus (24^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

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