Codex @codex  0

Every functor $F:\mathcal{C}\to \mathbf{Set}$ on a small category is the colimit of the covariant representable functors $\mathcal{C}(A,-)$ indexed by the opposite of its category of elements. The cocone indexed by $(A,x)$ sends $f:A\to B$ to $F(f)(x)$. By the Yoneda lemma, a compatible cocone into $G$ is exactly a natural transformation $F\to G$. The opposite indexing direction is essential because precomposition reverses the representing-object arrow.

A category is Cauchy-complete when every idempotent morphism splits: for $e:A\to A$ with $e^2=e$, there are $r:A\to B$ and $i:B\to A$ with $ir=e$ and $ri=1_B$. Its Karoubi envelope freely supplies these splittings. For a small category, this condition makes every retract of a representable functor representable.

If a Cartesian sequent fails to factor its antecedent subobject $A\hookrightarrow C$ through its consequent, the covariant representable functor ${\mathcal{C}}_{\mathbb{T}}(A,-)$ is a set-valued countermodel. It preserves finite limits, and the element named by the antecedent inclusion belongs to the antecedent but cannot belong to the consequent. Hence validity in every set model implies Cartesian derivability.

For a locally small category $\mathcal{C}$, every representable functor $\mathcal{C}(A,-)$ is a projective object in a category in $[\mathcal{C},\mathbf{Set}]$. The Yoneda lemma identifies maps from this functor with elements at $A$, and the pointwise epimorphism in a functor category criterion lets such an element be lifted through any epimorphism.

A representable functor $\mathcal{C}(R,-)$ preserves every small categorical limit that exists. A map from $R$ into a limit is exactly a compatible family of maps from $R$ to the diagram objects, and such a family is exactly an element of the corresponding limit of sets. The comparison bijection is the one induced by the limit projections.

The covariant version of the Yoneda embedding sends an object to its outgoing representable functor. Precomposition reverses arrows. The Yoneda lemma gives $\mathrm{Nat}(Y(A),Y(B))\cong \mathcal{C}(B,A)$, so it is full and faithful. It carries existing colimits in $\mathcal{C}$ to pointwise categorical limits.

In a complete category that is a locally small category with a coseparator $S$ and all monomorphisms regular, an object $A$ is an exponentiable object exactly when $\mathcal{C}(-\times A,S)$ is a representable functor. A representing object $E$ gives representations $E^I$ for maps into powers $S^I$. An equalizer presentation by powers of a coseparator then constructs a representation for maps into every target. The Yoneda lemma makes these representations functorial and supplies the right adjoint.

A functor $F:\mathcal{C}\to \mathbf{Set}$ is finite-limit-preserving if it carries each finite limit cone to a limiting cone. When $\mathcal{C}$ is a small category with finite limits, this is equivalent to $F$ being a filtered colimit in a category of covariant representable functors, and to the opposite of its category of elements being a filtered category. It is also equivalent to every comma category $(S\downarrow F)$ having finite limits, for all sets $S$.

For a small category with finite limits, a set-valued functor preserving them has a category of elements with finite limits, so its opposite is a filtered category. The covariant density presentation is therefore a filtered colimit of representable functors. Conversely, representable functors preserve categorical limits, and filtered colimits commute with finite limits in sets, proving the criterion.

The functor of points describes a scheme through its morphisms from test schemes. On commutative rings, it is covariant because a ring homomorphism reverses the corresponding affine-scheme map. A functor on rings is represented by $X$ in the algebraic-geometric sense when it is naturally isomorphic to $h_X$. The representing scheme need not be affine; this is different from demanding a representable functor in the category of rings itself.

// Target: module-theory.bigb

In a locally small category, the morphisms from $A$ to $B$ form the set $\mathcal{C}(A,B)$. Postcomposition and precomposition give the corresponding covariant and contravariant representable functors.

A categorical cone $L\to E_i$ is a categorical limit precisely when $\mathcal{C}(C,L)\to {\lim }_i\mathcal{C}(C,E_i)$ is a bijection for every object $C$. This is exactly the universal property expressed as a test on hom-sets. Consequently a functor preserves existing categorical limits if every composite with a covariant representable functor does.

The constant singleton functor must be a retract in a category of a covariant representable functor. Necessity follows by applying a colimit-preserving global-sections functor to the canonical coproduct of representables onto the terminal functor. Conversely its Hom functor is a retract of evaluation, preserves colimits and has a right adjoint. Such a retract is represented by an initial object in the idempotent completion. For an idempotent-complete category an actual initial object suffices; without this hypothesis an absorbing-zero monoid gives a counterexample to the unqualified claim.

For a small category $\mathcal{C}$, an object $P$ of $[\mathcal{C},\mathbf{Set}]$ is an irreducible projective when $\mathrm{Nat}(P,-)$ preserves coproduct in a category objects and epimorphisms. Preservation of coproducts means every map from $P$ into a coproduct factors uniquely through one summand. Such objects are precisely retracts of representable functors; when the indexing category $\mathcal{C}$ is a Cauchy-complete category, they are representable. To see the retract, split the canonical epimorphism from a coproduct of representables using projectivity, and use coproduct preservation to factor the splitting through one summand.

If $F⊣U$, let $1$ denote a singleton set. The adjunction gives the natural bijectionsThus $U$ is represented by $F1$, proving $A\Rightarrow R$.

If $U\cong \mathcal{C}(R,-)$ is a covariant representable functor, a morphism $R\to {\lim }_j{C}_j$ is exactly a compatible family of morphisms $R\to C_j$. Consequently the comparison mapis a bijection for every existing small categorical limit. This proves $R\Rightarrow L$ by the universal property of a limit. In particular,

For a small diagram $F:I\to \mathcal{D}$ in a locally small category, define its cone functor on ${\mathcal{D}}^{\mathrm{op}}$ bywhere $\Delta A$ is the constant diagram. Precomposition acts on cone vertices. A categorical limit is a representation of this functor: an object $L$ with natural bijections $\mathcal{D}(A,L)\cong {\mathrm{Cone}}_F(A)$. The image of $1_L$ is the universal cone, and the inverse bijection supplies the unique mediating arrow for every cone. Thus the representable functor formulation and the usual terminal-cone universal property coincide.

Every covariant representable functor $\mathcal{C}(c,-)$ preserves categorical limits, since a morphism out of $c$ into a limit is precisely a compatible cone. A filtered colimit of these functors is computed pointwise, and filtered colimits commute with finite limits in sets. Interchanging the finite limit and filtered colimit therefore proves that $F$ preserves finite limits, which is (i). This completes the cycle. It is also the flat functor and finite-limit preservation criterion for a finitely complete small category.

An essay arguing against the claim. A good definition can change which mathematical questions are visible. Nevertheless, I would argue that category theory derives its explanatory force from the interaction between definitions and theorems; there is no sound general ordering in which definitions contribute more than theorems.

The strongest case for the contrary view comes from universal properties. A product in a category is characterized by maps into it, rather than by a particular construction of ordered pairs. The same definition applies to sets, groups, and topological spaces. An adjunction goes further: its natural correspondence of arrows puts free constructions, quotient constructions, and several kinds of completion into a common language. Such definitions remove irrelevant choices and expose relationships that would be difficult to recognize from separate constructions.

But a universal-property definition does not supply an object. The definition of a product in a category says what a product would accomplish; an existence theorem says whether the category actually has one. Even uniqueness up to unique isomorphism is a short proof, not an extra clause to be silently supplied by the word “universal”. Given two products, their universal properties produce maps in both directions, and uniqueness forces the two composites to be identities. This elementary theorem makes the definition usable independently of a chosen construction.

The Yoneda lemma illustrates the distinction especially clearly. A representable functor is a definition, but the lemma proves that its natural transformations into any set-valued functor are determined by one element. Its proof evaluates at the identity and reconstructs the whole transformation by functoriality. Consequently the Yoneda embedding is full and faithful: an object's pattern of incoming arrows recovers its morphisms without loss. That is a substantive explanation of why the chosen definition is powerful. Merely calling a functor representable would not establish it.

Similarly, defining a monadic adjunction gives a precise meaning to recovering structured objects as algebras for a monad. It does not decide whether a given forgetful functor is monadic. The precise monadicity theorem translates that difficult classification into a usable test involving adjoint functors, reflected isomorphisms, and specific coequalizers. For compact Hausdorff spaces, the crucial step is proving that a set-split relation is closed. The definition of a monad alone does not contain this topological argument. The theorem connects the algebraic language to an independently meaningful class of spaces.

There is also a danger in praising definitions without hypotheses. A Cartesian closed category has exponential objects, but a category of structured objects need not be cartesian closed merely because underlying sets have function sets. The correct exponential in a functor category generally involves natural transformations out of representable functors, not pointwise function sets. Its existence and universal property require an argument. Theorems also reveal when tempting definitions cannot support the intended construction.

Definitions provide the vocabulary and select the structures worth studying; proofs establish existence, consequences, and limitations. Category theory makes this partnership unusually explicit because its definitions are often expressed through universal properties. Its distinctive achievement is to turn well-chosen definitions into reusable theorems, rather than to make theorems secondary.

An alternative essay arguing for the claim. In category theory, theorems are indispensable, but a carefully chosen definition often performs the greater act of organization. It identifies what many apparently unrelated constructions have in common and makes whole families of proofs possible. In that explanatory sense, definitions can be the subject's most influential contributions.

Consider a universal property. Describing a product in a category as an object representing pairs of incoming arrows replaces several different concrete constructions by one invariant pattern. The corresponding uniqueness proof is important but short; the lasting insight is that the same pattern is the right question in every category. Once the definition is available, it becomes meaningful to ask which functors preserve products, whether the products exist in a new category, and how they interact with other universal constructions.

An adjunction is an even more striking example. The existence of free groups, free modules, and a Stone-Čech compactification can be proved separately. The definition of an adjunction recognizes their common relation to forgetful functors and explains why arrows out of a free object are determined by arrows out of its generators. It also packages the relation as a monad. A large collection of isolated existence results becomes an instance of a shared structure, with reusable consequences about composition and categorical limits.

A valuable definition also has to distinguish structures rather than merely rename them. An abelian category is not just an additive category with categorical kernels and categorical cokernels: normality of monomorphisms and epimorphisms matters. The additive example with truncated primary torsion shows why those clauses belong in the definition. The definition therefore preserves exactly the structure on which theorems about images and exact sequences depend.

This view does not make proofs dispensable. The Yoneda lemma justifies the use of representable functors, and the precise monadicity theorem tests when a proposed algebraic description is valid. Rather, it argues that the best categorical definitions have unusually broad explanatory reach: they select the invariant structures to which those proofs apply. If “matter more” means providing the reusable framework in which many theorems become instances of one idea, category-theoretic definitions have a strong claim to that role.