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.
Induction and coinduction of permutation representations as Kan extensions
Example
Let be a subgroup inclusion, and view and as one-object categories (A monoid is a one-object category, and a group is a one-object category in which every morphism is invertible). A functor is then a permutation representation of .
The left Kan extension of along is the induced -set , and the right Kan extension is the coinduced -set .
Facts & Assumptions
Given: A subgroup inclusion and an -set , regarded as a functor .
A group may be regarded as a one-object category, and a subgroup inclusion is then a functor between such categories (A monoid is a one-object category, and a group is a one-object category in which every morphism is invertible, Covariant functor, identity functor, composite functor, and contravariant functor).
The comma-category colimit and limit formulae compute left and right Kan extensions (Comma-category limit and colimit formulae compute Kan extensions).
Every small Set-valued diagram has a colimit given by the quotient of its tagged union by the relations generated by its structure maps, and a limit given by its set of compatible tuples (Set has all small colimits, realized as a quotient of a set-indexed disjoint union, Set has all small limits, realized as compatible tuples in a set-indexed product).
Verification
In the one-object setting, an object of is just an element . A morphism from to is an element with by the comma-category equation, equivalently . So the indexing category is the action groupoid for the right -action on , and the induced diagram on sends the arrow to the map on . By [F2], its colimit is the quotient of by , equivalently by , namely . Therefore [L1] identifies the induced representation with the left Kan extension.
Dually, an object of is again an element of , and a cone to a set is exactly a family of maps indexed by that is equivariant for the -action. By [F2], the limit is therefore the set of -equivariant maps , written . Hence [L1] identifies the coinduced representation with the right Kan extension.
Depends on
- Comma-category limit and colimit formulae compute Kan extensions
- Set has all small colimits, realized as a quotient of a set-indexed disjoint union
- Set has all small limits, realized as compatible tuples in a set-indexed product
- A monoid is a one-object category, and a group is a one-object category in which every morphism is invertible
- Covariant functor, identity functor, composite functor, and contravariant functor
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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
- E. Riehl, Category Theory in Context, 2nd ed., Example 6.2.11 (standard reference, not scraped)