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.
Wedges and cowedges, and the categories they form
Definition
Let be a functor (Product category and its projection functors, Opposite category ) and let be an object of (Category, object, morphism, domain, codomain, identity, composition, and hom-collection). Write for the constant functor on at (Constant diagrams, cones, cocones, and their morphisms), which sends every object to and every morphism to .
A wedge from to is a dinatural transformation from a constant functor to (Dinatural transformation between functors on ), that is, a family
such that every satisfies the wedge equation
between morphisms . Dually, a cowedge from to is a dinatural transformation from to a constant functor, that is, a family
such that every satisfies the cowedge equation
between morphisms . The object is the vertex of the wedge or cowedge, and , are its components.
A morphism of wedges is a morphism of satisfying for every object ; a morphism of cowedges is a morphism satisfying for every . Identities of are morphisms of wedges and of cowedges, and a composite of two such morphisms again satisfies the displayed equation, so wedges over and their morphisms form a category , and cowedges under and their morphisms form a category ; associativity and the identity laws are inherited from .
Remarks
The wedge and cowedge equations are the hexagon of Dinatural transformation between functors on with one side made constant. For a wedge the source is , so both and are and drop out; for a cowedge the target is and the two outer morphisms on the target side drop out instead.
A wedge is not a cone over a diagram indexed by : its components sit at the diagonal values and its equation involves the two off-diagonal values , whereas a cone (Constant diagrams, cones, cocones, and their morphisms) has one component per object of the index category and one equation per morphism, with no off-diagonal term. The precise comparison between the two shapes is An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite, which replaces the index category by another one.
Depends on
- Dinatural transformation between functors on $\mathcal C^{\mathrm{op}}\times\mathcal C$
- Constant diagrams, cones, cocones, and their morphisms
- Category, object, morphism, domain, codomain, identity, composition, and hom-collection
- Product category and its projection functors
- Opposite category $\mathcal C^{\mathrm{op}}$
Used by
- Ends and coends with parameters Definition
- The end and the coend of a functor CᵒᵖtimesCtoD Definition
- Evaluation of functions is dinatural in its argument set Example
- FALSE: every functor on CᵒᵖtimesC has an end False statement
- A wedge on a product index category is exactly a family dinatural in each variable separately Lemma
- The end of a functor made mute in its contravariant variable is the ordinary limit of that functor Proposition
- A chosen family of ends is the object part of exactly one functor making the counit natural in the parameters Theorem
- A coend is a colimit weighted by the hom-bifunctor, and an end a limit weighted by it Theorem
- A family into a parametrised end is natural, or dinatural, in the parameter exactly when its composite with the counit is Theorem
- A module-valued coend is the direct sum of the diagonal values modulo the dinaturality submodule Theorem
- A natural transformation of functors induces a unique morphism of their ends and of their coends Theorem
- A weighted limit is an end of powers and a weighted colimit a coend of copowers Theorem
- An end and a coend are unique up to a unique isomorphism compatible with every component Theorem
- An end is a limit over the twisted arrow category, and a coend is a colimit over its opposite Theorem
- An end is the equalizer of two products, and a coend the coequalizer of two coproducts Theorem
- For a small source category, the set of natural transformations is an end of the hom-bifunctor of the values Theorem
- Fubini: an end over a product index category and the two iterated ends exist together and agree Theorem
- The co-Yoneda isomorphisms: a set-valued functor is a coend against a representable Theorem
- The end of the function-set functor on a representable is evaluation Theorem
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
- F. Loregian, (Co)end Calculus (arXiv:1501.02503v7), Definition 1.1.4 and Remark 1.1.5 (standard reference, not scraped)
- B. Richter, From Categories to Homotopy Theory (author's draft), §4.4 (standard reference, not scraped)