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 be the walking arrow with objects and and one non-identity morphism , and work in . Define a functor by
with multiplication by , multiplication by , and every map whose codomain is the zero homomorphism.
Then the coend is computed by one generator:
and under this identification the two cowedge components are multiplication by from and multiplication by from .
Facts & Assumptions
Given: The walking-arrow index category and the functor displayed above.
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).
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).
For a submodule , the quotient module has cosets as elements and scalar multiplication (Quotient module with scalar multiplication on additive cosets).
For a fixed ring , left -modules and module homomorphisms form a large locally small category (Left modules over a fixed ring and module homomorphisms form the large locally small category ).
An end is a terminal wedge and a coend an initial cowedge (The end and the coend of a functor ).
Verification
The displayed data define a functor into -modules: the only non-identity square in with nontrivial source factors through the slot , and its codomain is , where every structure map is the zero homomorphism, so the square commutes automatically.
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 . Here the direct sum is , and for the generator contributed by is ; the identity morphisms contribute only . So the coend is .
The homomorphism , , kills and so descends, by [F2], to a homomorphism . If , then , so divides and divides ; writing and shows . Hence is an isomorphism, and under it the two quotient cowedge components are multiplication by and by .
On the nontrivial test module , a cowedge is determined by the integers and , and the cowedge equation at is . So and for a unique , and multiplication by on is the unique homomorphism factoring the cowedge through the displayed quotient. This is exactly the initial-cowedge property on that test module.
Remarks
Richter's module example is general; this one chooses the maps and so that the quotient can be identified explicitly with . 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 trivial, so the whole example reduces to one off-diagonal module and one generator of the relation.
Depends on
- A module-valued coend is the direct sum of the diagonal values modulo the dinaturality submodule
- The direct sum of an indexed family of modules
- Quotient module $M/N$ with scalar multiplication on additive cosets
- Left modules over a fixed ring and module homomorphisms form the large locally small category $R\text{-}\mathbf{Mod}$
- The end and the coend of a functor $\mathcal C^{\mathrm{op}}\times\mathcal C\to\mathcal D$
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
- B. Richter, From Categories to Homotopy Theory (author's draft), Example 4.4.7 (standard reference, not scraped)