Frobenius reciprocity


Category theory

Representation theory



The term Frobenius reciprocity has a meaning

(For different statements of a similar name see the disambiguation at Frobenius theorem.)

In representation theory

In representation theory, Frobenius reciprocity (sometimes Frobenious) is the statement that the induction functor for representations of groups (or in some other algebraic categories) is left adjoint to the restriction functor. Sometimes it is used for a decategorified version of this statement as well, on characters.

Specifically for HGH \hookrightarrow G an subgroup inclusion, there is an adjunction

(IndRed):Rep GRedIndRep H (Ind \dashv Red) \;\colon\; Rep_G \stackrel{\overset{Ind}{\leftarrow}}{\underset{Red}{\longrightarrow}} Rep_H

between the categories of GG-representations and HH-representations, where for ρ\rho an HH-representation, Ind(ρ)Rep(G)Ind(\rho) \in Rep(G) is the induced representation.

Sometimes also the projection formula

Ind(Red(W)V)WInd(V) Ind(Red(W) \otimes V) \simeq W \otimes Ind(V)

is referred to as Frobenius reciprocity in representation theory (e.g. here on PlanetMath). See below the general discussion in Wirthmüller contexts.

In category theory

In category theory, Frobenius reciprocity is a condition on a pair of adjoint functors f !f *f_! \dashv f^*. If both categories are cartesian closed, then the adjunction is said to satisfy Frobenius reciprocity if the right adjoint f *:YXf^* \colon Y \to X is a cartesian closed functor; that is, if the canonical map f *(B A)f *(B) f *(A)f^*(B^A) \to f^*(B)^{f^*(A)} is an isomorphism for all objects B,AB,A of YY.

Each of the functors A-^A, f *A-^{f^*A} and f *f^* has a left adjoint, so by the calculus of mates, this condition is equivalent to asking that the canonical “projection” morphism

f !(C×f *A)(f !C)×A f_!(C \times f^*A) \to (f_! C) \times A

is an isomorphism for each AA in YY and CC in XX.

This clearly makes sense also if the categories are cartesian but not necessarily closed, and is the usual formulation found in the literature. It is equivalent to saying that the adjunction is a Hopf adjunction relative to the cartesian monoidal structures.

This terminology is most commonly used in the following situations:

  • When f *f^* and f !f_! are the inverse and direct image functors along a map ff in a hyperdoctrine. Here SS is a category and P:S opCatP \colon S^{op} \to Cat is an SS-indexed category such that each category PXP X is cartesian closed and each functor f *=Pff^* = P f has a left adjoint f\exists_f (existential quantifier, also written f !f_!). Then PP is said to satisfy Frobenius reciprocity, or the Frobenius condition , if each of the adjunctions ff *\exists_f\dashv f^* does. If the categories PXP X are cartesian but not closed then it still makes sense to ask for Frobenius reciprocity in the second form above, and in that case its logical interpretation is that x.(ϕψ)\exists x . (\phi \wedge \psi) is equivalent to (x.ϕ)ψ(\exists x.\phi) \wedge \psi if xx is not free in ψ\psi.

  • When f *f^* is the inverse image part of a geometric morphism between (n,1)-topoi and f !f_! is a left adjoint of it, if the adjunction f !f *f_!\dashv f^* satisfies Frobenius reciprocity, then the geometric morphism is called locally (n-1)-connected. In particular, if n=0n=0 so that we have a continuous map of locales, then a left adjoint f !f_! satisfying Frobenius reciprocity makes it an open map, and if n=1n=1 so that we have 1-topoi, then it is locally connected (see also open geometric morphism). This usage of “Frobenius reciprocity” is sometimes also extended to the dual situation of proper maps of locales and topoi.

In Wirthmüller contexts of six-operations yoga

Generally, an adjoint triple (f !f *f *)(f_! \dashv f^\ast \dashv f_\ast) between symmetric closed monoidal categories is called a Wirthmüller context (May 05) of six operations yoga, if f *f^\ast is a strong closed monoidal functor.


In a Wirthmüller context, the projection formula/Frobenius reciprocity holds as a natural equivalence

π¯:f !(f *(B))Bf !A \overline{\pi} \;\colon\; f_!(f^\ast(B)) \stackrel{\simeq}{\longrightarrow} B \otimes f_! A

For all A𝒳A \in \mathcal{X} and B,C𝒴B,C \in \mathcal{Y} we have by the (f !f *)(f_! \dashv f^\ast)-adjunction and the tensor\dashvhom-adjunction a commuting diagram of the form

𝒴(f !((f *B)A),C) 𝒴(π¯(A,B),C) 𝒴(Bf !A,C) 𝒳(A,[(f *B),(f *C)]) 𝒳(A,f *[B,C]). \array{ \mathcal{Y}(f_! ((f^\ast B) \otimes A),\, C) & \stackrel{ \mathcal{Y}(\overline{\pi}(A,B), C) }{ \longrightarrow } & \mathcal{Y}(B \otimes f_! A, \, C ) \\ \downarrow^{\mathrlap{\simeq}} && \downarrow^{\mathrlap{\simeq}} \\ \mathcal{X}(A, [(f^\ast B), (f^\ast C)]) &\stackrel{}{\longrightarrow}& \mathcal{X}(A, f^\ast [B,C]) } \,.

By naturality in AA and by the Yoneda lemma this shows that π¯\overline{\pi} is an equivalence precisey if f *f^\ast is strong closed.


Relation to Frobenius laws (in Frobenius algebras)

The name “Frobenius” is sometimes used to refer to other conditions on adjunctions, known as “Frobenius laws”. The formal structure of the Frobenius law appears in the notion of Frobenius algebra, in the axiom which relates multiplication to comultiplication, and recurs in another form isolated by Carboni and Walters in their studies of cartesian bicategories and bicategories of relations. Namely, if δ:1Δ\delta \colon 1 \to \otimes \Delta denotes the diagonal transformation on a cartesian bicategory (e.g., RelRel), with right adjoint δ \delta^\dagger, then there is a canonical map

δδ ϕ(1δ )(δ1)\delta \delta^\dagger \stackrel{\phi}{\to} (1 \otimes \delta^\dagger)(\delta \otimes 1)

mated to the coassociativity isomorphism

(1δ)δ(δ1)δ(1 \otimes \delta)\delta \to (\delta \otimes 1)\delta

and the Frobenius law here is the assumption that the 2-cell ϕ\phi is an isomorphism. (There are two Frobenius laws actually; the other is that a similar canonical map

δδ ϕ(δ 1)(1δ),\delta \delta^\dagger \stackrel{\phi'}{\to} (\delta^\dagger \otimes 1)(1 \otimes \delta),

mated to the inverse coassociativity, is also an isomorphism. However, it may be shown that if one of the Frobenius laws holds, then so does the other; see the article bicategory of relations.)

It is very easy to make a slip and call the Frobenius law “Frobenius reciprocity”, perhaps all the more because there are close connections between the two. One example occurs in the context of bicategories of relations, as follows.

Given a locally posetal cartesian bicategory BB and any object cc of BB, one may construct a hyperdoctrine of the form

hom B(i,c):Map(B) opSemilat\hom_B(i-, c)\colon Map(B)^{op} \to Semilat

where i:Map(B)Bi: Map(B) \to B is the inclusion, and SemilatSemilat is the 2-category of meet-semilattices. Here rhom(ib,c)r \in \hom(i b, c) is thought of as a relation from bb to cc, and for a map f:abf: a \to b, the relation f *rf^\ast r is the pulling back

f *r(afbr1)f^\ast r \coloneqq (a \stackrel{f}{\to} b \stackrel{r}{\to} 1)

along ff, and one may show that f *f^\ast- preserves finite local meets. Indeed, the pushforward or quantification along ff takes q:a1q: a \to 1 to

fq(bf aq1)\exists_f q \coloneqq (b \stackrel{f^\dagger}{\to} a \stackrel{q}{\to} 1)

and ff *\exists_f \dashv f^\ast because f f^\dagger is right adjoint to the map ff. Because f *f^\ast- is a right adjoint, it preserves local meets.

Frobenius reciprocity in this context, ordinarily written as

r fq= f(f *rq),r \wedge \exists_f q = \exists_f (f^\ast r \wedge q),

can then be restated for the hyperdoctrine hom B(i,c)\hom_B(i-, c); it takes the form

rqf =(rfq)f r \wedge q f^\dagger = (r f \wedge q)f^\dagger

for any map f:abf: a \to b and predicates qhom(a,c)q \in \hom(a, c), rhom(b,c)r \in \hom(b, c).

Meanwhile, recall that a bicategory of relations is a (locally posetal) cartesian bicategory in which the Frobenius laws hold.


Frobenius reciprocity holds in each hyperdoctrine hom B(i,c)\hom_B(i-, c) associated with a bicategory of relations.

Proof (sketch)

One first proves that a bicategory of relations is a compact closed bicategory in which each object bb is self-dual. The unit here is given by

η b=(1ε bδbb)\eta_b = (1 \stackrel{\varepsilon^\dagger}{\to} b \stackrel{\delta}{\to} b \otimes b)

and the counit by

θ b=(bbδ bε1).\theta_b = (b \otimes b \stackrel{\delta^\dagger}{\to} b \stackrel{\varepsilon}{\to} 1).

Using this duality, each relation r:bcr: b \to c has an opposite relation r op:cbr^{op} \colon c \to b given by

ccη bcbb1r1ccbθ cbb.c \stackrel{c \otimes \eta_b}{\to} c \otimes b \otimes b \stackrel{1 \otimes r \otimes 1}{\to} c \otimes c \otimes b \stackrel{\theta_c \otimes b}{\to} b.

It may further be shown that in a bicategory of relations, if f:abf: a \to b is a map, then its right adjoint f f^\dagger equals the opposite f opf^{op}. Therefore Frobenius reciprocity becomes the equation

rqf op=(rfq)f opr \wedge q f^{op} = (r f \wedge q)f^{op}

but in fact this is just a special case of the more general modular law, which holds in a bicategory of relations as shown here in a blog post by Walters. The modular law in turn depends crucially upon the Frobenius laws.

Thus, in this instance, Frobenius reciprocity follows from the Frobenius laws.


In a locally posetal cartesian bicategory, the Frobenius laws follow from Frobenius reciprocity.


Again, Frobenius reciprocity in a (locally posetal) cartesian bicategory BB means that for any map f:abf: a \to b and any two relations qB(a,c)q \in B(a, c), rB(b,c)r \in B(b, c), the canonical inclusion

(qrf)f qf r(q \wedge r f)f^\dagger \leq q f^\dagger \wedge r

is an equality. One (and therefore both) of the Frobenius laws will follow by taking the following choices for ff, qq, and rr:

f=δ x,q=ε x 1 x,r=ε x1 xε x f = \delta_x, \qquad q = \varepsilon_{x}^{\dagger} \otimes 1_x, \qquad r = \varepsilon_x \otimes 1_x \otimes \varepsilon_{x}^{\dagger}

where δ x:xxx\delta_x: x \to x \otimes x is the diagonal map and ε x:x1\varepsilon_x: x \to 1 is the projection. The remainder of the proof is best exhibited by a string diagram calculation, which is given here: Frobenius reciprocity implies the Frobenius law in a cartesian bicategory.



Generally, for H\mathbf{H} a topos and f:XYf \;\colon\; X \longrightarrow Y any morphism, then the induced base change etale geometric morphism

(f !f *f *):H /XH /Y (f_! \dashv f^\ast \dashv f_\ast) \;\colon\; \mathbf{H}_{/X} \to \mathbf{H}_{/Y}

has inverse image f *f^\ast a cartesian closed functor and hence (see there) exhibits Frobenius reciprocity.


The term ‘Frobenius reciprocity’, in the context of hyperdoctrines, was introduced by Lawvere in

  • F.W. Lawvere, Equality in hyperdoctrines and comprehension schema as an adjoint functor, Proceedings of the AMS Symposium on Pure Mathematics XVII (1970), 1-14.

Lawvere defines Frobenius reciprocity by either of the two equivalent conditions (see “Definition-Theorem” on p.6), and notes that “one of these kinds of identities is formally similar to, and reduces in particular to, the Frobenius reciprocity formula for permutation representations of groups” (p.1).

A textbook source is around lemma 1.5.8 in

General discussion in the context of projection formulas in monoidal categories (not necessarily cartesian) is in

  • H. Fausk, P. Hu, Peter May, Isomorphisms between left and right adjoints, Theory and Applications of Categories , Vol. 11, 2003, No. 4, pp 107-131. (TAC, pdf)

Manifestations of the Frobenius reciprocity formula, in the sense of category theory, recur throughout mathematics in various forms (push-pull formula, projection formula); see for example this Math Overflow post:

  • Andrea Ferretti, Ubiquity of the push-pull formula, MO Question 18799, March 20, 2010. (link)

Further MO discussion includes

Revised on November 19, 2015 06:28:40 by Anonymous Coward (