Weak n-category¶

Organize cells through dimension n with composition and units that satisfy associativity and unitality up to coherently related higher cells rather than by strict equality.

Version: v2 · 2026-08-30 · History
Domain-specific #: 3099
Origin domain: higher category theory
Subdomain: weak higher categories

Core Idea¶

A weak n-category is an n-dimensional categorical structure in which composition and identity laws hold through specified coherent higher equivalences or isomorphisms rather than all holding as literal equalities.^[1] Failure of strict equality at one dimension is witnessed by a cell in the next dimension, and coherence laws constrain the possible composites of those witnesses so that alternative parenthesizations and unit insertions agree at the appropriate higher level.

Its autonomous residual is dimension-indexed categorical composition governed by higher coherence data, including explicit model dependence, rather than ordinary category theory or the unrestricted idea of approximate equality. The identity fails when coherence witnesses are omitted, incompatible definitions are blended as if identical, n is left untyped, a strict n-category is mislabeled merely because it has isomorphisms, or every higher cell above a threshold is silently assumed invertible.

Recognition requires an analyst to declare the model of weak higher category, list cell dimensions and compositions, identify which laws are weak and which remain strict, and verify the model's coherence conditions rather than relying on an informal up-to-equivalence slogan. Once established, it supports representing higher homotopies, comparing algebraic and topological models, distinguishing bicategories from strict 2-categories, and stating equivalence-sensitive constructions without forcing unnatural strict equalities without turning those uses into the definition.

Structural Signature¶

Carrier: a dimensionally graded collection of objects and k-cells for k from one through n, with source, target, identity, and composition data in a declared model
Inputs or antecedent state: cell globular or simplicial shape, composition operations, unit data, invertibility conventions, coherence cells, and the axioms or universal properties of one specified model
Constitutive operation: Failure of strict equality at one dimension is witnessed by a cell in the next dimension, and coherence laws constrain the possible composites of those witnesses so that alternative parenthesizations and unit insertions agree at the appropriate higher level
Invariant: the chosen model supplies typed cells and compositions through dimension n together with coherence data that weakens categorical laws without leaving composites arbitrary
Recognition test: declare the model of weak higher category, list cell dimensions and compositions, identify which laws are weak and which remain strict, and verify the model's coherence conditions rather than relying on an informal up-to-equivalence slogan
Output or consequence: representing higher homotopies, comparing algebraic and topological models, distinguishing bicategories from strict 2-categories, and stating equivalence-sensitive constructions without forcing unnatural strict equalities
Failure boundary: coherence witnesses are omitted, incompatible definitions are blended as if identical, n is left untyped, a strict n-category is mislabeled merely because it has isomorphisms, or every higher cell above a threshold is silently assumed invertible

What It Is Not¶

It is not the whole field of higher category theory; many objects in that field do not satisfy its constitutive rule.
It is not its canonical example. A bicategory is the weak two-dimensional case: composition of 1-cells is associative and unital through specified natural isomorphisms satisfying pentagon and triangle coherence. That is an instance, not a definition.
It is not Category. The Category Prime captures objects, arrows, identities, and composition; Weak n-Category adds multiple cell dimensions and makes coherence witnesses constitutive where ordinary associativity and unit equations were strict.
It is not an unrestricted metaphor. There is no single universally adopted definition for arbitrary weak n-category, though established operadic, opetopic, simplicial, and other models address the same coherence problem; equivalence results must be cited rather than presumed

Scope of Application¶

Weak n-category applies when the analyst can specify a dimensionally graded collection of objects and k-cells for k from one through n, with source, target, identity, and composition data in a declared model and establish that the chosen model supplies typed cells and compositions through dimension n together with coherence data that weakens categorical laws without leaving composites arbitrary. The entry identifies the shared weak-higher-categorical architecture and maps model dependence; it does not declare all proposed definitions equivalent or choose one as universally canonical.^[2]

Recognition. declare the model of weak higher category, list cell dimensions and compositions, identify which laws are weak and which remain strict, and verify the model's coherence conditions rather than relying on an informal up-to-equivalence slogan
Comparison. Compare legitimate instances through dimension n, cell shape, strict versus weak compositions, coherence data, invertibility level, algebraic versus simplicial presentation, truncation, and equivalence notion.
Boundary. There is no single universally adopted definition for arbitrary weak n-category, though established operadic, opetopic, simplicial, and other models address the same coherence problem; equivalence results must be cited rather than presumed
Use. Preserve every assumption when using the identity for representing higher homotopies, comparing algebraic and topological models, distinguishing bicategories from strict 2-categories, and stating equivalence-sensitive constructions without forcing unnatural strict equalities.

Clarity¶

A clear claim names the carrier, governing rule, assumptions, and recognition test. This matters because weak means laws hold coherently up to higher structure, not that axioms are optional, approximate, probabilistic, or logically deficient. The disciplined statement is that the object counts as Weak n-category exactly when the chosen model supplies typed cells and compositions through dimension n together with coherence data that weakens categorical laws without leaving composites arbitrary

Identity and measurement remain separate. Recognition is formal: examples require a declared definition and verified coherence data, not empirical similarity or a diagram that merely resembles higher cells. Approximation or noisy evidence may weaken a classification without changing its definition.

Manages Complexity¶

The abstraction compresses bicategorical, globular-operadic, opetopic, simplicial, Segal-type, and enriched models; finite n and omega-dimensional limits into a stable carrier, rule, invariant, and failure boundary. It makes comparison tractable while retaining the variables that control validity.

Compression can hide assumptions. A responsible use therefore declares dimension n, cell shape, strict versus weak compositions, coherence data, invertibility level, algebraic versus simplicial presentation, truncation, and equivalence notion and returns to the full diagnostic whenever a convention or boundary case changes.

Abstract Reasoning¶

Type the carrier. Establish a dimensionally graded collection of objects and k-cells for k from one through n, with source, target, identity, and composition data in a declared model and reject examples from a different problem.
Lock the rule. Express that the chosen model supplies typed cells and compositions through dimension n together with coherence data that weakens categorical laws without leaving composites arbitrary independently of one notation or implementation.
Derive carefully. Infer representing higher homotopies, comparing algebraic and topological models, distinguishing bicategories from strict 2-categories, and stating equivalence-sensitive constructions without forcing unnatural strict equalities only under the stated assumptions.
Stress-test. Contrast the legitimate boundary case—There is no single universally adopted definition for arbitrary weak n-category, though established operadic, opetopic, simplicial, and other models address the same coherence problem; equivalence results must be cited rather than presumed—with this counterexample: a graph with composable paths but no chosen compositions, units, or coherence structure is not a weak n-category.

Knowledge Transfer¶

Transfer within higher category theory is strong when new cases preserve the same carrier, mechanism, and diagnostic. The move from A bicategory is the weak two-dimensional case: composition of 1-cells is associative and unital through specified natural isomorphisms satisfying pentagon and triangle coherence. to Models of higher homotopy types use weak higher-groupoidal structures in which higher cells are invertible in the relevant sense. demonstrates that continuity.^[3]

Outside the domain, only the skeleton—replace equations among composites with structured witnesses and then constrain those witnesses by higher coherence—travels automatically. The terms object, k-cell, source, target, composition, identity, associator, unitor, coherence, equivalence, and higher groupoid retain domain-specific meanings, so every role and inference must be revalidated.

Examples¶

Canonical¶

A bicategory is the weak two-dimensional case: composition of 1-cells is associative and unital through specified natural isomorphisms satisfying pentagon and triangle coherence. The associator compares the two composites of three 1-cells, unitors compare composition with identities, and the coherence axioms ensure larger pasting expressions do not acquire arbitrary ambiguity. It is canonical because the carrier, rule, invariant, and consequence are all inspectable.^[1]

Mapped back: a dimensionally graded collection of objects and k-cells for k from one through n, with source, target, identity, and composition data in a declared model → Failure of strict equality at one dimension is witnessed by a cell in the next dimension, and coherence laws constrain the possible composites of those witnesses so that alternative parenthesizations and unit insertions agree at the appropriate higher level → the chosen model supplies typed cells and compositions through dimension n together with coherence data that weakens categorical laws without leaving composites arbitrary → representing higher homotopies, comparing algebraic and topological models, distinguishing bicategories from strict 2-categories, and stating equivalence-sensitive constructions without forcing unnatural strict equalities

Applied / In Practice¶

Models of higher homotopy types use weak higher-groupoidal structures in which higher cells are invertible in the relevant sense. This supports the homotopy hypothesis, but an n-groupoid adds invertibility constraints and should not be treated as synonymous with every weak n-category. It qualifies only after the same diagnostic and failure boundary are checked.^[2]

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Exact identity vs. practical recognition. The constitutive condition may be exact while evidence is indirect. Diagnostic: Can the reviewer state both the condition and the warrant?
T2: Canonical form vs. variants. bicategorical, globular-operadic, opetopic, simplicial, Segal-type, and enriched models; finite n and omega-dimensional limits can preserve or change the identity. Diagnostic: Which named role is invariant across the variants?
T3: Compression vs. hidden assumptions. The label is useful only while prerequisites remain visible. Diagnostic: Can each downstream inference be traced to a declared assumption?
T4: Autonomy vs. reduction. The candidate uses broader structures but claims dimension-indexed categorical composition governed by higher coherence data, including explicit model dependence, rather than ordinary category theory or the unrestricted idea of approximate equality. Diagnostic: Does that residual still support independent recognition after the parent and neighbors are subtracted?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is replace equations among composites with structured witnesses and then constrain those witnesses by higher coherence; its identity-bearing terms are object, k-cell, source, target, composition, identity, associator, unitor, coherence, equivalence, and higher groupoid. Those terms determine admissible objects, evidence, and consequences inside higher category theory.

Structural Core vs. Domain Accent¶

The structural core is a carrier governed by Failure of strict equality at one dimension is witnessed by a cell in the next dimension, and coherence laws constrain the possible composites of those witnesses so that alternative parenthesizations and unit insertions agree at the appropriate higher level and tested by declare the model of weak higher category, list cell dimensions and compositions, identify which laws are weak and which remain strict, and verify the model's coherence conditions rather than relying on an informal up-to-equivalence slogan. The domain accent is constitutive rather than decorative, so an analogy that preserves only the skeleton is not another instance of Weak n-category.

The proposed strict upward parent is prime:category. The candidate literally generalizes categorical objects, arrows, identities, and composition; dimensionally iterated cells and coherent weakening provide its autonomous higher-categorical specialization. The edge is proposal-only and points to a frozen prior-baseline Prime.

The entry does not collapse into the parent because dimension-indexed categorical composition governed by higher coherence data, including explicit model dependence, rather than ordinary category theory or the unrestricted idea of approximate equality A thematic neighbor is declined whenever it does not literally subsume that rule.

The prospective workspace queue contains one strict upward edge to prime:category. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Weak n-category Domain-specific

Parents (1) — more general patterns this builds on

Weak n-category is a kind of Category Prime

The proposed strict upward parent is prime:category.

Hierarchy paths (3) — routes to 3 parentless roots

Weak n-category → Category → Associativity → Invariance

Show alternative paths (2)

Neighborhood in Abstraction Space¶

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

Family — Relations, Definability & Constraint Structure (11 abstractions)

Nearest neighbors

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

Not to Be Confused With¶

Strict n-category. Requires categorical laws to hold as equalities at all relevant dimensions.
Infinity-category. Extends dimension without a fixed finite upper bound and usually imposes specified invertibility above a level.
n-groupoid. A weak n-category with suitable cells invertible, modeling homotopy types.
Bicategory. The established weak 2-category case, not a synonym for arbitrary n.

References¶

[1] Tom Leinster, Higher Operads, Higher Categories, London Mathematical Society Lecture Note Series 298, Cambridge University Press, 2004, DOI 10.1017/CBO9780511525896. registry ↩a ↩b

[2] Tom Leinster, 'A Survey of Definitions of n-Category,' Theory and Applications of Categories 10, 1–70 (2002), arXiv:math/0107188. registry ↩a ↩b

[3] Michael A. Batanin, 'Monoidal Globular Categories as a Natural Environment for the Theory of Weak n-Categories,' Advances in Mathematics 136, 39–103 (1998), DOI 10.1006/aima.1998.1724. registry ↩