Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 module-valued coend computed as a quotient of a direct sum

Example

Let C be the walking arrow with objects 0 and 1 and one non-identity morphism u:01, and work in Z-Mod. Define a functor T:Cop×CZ-Mod by

T(0,0)=T(1,1)=T(1,0)=Z,T(0,1)=0,

with T(u,10):ZZ multiplication by 2, T(11,u):ZZ multiplication by 3, and every map whose codomain is 0 the zero homomorphism.

Then the coend is computed by one generator:

cT(c,c)    (ZZ)/(2,3)    Z,

and under this identification the two cowedge components are multiplication by 3 from T(0,0) and multiplication by 2 from T(1,1).

Facts & Assumptions

Given: The walking-arrow index category and the functor T displayed above.

[L1]

A module-valued coend is the direct sum of the diagonal values modulo the dinaturality submodule (A module-valued coend is the direct sum of the diagonal values modulo the dinaturality submodule).

[F1]

A direct sum is formed with coordinate inclusions, and the empty direct sum is the zero module (The direct sum of an indexed family of modules).

[F2]

For a submodule NM, the quotient module M/N has cosets as elements and scalar multiplication r(m+N):=rm+N (Quotient module M/N with scalar multiplication on additive cosets).

[F3]

For a fixed ring R, left R-modules and module homomorphisms form a large locally small category R-Mod (Left modules over a fixed ring and module homomorphisms form the large locally small category R-Mod).

[F4]

An end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor Cop×CD).

Verification

technique · direct
1.1

The displayed data define a functor into Z-modules: the only non-identity square in Cop×C with nontrivial source factors through the slot (1,0), and its codomain is (0,1), where every structure map is the zero homomorphism, so the square commutes automatically.

F3given
2.1

By [L1] the coend is the direct sum of the two diagonal values modulo the submodule generated by the dinaturality differences coming from the off-diagonal value T(1,0)=Z. Here the direct sum is ZZ, and for nZ the generator contributed by u is ȷ0(T(u,10)(n))ȷ1(T(11,u)(n))=(2n,3n); the identity morphisms contribute only (0,0). So the coend is Q:=(ZZ)/(2,3).

L1F1step 1.1
3.1

The homomorphism q:ZZZ, (a,b)3a+2b, kills (2,3) and so descends, by [F2], to a homomorphism qˉ:QZ. If 3a+2b=0, then 3a=2b, so 3 divides b and 2 divides a; writing a=2k and b=3k shows kerq=(2,3). Hence qˉ is an isomorphism, and under it the two quotient cowedge components are multiplication by 3 and by 2.

L1F2step 2.1
4.1

On the nontrivial test module Z, a cowedge λ0,λ1:ZZ is determined by the integers a:=λ0(1) and b:=λ1(1), and the cowedge equation at u is 2a=3b. So a=3t and b=2t for a unique tZ, and multiplication by t on QZ is the unique homomorphism factoring the cowedge through the displayed quotient. This is exactly the initial-cowedge property on that test module.

F4step 3.1

Remarks

Richter's module example is general; this one chooses the maps 2 and 3 so that the quotient can be identified explicitly with Z. The point is not the particular integers but the shape of the computation: the coend is a quotient of a direct sum by the dinaturality submodule.

The off-diagonal zero slot keeps the functoriality check finite. It makes every square landing in (0,1) trivial, so the whole example reduces to one off-diagonal module and one generator of the relation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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