nLab stuff, structure, property

Redirected from "extra property".
Stuff, structure, and properties

Stuff, structure, and properties

Idea

It is common in mathematics to speak of

  1. objects enjoying “extra properties” (for instance a ring being commutative ring);

  2. objects carrying “extra structure” (for instance a set carrying a topology);

  3. objects being equipped with “extra stuff” (for instance a ring being equipped with a module).

In model theory there is a formalization of what it means to equip a set with mathematical structure, and one may say what it means for a function between these sets to have the property of preserving this extra structure. But this formalization captures only parts of the situations in which it is useful to speak of “extra property”, “extra structure”, and “extra stuff”.

Now category theory is precisely the kind of mathematical meta-theory that allows a nice and general formalization of such matters. Here we discuss such a formalization, due to (Baez-Bartels-Dolan 98, see also Baez-Shulman 06, section 2.4), phrased in terms of properties of functors that compare a category of objects with extra structure/property/stuff to the underlying category of objects without.

In fact this formalization involves the generalization of what in homotopy theory is called the Postnikov tower theory (or (n-connected, n-truncated) factorization system), generalizing this from groupoids to categories (directed homotopy types).

For related discussion see also at structure type and stuff type.

Note that this account operates under the principle of equivalence, where constructions are taken to be invariant under morphisms which are invertible in a maximally weak sense. When working with various amounts of strictness, further requirements are appropriate, some of which are noted below.

Definitions

To begin with, let CC and DD be groupoids, and let F:CDF: C \to D be a functor. By fiat, declare FF to be a forgetful functor. Then

Another way to break down the possibilities (used in a 33-way factorisation system) is as follows:

  • FF forgets only properties if FF is full and faithful;
  • FF forgets purely structure if FF is essentially surjective (on objects) and faithful;
  • FF forgets purely stuff if FF is essentially surjective and full.

Depending on author and the strictness of the situation, more properties are required of a functor to forget structure (Ehresmann 57, Ehresmann 65, Adamek-Rosicky-Vitale 09, remark 13.18):

  1. FF is an amnestic functor (FF-vertical isomorphisms are identities),

  2. FF is an isofibration.

However, notice that these two conditions violate the principle of equivalence for categories. In the terminology of strict categories one might hence refer to these conditions as expressing “strict extra structure”.

Interpretation in terms of k-surjectivity

The pattern here is best understood in terms of the notion of essentially k-surjective functor.

Recall that for a functor between ordinary categories (1-categories)

  • essentially surjective \simeq essentially 0-surjective
  • full \simeq essentially 1-surjective
  • faithful \simeq essentially 2-surjective

and that every 1-functor is essentially kk-surjective for all k3k \geq 3.

So the above says for a functor F:CDF : C \to D:

If it is …then it …but it …
essentially (k0)(k \geq 0)-surjectiveforgets nothingremembers everything
essentially (k1)(k \geq 1)-surjectiveforgets only propertiesremembers at least stuff and structure
essentially (k2)(k \geq 2)-surjectiveforgets at most structureremembers at least stuff
essentially (k3)(k \geq 3)-surjectivemay forget everythingmay remember nothing

It is worth noting that this formalism captures the intuition of how “stuff”, “structure”, and “properties” are expected to be related:

  • stuff may be equipped with structure;
  • structure may have (be equipped with) properties.

The 33-way breakdown looks like this:

If it is …then it …but it …
essentially (k0)(k \ne 0)-surjectiveforgets only propertiesremembers at least stuff and structure
essentially (k1)(k \ne 1)-surjectiveforgets purely structureremembers at least stuff and properties
essentially (k2)(k \ne 2)-surjectiveforgets purely stuffremembers at least structure and properties

This formalism does not capture the intuition so well, and in fact the ‘properties’ (and ‘structure’) remembered by a functor that forgets purely structure (or purely stuff) may not match what one expects.

See also the examples below.

Generalization to higher groupoids

The formulation in terms of kk-surjectivity induces an immediate generalization of the notions of stuff, structure and properties to the context of infinity-groupoids. Baez’s students speak of “2-stuff,” “3-stuff,” and so on. Of course, structure and properties can then be called 0-stuff and (1)(-1)-stuff, respectively.

Generalization to categories and higher categories

The theory is easiest when restricted to groupoids as above; for categories, there are several ways to go. One is to keep the definition as phrased above (a functor between categories forgets only properties if it is fully faithful, forgets at most structure if it is faithful, etc.). Another is to apply the above definition instead to the functor between the underlying groupoids of the categories in question.

To tell the difference, ask yourself whether the difference between a monoid and a semigroup is the structure of being equipped with an identity element or only the property that an identity element exists. Note that an identity element, if it exists, must be unique and must be preserved by semigroup isomorphisms and by monoid homomorphisms but not by semigroup homomorphisms.

A third option is to define a new notion: a functor forgets at most property-like structure if it is pseudomonic. This means that (1) the functor is faithful and (2) its induced functor between underlying groupoids is fully faithful. Intuitively, property-like structure can be described as consisting of “properties which need not be automatically preserved by morphisms” or “structure which, if it exists, is uniquely determined.” Examples include that a category has all limits of a specified sort.

Property-like structure becomes much more prevalent for higher categories. For example, the forgetful functor from the 2-category of cartesian monoidal categories (and product-preserving functors) to Cat is essentially (k2)(k\ge 2)-surjective, and its induced functor between 2-groupoids is essentially (k1)(k\ge 1)-surjective; thus it forgets property-like structure. See also lax-idempotent 2-monad.

Note that property-like structure is known in traditional logic as categorical structure. Obviously, this term can be confusing in categorial logic!

A factorisation system

Just as the category Set has the best known 22-way factorisation system, in which every function is factored into a surjection followed by an injection, so the 2-category Cat has a ternary factorisation system, in which every functor is factored into parts which forget ‘purely’ stuff, structure, and properties.

Specifically, given a functor F:CDF: C \to D, let the 1-image 1imF1 im F of FF be the category whose objects are objects of CC and whose morphisms xyx \to y are morphisms F(x)F(y)F(x) \to F(y) in DD; let the 2-image 2imF2 im F of FF be the category whose objects are objects of CC and whose morphisms xyx \to y are morphisms b:F(x)F(y)b: F(x) \to F(y) in DD such that b=F(a)b = F(a) for some a:xya: x \to y in CC. (So the only difference bewteen 2imF2 im F and CC itself is equality of morphisms.) If you want to be complete, call CC itself the 3-image of FF and DD the 0-image.

The situation looks like this:

This category …gets objects from …and morphisms from …and equality of morphisms from …
CCCCCCCC
2imF2 im FCCCCDD
1imF1 im FCCDDDD
DDDDDDDD

Then FF can be factored into functors

CF 22imFF 11imFF 0D, C \stackrel{F_2}\to 2 im F \stackrel{F_1}\to 1 im F \stackrel{F_0}\to D ,

where F 2F_2 forgets purely stuff, F 1F_1 forgets purely structure, and F 0F_0 forgets only properties. Conversely, this ternary factorization suffices to determine the notions of faithful, full, and essentially surjective functors: see ternary factorization system.

Examples

The classical categories of sets with extra structure

The classical examples are the forgetful functors to Set that define the classical categories such as Top, Grp, Vect, etc. All these categories are categories of sets equipped with extra structure (e.g. with a topology, with a group structure, etc). Accordingly the obvious functors to Set are

  • faithful
  • not full.

Hence indeed, by the above yoga, they forget this extra structure but remember the stuff in question (the underlying set).

More examples

The embedding of abelian groups into all groups, F:F : Ab \to Grp is faithful and full, but not essentially surjective. Hence it should remember stuff and structure but forget properties. Indeed, the property it forgets is the property “is abelian” which is a property of the group structure sitting on the underlying set of a group. Hence the sequence of functors

AbGrpSetpt Ab \to Grp \to Set \to pt

(with pt the terminal category) successively forgets first a property (being abelian) then structure (the group structure on a set) then stuff (the underlying set).

Notice that the order here is backwards from the automatic factorisation given by the 33-way factorisation system described above. (And in fact, the structure forgotten here is not ‘pure’; GrpSetGrp \to Set is not essentially surjective.) Indeed, the above factorisation is arbitrary; it comes from seeing an abelian group as a group with an extra property and a group as a set with extra structure, but one may view things differently (for example, that an abelian group is a monoid with extra property, or a set with two group structures that are related as in the Eckmann-Hilton argument).

The automatic factorisation is in fact like this (up to equivalence of categories):

Abptptpt Ab \to \pt \to \pt \to \pt

because the original functor AbptAb \to \pt is already essentially surjective and full. In other words, from the perspective of pt\pt, an abelian group is simply extra stuff.

More interestingly, we can factor the forgetful functor AbSetAb \to Set:

AbAbSet{}Set Ab \to Ab \to Set \setminus \{\empty\} \to Set

Here, the first part is trivial because AbSetAb \to Set is faithful. The category Set{}Set \setminus \{\empty\} is the category of inhabited sets, that is the category of sets that are capable of being equipped with the structure of an abelian group. So from the point of view of its underlying set, an abelian group is a set with the property that it is inhabited and the structure of an abelian group but no additional stuff.

For something interesting at every level, take the functor Ab×AbSetAb \times Ab \to Set that takes the underlying set of the first abelian group. This factors as follows:

Ab×AbAbSet{}Set Ab \times Ab \to Ab \to Set \setminus \{\empty\} \to Set

So a pair of abelian groups (from the perspective of the underlying set of the first one) consists of the property that the set is inhabited, then the structure of an abelian group on that set, and finally extra stuff consisting of the entire second group.

Logical interpretation

In logic a property PP is given by a predicate, which we may think of as an operation that takes a thing xx to the truth value of the statement “xx has property PP”. Note that a truth value is a (1)(-1)-groupoid; we get structure and stuff by replacing this with a set (a 00-groupoid) or a groupoid (a 11-groupoid) and we get nn-stuff by replacing this with an nn-groupoid.

Now, if a property of objects of a category CC that respects the principle of equivalence holds for some object xx, then it must hold for any object isomorphic to xx. That is, the predicate defining that property is actually a functor from the core C isoC_iso of CC to the groupoid TV isoTV_iso of truth values. Given such a predicate functor PP, it's immediate how to define a full subcategory C PC_P of CC consisting of those objects with the property; the inclusion functor C PCC_P \hookrightarrow C is fully faithful, as it should be for extra property. Conversely, given a fully faithful functor F:DCF: D \to C, define a property of objects of CC that respects the principle of equivalence as follows: an object xx of CC has the property if there is some object aa of DD such that xF(a)x \cong F(a). If you apply this to C PCC_P \hookrightarrow C, then you get the predicate PP back; if you start with an arbitrary fully faithful F:DCF: D \to C, define a predicate PP, and then form C FC_F, you'll find that C FC_F and DD are equivalent, even as bundles over CC.

Diagrammatically this may be phrased as saying that every fully faithful functor DCD \to C arises as a weak pullback of the 11-subobject classifier

D iso * true C iso P {true,false} \array{ D_{iso} &\to& * \\ \downarrow &\Downarrow& \downarrow^{true} \\ C_{iso} &\stackrel{P}{\to}& \{\true, false \} }

Similarly, any structure on objects of CC that respects the principle of equivalence is given by a functor from C isoC_iso to the groupoid Set isoSet_iso of sets. Given such a functor PP, let C PC_P be the category of elements of PP, which comes with a faithful functor from C PC_P to CC. Conversely, given any faithful functor F:DCF: D \to C and an object xx of CC, let P(x)P(x) be the essential fiber of FF over xx, which (because FF is faithful) is a discrete category and hence (equivalent to) a set. These operations are also invertible, up to equivalence.

Diagrammatically this may be phrased as saying that every faithful functor DCD \to C arises as a weak pullback of the 22-subobject classifier (as described at generalized universal bundle and at category of elements)

D iso (Set *) iso C iso Set iso. \array{ D_{iso} &\to& (Set_*)_{iso} \\ \downarrow &\Downarrow& \downarrow \\ C_{iso} &\stackrel{}{\to}& Set_{iso} } \,.

Next, any stuff on objects of CC that respects the principle of equivalence is given by a functor from C isoC_iso to Grpd isoGrpd_iso. Here Grpd isoGrpd_iso should be taken to be the 22-groupoid whose objects are groupoids, whose morphisms are equivalences, and whose 22-morphisms are natural isomorphisms; similarly, the functor P:C isoGrpd isoP: C_iso \to Grpd_iso should be taken in the weakest sense (often called a pseudofunctor). Then the Grothendieck construction turns PP into a category C PC_P equipped with a functor to CC; again, the essential fiber converts any functor F:DCF: D \to C into such a PP (although really you must take the core of the essential fiber to get a groupoid).

Diagrammatically this may be phrased as saying that every functor DCD \to C arises as a weak pullback of the 33-subobject classifier (as described at generalized universal bundle )

D iso (Grpd *) iso C iso Grpd iso. \array{ D_{iso} &\to& (Grpd_*)_{iso} \\ \downarrow &\Downarrow& \downarrow \\ C_{iso} &\stackrel{}{\to}& Grpd_{iso} } \,.

If CC is a mere 11-category, then any P:C iso2Grpd isoP: C_iso \to 2 Grpd_iso is equivalent to some P:C isoGrpd isoP: C_iso \to Grpd_iso, but in general we need to consider P:C isonGrpd isoP: C_iso \to n Grpd_iso or P:C isoGrpd isoP: C_iso \to \infty Grpd_iso to study higher forms of nn-stuff.

Lest we forget, to be even more simple than an extra property, the groupoid of (2)(-2)-groupoids is the point ptpt, and there is exactly one functor PP from any C isoC_iso to ptpt, corresponding to the unique (up to equivalence) category equivalent to CC.

For the (∞,1)-topos ∞-Grpd of ∞-groupoids the analog of the subobject classifier is the universal fibration of (∞,1)-categories Z| GrpdGrpdZ|_{\infty Grpd} \to \infty Grpd. See also section 6.1.6 \infty-Topoi and Classifying objects of HTT.

Formulation in homotopy type theory

A map between homotopy types is equivalent to a dependent sum projection f: x:AB(x)Af: \sum_{x: A} B(x) \to A. If the types B(x)B(x) are n-types, ff forgets nn-stuff.

References

The original proposal for formalizing notions of mathematical structures via category theory, specifically via the forgetful functors between the groupoids which they form:

Exposition and re-amplification:

For modern accounts on mathematical structures via categorical algebra see also at algebraic theory, monad, sketch.

Last revised on February 1, 2024 at 01:08:27. See the history of this page for a list of all contributions to it.