Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

Fubini: an end over a product index category and the two iterated ends exist together and agree

Statement

Let T:(C×D)op×(C×D)E be a functor, reindexed as a functor T(c1,d1,c2,d2) on Cop×Dop×C×D (Product category and its projection functors, Opposite category Cop).

Assume a chosen family of inner ends in each of the two orders (Ends and coends with parameters): an end S(c1,c2)=dT(c1,d,c2,d) for every pair of objects of C, and an end S(d1,d2)=cT(c,d1,c,d2) for every pair of objects of D, each carrying the functor structure of A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters.

Then an end over a product index category and the two iterated ends exist together and agree: the three objects

(c,d)T(c,d,c,d),cdT(c,d,c,d),dcT(c,d,c,d)

are such that if any one exists then all three do, and any two of them are joined by the unique isomorphism compatible with every component (An end and a coend are unique up to a unique isomorphism compatible with every component).

The same statement holds for coends, with a chosen family of inner coends in each order and initial cowedges throughout.

No smallness hypothesis on C or D is used or claimed.

Facts & Assumptions

Given: A functor T as displayed, together with a chosen family of inner ends in each of the two orders and their functor structures.

[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 every wedge factors through a terminal one 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; a morphism of wedges is a morphism of the vertices commuting with every component; dually for cowedges (Wedges and cowedges, and the categories they form).

[F7]

A parametrised end of T is a choice, for every object p of the parameter category, of an end taken in the two dinatural variables with the remaining variables held fixed (Ends and coends with parameters).

[F5]

The product category has objects the pairs, componentwise identities, and componentwise composition (f,g)(f,g)=(ff,gg) (Product category and its projection functors).

[F6]

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).

[F8]

A functor satisfies F(1A)=1FA,F(gf)=FgFf (Covariant functor, identity functor, composite functor, and contravariant functor).

[L1]

A family indexed by the objects of C×D is a wedge on a product index category is exactly a family dinatural in each variable separately, the two conditions being the wedge equation at (f,1d) and at (1c,g) (A wedge on a product index category is exactly a family dinatural in each variable separately).

[L2]

A chosen parametrised end carries exactly one functor structure making every counit component natural in the parameter, characterised by ωcpE(u)=T(u,1c,1c)ωcp (A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters).

[L3]

For a parameter category Qop×Q, a family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is: a family ψq:YE(q,q) is a wedge over E if and only if every ωc(q,q)ψq is a wedge over the integrand with the dinatural variables held at c (A family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is).

[L4]

Two ends of one functor are joined by exactly one isomorphism commuting with every component, and dually for coends; so an end and a coend are unique up to a unique isomorphism compatible with every component (An end and a coend are unique up to a unique isomorphism compatible with every component).

Proof

technique · direct
1.1

Under the reindexing, T is a functor of four slots, contravariant in the first two and covariant in the last two, and holding the two C-slots fixed at a pair (c1,c2) leaves a functor of the two D-slots whose chosen end is S(c1,c2), with counit θd(c1,c2) natural in the parameter (c1,c2) by [L2]. Symmetrically for S with the roles of C and D exchanged.

F2F5F6F7L2given
2.1

Fix an object X of E. Given a wedge ω from X to T, [L1] makes it dinatural in each variable separately; dinaturality in d at fixed c is exactly the wedge equation for the family (ω(c,d))d over the integrand with the C-slots held at (c,c), so by [F1] there is exactly one ψc:XS(c,c) with θd(c,c)ψc=ω(c,d) for every d. By [L3], applied with parameter category Cop×C, that family ψ is a wedge over S if and only if every θd(c,c)ψc, which is ω(c,d), is dinatural in c at fixed d — which is the other half of [L1]. Conversely a wedge ψ over S produces ω(c,d):=θd(c,c)ψc, dinatural in d because θ(c,c) is a wedge precomposed with ψc, and dinatural in c by [L3] again, hence a wedge over T by [L1].

F1F2F7L1L3step 1.1
3.1

The two assignments of step 2.1 are mutually inverse, since each ψ is the unique factorisation of the ω it produces, and ω is recovered from ψ by the defining equation. A morphism h:XX satisfies ω(c,d)h=ω(c,d) for every (c,d) exactly when it satisfies ψch=ψc for every c: one direction is composition with θd(c,c), and the other is the uniqueness in [F1]. So the wedge category of T and the wedge category of S are isomorphic over the identity on vertices, terminal objects correspond, and (c,d)T(c,d,c,d) exists exactly when cS(c,c) does, with the same vertex.

F1F2step 2.1
4.1

The same argument with the roles of C and D exchanged, applied to the chosen family S, gives that (c,d)T(c,d,c,d) exists exactly when dS(d,d) does, again with the same vertex. Hence any one of the three objects exists exactly when the others do, and by [L4] any two choices of them are joined by exactly one isomorphism commuting with every component.

F1L4step 3.1
5.1

For the coend clause, let U(x1,x2):=T(x2,x1) on objects and U(g,h):=T(h,g) on morphisms, read as a functor (C×D)op×(C×D)Eop; it satisfies the functor laws by [F8] and [F6], since reversing both the pair of slots and the direction of the target twice returns the composition order of T. Its diagonal values are those of T, and by [F2] a wedge from X to U in Eop is precisely a cowedge from T to X in E, a morphism of wedges being a morphism of cowedges reversed; so a terminal wedge over U is an initial cowedge under T, that is a coend of T. Applying steps 3.1 and 4.1 to U in Eop, with the chosen family of inner coends of T as the chosen family of inner ends of U, gives the coend clause in full.

F1F2F6F8step 3.1step 4.1

Remarks

The route is through the universal property and not through a formula. In particular the target E is not assumed to have copowers, products or any other structure, and neither index category is assumed small: what is assumed is exactly that the inner ends have been chosen, which is what the statement of the theorem says.

The reindexing in step 1.1 is part of the content and not bookkeeping. A wedge over T is indexed by the objects of C×D and constrained by its morphisms, and it is only after the source is written as Cop×Dop×C×D that the two one-variable conditions can be separated at all.

Depends on

Used by

Dependency tree · two levels

17 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