Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-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 natural transformation of functors induces a unique morphism of their ends and of their coends

Statement

Let P,P:Cop×CD be functors and let η:PP be a natural transformation (Natural transformation and its components); a wedge is a dinatural transformation from a constant functor (Dinatural transformation between functors on Cop×C).

If P and P have ends (e,ω) and (e,ω) (The end and the coend of a functor Cop×CD), then a natural transformation induces a unique morphism of ends: there is exactly one morphism η:ee satisfying

ωcη=ηc,cωcfor every object c.

If P and P have coends (q,ρ) and (q,ρ), there is exactly one morphism η:qq satisfying ηρc=ρcηc,c for every c.

Moreover 1P=1e, and (ηη)=ηη whenever η:PP and η:PP are natural and all three ends exist.

Facts & Assumptions

Given: Functors P,P:Cop×CD, a natural transformation η:PP, and ends and coends of P and of P where these are asserted to exist.

[F1]

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, and the universal property says that every wedge factors through the end by exactly one morphism (The end and the coend of a functor Cop×CD).

[F2]

A wedge from d to T is a dinatural transformation from a constant functor to T: a family ωc:dT(c,c) with T(1c,f)ωc=T(f,1c)ωc for every f:cc; dually a cowedge from T to d is a family ρc:T(c,c)d with ρcT(f,1c)=ρcT(1c,f) (Wedges and cowedges, and the categories they form).

[F3]

A natural transformation α:FG is a family αA:FAGA such that every f:AB satisfies the naturality equation GfαA=αBFf (Natural transformation and its components).

[F4]

A dinatural transformation α:PQ is a family αc:P(c,c)Q(c,c) such that every f:cc satisfies Q(1c,f)αcP(f,1c)=Q(f,1c)αcP(1c,f), the equation displayed by the hexagon (Dinatural transformation between functors on Cop×C).

Proof

technique · direct
1.1

The family ηc,cωc:eP(c,c) is a wedge from e to P: naturality of η at (1c,f):(c,c)(c,c) gives P(1c,f)ηc,c=ηc,cP(1c,f), naturality at (f,1c):(c,c)(c,c) gives P(f,1c)ηc,c=ηc,cP(f,1c), and the wedge equation for ω gives P(1c,f)ωc=P(f,1c)ωc, so both sides of the wedge equation for ηc,cωc equal ηc,c composed with that common morphism.

F2F3F4
2.1

Since (e,ω) is a terminal wedge, the wedge of step 1.1 factors through it by exactly one morphism, which is the asserted η:ee with ωcη=ηc,cωc for every c.

F1step 1.1
3.1

Taking P=P, η=1P and (e,ω)=(e,ω), the identity of e satisfies the defining equation of step 2.1, and that equation has exactly one solution, so 1P=1e.

F1step 2.1
3.2

For η:PP and η:PP with all three ends present, both ηη and (ηη) satisfy ωc()=ηc,cηc,cωc, and that equation has exactly one solution, so the two agree.

F1step 2.1
4.1

For coends, the family ρcηc,c:P(c,c)q is a cowedge under P: naturality of η at (f,1c):(c,c)(c,c) and at (1c,f):(c,c)(c,c) rewrites both sides of its cowedge equation as ρcP(f,1c)ηc,c and ρcP(1c,f)ηc,c, which agree by the cowedge equation for ρ; initiality of (q,ρ) then gives exactly one η:qq with ηρc=ρcηc,c. The induced morphism runs from the coend of P to the coend of P, in the same direction as η, and the argument is written out here rather than left to duality because the universal property used is initiality rather than terminality.

F1step 1.1step 2.1

Remarks

The two functor laws in steps 3.1 and 3.2 are proved from uniqueness alone and use nothing about η beyond its defining equation. So on any full subcategory of functors all of whose objects have a chosen end, the assignment Pe with ηη is a functor; making that statement precise for a family of parameters, where the choice has to be made for every parameter value at once, is A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters.

Depends on

Used by

Dependency tree · two levels

10 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