Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.


Even for the novice it seems comprehensible that the "inner structure" of an object is determined (up to isomorphism) by its "position" in a category, defined by the morphisms.

What is not so obvious is how the inner structure of an object can be recovered from its position.


What has to be given (and how) to reconstruct the inner structure of an object (up to isomorphism)? What conditions must the category fulfill? And how could the reconstruction be systematically achieved?


The following examples are simple in the sense that the categories are especially tailored: the objects are finite, there are no isomorphisms (except the identities) and all hom-sets contain at most one element. The question is, whether similar reconstructions can succeed in the general case, too.


Consider the category of "unlabeled" finite sets (vulgo natural numbers with a sequence of Hilbert-strokes as "inner structure") with the $\leq$ relations as morphisms ($\leq$ means "injectively embeddable", the number of possible embeddings ignored). Now consider only identities and prime morphisms (see my definition), corresponding to the relation $x = y + 1$ ("x is reachable from y by adding one stroke").

It is easy to "see" the inner structure from the position of an object with respect to the initial object (the empty set).


Consider the category of finite undirected unlabeled graphs without isolated vertices. The morphisms correspond to the relation "is edge-wise incidence-preserving embeddable" (ignoring again the number of possible embeddings). Consider again only identities and prime morphisms, corresponding to the relation "x is reachable from y by adding one edge".

See a fragment of this category here (identities and arrow heads not displayed).

Conjecture: Each object in this category is uniquely determined by the tuple $(n,k,l)$ with $n$ its distance from the initial object (the empty graph), $k$ its number of in-going morphisms and $l$ its number of out-going morphisms.

Claim: The inner structure of each object up to distance 3 from the initial object can be systematically deduced from its position, considering (only?) its tuple $(n,k,l)$.

Observation: This category reflects something like the "generating lattice" of the graphs (each non-identity morphism corresponds to adding one edge). Which other categories can be interpreted in this way?

share|improve this question

closed as not a real question by Reid Barton, Charles Siegel, S. Carnahan, Qiaochu Yuan, Pete L. Clark Jan 4 '10 at 22:00

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

I'm voting to close because this question is very vague. I can't guess what you have in mind when you say "inner structure", "systematically deduced", "position in the category". In general there is no notion of "inner structure" of objects in a category. –  Reid Barton Jan 4 '10 at 15:09
That said maybe the Yoneda lemma is the answer to your question. –  Reid Barton Jan 4 '10 at 15:10
I'm abstaining on closing, but I too find this question very confusing. –  José Figueroa-O'Farrill Jan 4 '10 at 15:33
@Joel: See, that's the problem--I thought the question was something completely different like "given an object of a category, how/under what conditions on the category can I reconstruct the object (in terms of some external description of the category) from its maps to and from other objects?" –  Reid Barton Jan 4 '10 at 16:46
I'm going to close this up, but please feel free to try again with a more precise, clearly defined question. –  Pete L. Clark Jan 4 '10 at 22:00

1 Answer 1

The commentary notwithstanding, do make sure to carefully grok Yoneda's Lemma, which says that you can fully recover an object (up to isomorphism) by understanding its Hom sets. Ravi Vakil explained it via a physics analogy: To understand an object (particle), you measure how it behaves when you throw other objects (incoming morphisms) at it.

share|improve this answer
What does "recover" mean precisely? –  Hans Stricker Jan 20 '10 at 20:57

Not the answer you're looking for? Browse other questions tagged or ask your own question.