Globular set¶

A sequence of sets of n-cells with source and target maps satisfying globularity equations, forming the presheaf carrier for many higher-category structures.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4742
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Higher Category Theory → Mathematics

Core Idea¶

A globular set generalizes a directed graph by adding cells in every dimension whose source and target are parallel cells one dimension lower.^[1] Paired source and target maps descend dimensions, and the equations ss=st and ts=tt ensure every higher cell's source and target share their own boundaries. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of higher category theory. It is the domain-specific identity determined by each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Globular set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

Arrows Between Arrows

Draw some dots, and draw arrows going from one dot to another. Now draw a fat arrow from one arrow to another arrow, but only if both arrows start at the same dot and end at the same dot. You can keep going: even fatter arrows between fat arrows, with the same rule each time.

Towers of Matching Arrows

A globular set starts like a map of dots connected by one-way arrows. Then it adds 'arrows between arrows': a level-2 arrow can go from one arrow to another, but only when the two arrows begin at the same dot and end at the same dot. Level-3 arrows go between level-2 arrows that line up the same way, and so on forever. Every arrow at each level has a start and an end one level down, and they always match up neatly.

Higher-Dimensional Directed Graphs

A directed graph has points and arrows, where each arrow has a source and a target point. A globular set generalizes this by adding cells in every dimension: 2-cells between arrows, 3-cells between 2-cells, and so on. Each n-cell has a source and target that are (n−1)-cells. The key rule is that the source and target must be 'parallel': they themselves share the same source and the same target. Written as equations, s∘s = s∘t and t∘s = t∘t. These are called the globularity conditions, and they make each cell look like a lens or globe shape bounded by two matching halves.

A globular set consists of sets X0, X1, X2, … with source and target maps s, t: Xn → Xn−1 for each n ≥ 1. These satisfy the globular identities s∘s = s∘t and t∘s = t∘t, which ensure that the source and target of any n-cell are parallel (n−1)-cells sharing the same boundary. Truncated at dimension 1, this is exactly a directed graph, so globular sets generalize graphs to all dimensions. They are the underlying shape data for globular approaches to higher categories, where composition is added on top. Note that a globular set itself has no composition; it is purely cells and boundary maps. Checking the structure means verifying typed s and t at each level and both equations at every level.

Structural Signature¶

Carrier: the typed higher category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact higher category theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Globular set
Constitutive operation: Paired source and target maps descend dimensions, and the equations ss=st and ts=tt ensure every higher cell's source and target share their own boundaries.
Invariant: each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level
Recognition test: type the carrier, state every parameter and convention in the definition, test that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Globular set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of higher category theory. The field contains many questions and methods that do not instantiate Globular set.
It is not its most familiar example. A canonical instance directly demonstrates that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Simplicial set. A simplicial set organizes n-simplices with many face and degeneracy maps; a globular set uses exactly one source and one target at each dimension.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Globular set must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside higher category theory, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Globular set belongs to higher category theory and is useful where the analyst can specify the typed higher category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level. The scope is broad within that domain but bounded by the need for each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[n1]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact higher category theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Globular set are converted, constrained, or organized by Paired source and target maps descend dimensions, and the equations ss=st and ts=tt ensure every higher cell's source and target share their own boundaries..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Globular set must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Globular set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Globular set can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact higher category theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Globular set, the structure counts as Globular set exactly when each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Globular set. Globular set compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Globular set. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed higher category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level, infer recognizing and comparing instances of Globular set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Globular set must control the decision and an object that resembles Globular set in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of higher category theory because they reuse the typed higher category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Paired source and target maps descend dimensions, and the equations ss=st and ts=tt ensure every higher cell's source and target share their own boundaries., and type the carrier, state every parameter and convention in the definition, test that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..^[2]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Globular set, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level. The example exposes the carrier and directly tests that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed higher category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is Paired source and target maps descend dimensions, and the equations ss=st and ts=tt ensure every higher cell's source and target share their own boundaries.; the invariant is each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level; and the result supports recognizing and comparing instances of Globular set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level destroys the classification.

Mapped back: the typed higher category theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets → Paired source and target maps descend dimensions, and the equations ss=st and ts=tt ensure every higher cell's source and target share their own boundaries. → each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level → recognizing and comparing instances of Globular set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[n1] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

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

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Globular set, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Globular set, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from higher category theory and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, Paired source and target maps descend dimensions, and the equations ss=st and ts=tt ensure every higher cell's source and target share their own boundaries., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Globular set, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Globular set, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in higher category theory.

This entry is a kind of Hierarchy.

It remains its own entry because each dimension carries typed source and target maps into the preceding dimension and both globularity equations hold at every composable level, giving the presheaf carrier for higher-category structures.

Relationships to Other Abstractions¶

Current abstraction Globular set Domain-specific

Parents (1) — outgoing typed relations

Globular set is a kind of Hierarchy Prime

What makes it its own entry: the domain-specific identity determined by each dimension has typed source and target maps to the preceding dimension and both globularity equations hold for every composable level.

Hierarchy paths (4) — routes to 4 parentless roots

Globular set → is a kind of Hierarchy → is a kind of Network

Show alternative paths (3)

Neighborhood in Abstraction Space¶

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

Family — Category Theory Foundations (48 abstractions)

Nearest neighbors

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

Not to Be Confused With¶

Simplicial set. A simplicial set organizes n-simplices with many face and degeneracy maps; a globular set uses exactly one source and one target at each dimension.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Globular set. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Globular set. An extension qualifies only when its changed axioms and retained invariant are stated.

Notes¶

[n1] It can be viewed as a specific instance of the polygraph. In a polygraph, a source or target of a k -cell may consist of an entire path of elements of ( k -1)-cells, but a globular set restricts this to singular elements of ( k -1)-cells. ↩a ↩b

References¶

[1] G Maltsiniotis, 'Grothendieck ∞-groupoids and still another definition of ∞-categories', 13 September 2010. registry ↩a ↩b

[2] Tom Leinster, Higher Operads, Higher Categories, Cambridge University Press, 2004. registry ↩