nLab
Frobenius reciprocity

Context

Category theory

Representation theory

Contents

Definition

The term Frobenius reciprocity has a meaning

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.

In category theory

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

Each of the functors A, f *A and f * has a left adjoint, so by the calculus of mates, this condition is equivalent to asking that the canonical morphism

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

is an isomorphism for each B in Y and C in X.

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:

Frobenius laws and Frobenius reciprocity

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Δ denotes the diagonal transformation on a cartesian bicategory (e.g., Rel), with right adjoint δ , 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 ϕ 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 B and any object c of B, 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)B is the inclusion, and Semilat is the 2-category of meet-semilattices. Here rhom(ib,c) is thought of as a relation from b to c, and for a map f:ab, the relation f *r is the pulling back

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

along f, and one may show that f * preserves finite local meets. Indeed, the pushforward or quantification along f takes q:a1 to

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

and ff * because f is right adjoint to the map f. Because f * 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); it takes the form

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

for any map f:ab and predicates qhom(a,c), rhom(b,c).

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

Proposition

Frobenius reciprocity holds in each hyperdoctrine 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 b 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:bc has an opposite relation r op:cb 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:ab is a map, then its right adjoint f equals the opposite f 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.

Proposition

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

Proof

Again, Frobenius reciprocity in a (locally posetal) cartesian bicategory B means that for any map f:ab and any two relations qB(a,c), rB(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 f, q, and r:

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 is the diagonal map and ε x:x1 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.

References

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

  • F.W. Lawvere, Adjointness in Foundations, TAC Reprint, 2006. (link)

A textbook source is around lemma 1.5.8 in

Manifestations of the Frobenius reciprocity formula, in the sense of this section, 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)

Revised on January 4, 2013 22:59:31 by Mike Shulman (108.225.239.218)