Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it

Statement

Let J be small, let M be locally small (Small, locally small, and large categories) and let F:JM be a diagram.

Limit clause. Let W:JSet be a weight, let W be its category of elements (The category of elements of a covariant functor or a presheaf) and let π:WJ be the projection (c,x)c. Then a weighted limit is an ordinary limit over the category of elements of the weight (Set-weighted limits and colimits, Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties): the cones over Fπ with apex m are exactly the natural transformations WM(m,F), so {W,F} exists exactly when limWFπ does and then {W,F}=limWFπ.

Colimit clause. Let W:JopSet be a weight (Opposite category Cop), let W be its category of elements, whose morphisms (c,x)(d,y) are the f:cd of J with x=W(f)(y), and let π again be the projection. Then a weighted colimit is an ordinary colimit over it: the cocones under Fπ with apex m are exactly the natural transformations WM(F,m), so WF exists exactly when colimWFπ does and then WF=colimWFπ.

Both clauses use the published category of elements as it stands, with no opposite inserted, and if J is small then W is small.

Facts & Assumptions

Given: A small J, a locally small M, a diagram F:JM, and a weight W of the variance named in each clause.

[F1]

A weighted limit {W,F} is an object that represents the functor sending an object to the set of natural transformations from the weight, that is M(m,{W,F})[J,Set](W,M(m,F)) naturally in m; the weighted colimit is characterised by M(WF,m)[Jop,Set](W,M(F,m)) (Set-weighted limits and colimits).

[F2]

The category of elements G of a functor G:CSet has objects (c,x) with cC and xG(c); its identities and composition are those of C (The category of elements of a covariant functor or a presheaf).

[F3]

For a covariant G, a morphism (c,x)(d,y) of G is a morphism f:cd in C satisfying G(f)(x)=y (The category of elements of a covariant functor or a presheaf).

[F11]

For a presheaf P, a morphism (c,x)(d,y) of P is a morphism f:cd in C satisfying x=P(f)(y). (The category of elements of a covariant functor or a presheaf).

[F4]

A cone over D:JC with apex c is a family λj:cD(j) satisfying D(u)λj=λk for u:jk, and a morphism of cones is h with λjh=λj (Constant diagrams, cones, cocones, and their morphisms).

[F9]

A cocone under D with apex c is a family ρj:D(j)c satisfying ρkD(u)=ρj for u:jk (Constant diagrams, cones, cocones, and their morphisms).

[F5]

A limit is a terminal cone: explicitly, for every cone (X,ξ) there exists a unique morphism u:XL such that λju=ξj for every j (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F10]

A colimit is an initial cocone: explicitly, for every cocone (X,ξ) there exists a unique morphism u:QX such that uρj=ξj for every j. (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F6]

The covariant hom-assignment sends u:bc to u:C(a,b)C(a,c),fuf (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[F12]

The contravariant hom-assignment sends u:bc to u:C(c,a)C(b,a),ggu. (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[F7]

The opposite category has the same objects and reverses every morphism: Cop(A,B)=C(B,A) (Opposite category Cop).

[F8]

A category is small when both Ob(C) and Mor(C) are sets. (Small, locally small, and large categories).

[L1]

Two representing objects of one functor are joined by a unique compatible isomorphism: There is a unique isomorphism i:RR satisfying the compatibility equation with the universal elements (Representing objects are unique up to a unique isomorphism compatible with their universal elements).

Proof

technique · direct
1.1

Fix m. A natural transformation α:WM(m,F) assigns to each object c of J a function αc:W(c)M(m,Fc). A cone over Fπ with apex m assigns to each object (c,x) of W a morphism λ(c,x):mF(c), since Fπ(c,x)=F(c). So both are families of morphisms mF(c) indexed by the pairs (c,x) with xW(c).

F1F2F6F7
1.2

If J is small then W is small. Its objects are the pairs (c,x) with c in the set Ob(J) and x in the set W(c), so they form a set; and a morphism of W carries its domain, its codomain and the underlying morphism of J, so the morphisms form a subclass of Ob(W)×Ob(W)×Mor(J) and hence a set. No choice is used.

F2F3F8given
2.1

Setting λ(c,x):=αc(x) matches the two families of step 1.1 bijectively, and it matches the two conditions as well. Naturality of α at f:cd says F(f)αc(x)=αd(W(f)(x)) for every xW(c). A morphism (c,x)(d,y) of W is an f:cd with W(f)(x)=y, and the cone condition at it says F(f)λ(c,x)=λ(d,y). Substituting y=W(f)(x) makes these the same equation, so the two conditions are one equation and not merely equivalent ones.

F2F3F4step 1.1
3.1

The bijection of step 2.1 is natural in m: precomposing every λ(c,x) with h:mm corresponds to postcomposing every αc with M(h,Fc), and it carries a morphism of cones to a morphism of the transformations and back. So a terminal cone over Fπ is exactly a representing object for m[J,Set](W,M(m,F)); by [F1] and [F5] the weighted limit exists exactly when the ordinary limit does and the two are the same object, unique by [L1].

F1F4F5L1step 2.1
3.2

For the colimit clause the same matching is made in the other variance. A cocone under Fπ with apex m assigns λ(c,x):F(c)m to every object of W and satisfies λ(d,y)F(f)=λ(c,x) for every morphism (c,x)(d,y), which by [F11] is an f:cd of J with x=W(f)(y). A natural transformation α:WM(F,m) of presheaves on J assigns αc:W(c)M(Fc,m) and its naturality equation at f reads αc(W(f)(y))=αd(y)F(f) for yW(d). Setting λ(c,x):=αc(x) and substituting x=W(f)(y) makes the two families and the two equations the same.

F7F9F11F12step 2.1
4.1

The bijection of step 3.2 is natural in m by the same computation with postcomposition in place of precomposition, so an initial cocone under Fπ is exactly a representing object for m[Jop,Set](W,M(F,m)): the weighted colimit exists exactly when the ordinary colimit over W does, and then they agree.

F1F10L1step 3.2

Remarks

The published category of elements is used exactly as defined, with no opposite inserted. Its projection to J is covariant in both the covariant and the presheaf case, and the colimit is taken over W itself. A source that forms the category of elements of the weight viewed as a covariant functor on Jop will write "the opposite category of elements" for the same category read backwards; inserting an op here to match that phrase would reverse the variance and make the statement false.

No choice principle is used. What is matched at every step is a whole family against a whole family, and at no point is an element of any W(c) selected. The smallness count of step 1.2 is recorded because the existence corollary for weighted limits spends exactly it.

Depends on

Used by

Dependency tree · two levels

22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources