Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The hom-functor turns a coend into an end and carries an end to an end

Statement

Let C be small (Small, locally small, and large categories), let D be locally small, let T:Cop×CD be a functor and let X be an object of D (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

From a coend to an end. Write H:Cop×CSet for the functor H(a,b):=D(T(b,a),X), whose action on a morphism (g,h) of the product category is precomposition with T(h,g), so that H(c,c)=D(T(c,c),X). If T has a coend (The end and the coend of a functor Cop×CD), then the hom-functor turns a coend into an end: H has an end and

D(cT(c,c),X)    cD(T(c,c),X).

From an end to an end. If T has an end, then D(X,) carries it to an end of D(X,T(,)), so

D(X,cT(c,c))    cD(X,T(c,c)).

Facts & Assumptions

Given: A small C, a locally small D, a functor T on Cop×C with values in D, and an object X of D.

[F5]

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

[F1]

The objects of Tw(C) are the morphisms of C, and a morphism fg is a pair (a,b) of morphisms of C with bfa=g (The twisted arrow category and its projection to Cop×C).

[F2]

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

[F4]

The hom-assignment sends (a,b) to C(a,b), and a morphism of the product category consisting of h:aa and u:bb acts by C(h,u):C(a,b)C(a,b),fufh (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[L4]

The wedges over a functor are exactly the cones over its composite with the twisted arrow projection, and the cowedges are the cocones under the composite with the swapped projection, so an end is the limit over the twisted arrow category and a coend a colimit over its opposite (An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite).

[L1]

For every object X of a locally small category and every small diagram D with a colimit there is a natural bijection C(colimD,X)limjJopC(D(j),X). (Hom(X,−) is continuous, while Hom(−,X) sends every existing small colimit to a limit of sets).

[L2]

For every object X of a locally small category C, the covariant hom-functor C(X,) preserves all small limits that exist (Hom(X,−) is continuous, while Hom(−,X) sends every existing small colimit to a limit of sets).

[L3]

If F preserves Tw(C)-limits and T has an end, then F of that end is an end of FT, so a functor preserving twisted-arrow limits preserves ends (A functor preserving twisted-arrow limits preserves ends, and dually for coends).

[F3]

An end of T is a terminal object of the category of wedges over T and a coend an initial object of the category of cowedges under T; in short, an end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor Cop×CD).

Proof

technique · direct
1.1

Since C is small, Tw(C) is small and so is its opposite, so the coend of T is the colimit of a small diagram; and (Tw(C)op)op=Tw(C) strictly. Moreover H is a functor, because precomposition with T(h,g) is functorial in (g,h) by the displayed action of [F4] read in D, and for f:cc its composite with the twisted arrow projection has value H(c,c)=D(T(c,c),X), which is D applied to the value of the swapped projection at f.

F1F2F4F5
2.1

Apply [L1] to the small diagram whose colimit is the coend, indexed by Tw(C)op: it gives a bijection between D(cT(c,c),X) and the limit over Tw(C) of the diagram identified in step 1.1, which is the composite of H with the twisted arrow projection. By [L4] read in the direction from limits to ends, that limit is an end of H, so H has an end and the displayed bijection is the first assertion.

F2F3L1L4step 1.1
3.1

For the second assertion, [L2] says D(X,) preserves all small limits that exist, and Tw(C)-limits are small by step 1.1, so D(X,) preserves them; by [L3] it therefore carries an end of T to an end of D(X,T(,)), which is the displayed bijection.

F3L2L3step 1.1

Remarks

The two clauses are not the same statement read twice. The covariant hom-functor is continuous and so preserves ends; the contravariant one turns colimits into limits, and so turns a coend into an end, changing the shape of the universal object rather than preserving it. Only the second clause is an instance of preservation.

Local smallness of D is what makes both right-hand sides Set-valued, and smallness of C is what makes the diagram indexed by Tw(C) small, which is the hypothesis the published statement about colimits carries. Neither can simply be dropped.

Depends on

Used by

Nothing in the library uses this result yet.

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