This paper introduces $C$-monomial $G$-sets and posets, describes their categorical properties, and develops Lefschetz invariants that lead to new homomorphisms between unit groups of $C$-monomial Burnside rings.
Contribution
It provides a new categorical framework for $C$-monomial $G$-sets and posets, and constructs Lefschetz invariants that induce group homomorphisms between Burnside ring units.
Findings
01
Defined $C$-monomial $G$-sets and posets with categorical properties
02
Established a new description of the $C$-monomial Burnside ring $B_C(G)$
03
Constructed Lefschetz invariants leading to homomorphisms between unit groups
Abstract
Let G be a finite group, and C be an abelian group. We introduce the notions of C-monomial G-sets and C-monomial G-posets, and state some of their categorical properties. This gives in particular a new description of the C-monomial Burnside ring BC(G). We also introduce Lefschetz invariants of C-monomial G-posets, which are elements of BC(G). These invariants allow for a definition of a generalized tensor induction multiplicative map TU,λ:BC(G)→BC(H) associated to any C-monomial (G,H)-biset (U,λ), which in turn gives a group homomorphism BC(G)×→BC(H)× between the unit groups of C-monomial Burnside rings.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Monomial G-posets and their Lefschetz invariants
Serge Bouc and Hatice Mutlu
Abstract
Let G be a finite group, and C be an abelian group. We introduce the notions of C-monomial G-sets and C-monomial G-posets, and state some of their categorical properties. This gives in particular a new description of the C-monomial Burnside ring BC(G). We also introduce Lefschetz invariants of C-monomial G-posets, which are elements of BC(G). These invariants allow for a definition of a generalized tensor induction multiplicative map TU,λ:BC(G)→BC(H) associated to any C-monomial (G,H)-biset (U,λ), which in turn gives a group homomorphism BC(G)×→BC(H)× between the unit groups of C-monomial Burnside rings.
Let G be a finite group, and C be an abelian group. In this work, we first introduce the notion of C-monomial G-set: this is a pair (X,l) consisting of a finite G-set X, together with a functor from the transporter category X of X, to the the groupoid ∙C with one object and automorphism group C. The C-monomial G-sets form a category CMG-set, and we show that it is equivalent to the category CFG-set of C-fibred G-sets considered by Barker ([FIB]). In particular, the C-monomial Burnside ring BC(G) introduced by Dress ([MON]) is isomorphic to the Grothendieck ring of the category CMG-set.
We extend these definitions to the notion of C-monomial G-poset: this is a pair (X,l) consisting of a finite G-poset X, and a functor l from the transporter category X to ∙C. We associate to each such pair (X,l) a Lefschetz invariant Λ(X,l) lying in BC(G). We show that any element of BC(G) is equal to the Lefschetz invariant of some (non unique) C-monomial G-poset.
We also introduce the category CMG-poset of C-monomial G-posets, and show that there are natural functors of induction IndHG:CMH-poset→CMG-poset and of restriction ResHG:CMG-poset→CMH-poset, whenever H is a subgroup of G. These functors are compatible with the construction of Lefschetz invariants.
We extend several classical properties of the Lefschetz invariants of G-posets to Lefschetz invariants of C-monomial G-posets (the classical case being the case where C is trivial).
We next turn to the construction of generalized tensor induction functors
[TABLE]
associated, for arbitrary finite groups G and H, to any C-monomial (G,H)-biset (U,λ). We show that these functors induce well defined tensor induction maps
[TABLE]
which are not additive in general, but multiplicative and preserve identity elements. In particular, we get induced group homomorphisms between the corresponding unit groups of monomial Burnside rings, similar to those obtained by Carman ([IND]) for other usual representation rings.
We show moreover that under an additional assumption, these tensor induction functors and their associated tensor induction maps are well behaved for composition. This yields to a (partial) fibred biset functor structure on the group of units of the monomial Burnside ring.
2 The monomial Burnside ring
Let G be a finite group and C be an abelian group which is noted multiplicatively. We denote by G-set the category of finite G-sets (with G-equivariant maps as morphisms), and B(G) the usual Burnside ring of G, i.e. the Grothendieck ring of G-set for relations given by disjoint union decompositions of finite G-sets.
2.1 The category of C-fibred G-sets
A C-fibred G-set
is defined to be a C-free (C×G)-set with finitely many C-orbits. Let CFG-set denote the category
of C-fibred G-sets where morphisms are (C×G)-equivariant maps.
The coproduct of C-fibred G-sets X, Y is their coproduct X⊔Y as sets, with the obvious (C×G)-action.
If X and Y are C-fibred G-sets, there is a C-action on X×Y defined
by c(x,y)=(cx,c−1y) for any c∈C and (x,y)∈X×Y.
The C-orbit of an element (x,y) of X×Y is denoted by x⊗y
and the set of C-orbits is denoted by X⊗Y. Moreover C×G acts on X⊗Y by
[TABLE]
for any (c,g)∈C×G and x⊗y∈X⊗Y.
One checks easily that X⊗Y is again a C-fibred G-set,
called the tensor product of X and Y.
We denote the isomorphism class of a C-fibred G-set X by [X].
The C-monomial Burnside ringBC(G), introduced by Dress ([MON]), is defined as the Grothendieck group of the category of C-fibred G-sets, for relations given by [X]+[Y]=[X⊔Y]. The ring structure of BC(G) is induced by [X]⋅[Y]=[X⊗Y].
The identity element is the set C with trivial G-action and the zero element is
the empty set. If C is trivial we recover the ordinary Burnside ring of the group G.
Given a C-fibred G-set X, we denote the set of C-orbits on X by C\X.
The group G acts on C\X, and X is (C×G)-transitive if and only if C\X is G-transitive.
If C\X is transitive as a G-set it is isomorphic to G/U for some U≤G.
There exists a group homomorphism μ:U→C such that if U is the stabilizer
of the orbit Cx, then ax=μ(a)x for all a∈U. Since the stabilizer (C×G)x of x in C×G is equal to
[TABLE]
the C-fibred G-set X is determined up to isomorphism
by the subgroup U and μ.
Conversely, let U be a subgroup of G, and
μ:U→C be a group homomorphism. Then we set U_{\mu}=\{\big{(}\mu(a)^{-1},a\big{)}\mid a\in U\}, and denote by [U,μ]G the C-fibred G-set (C×G)/Uμ. The pair (U,μ) is
called a C-subcharacter of G. We denote the set of C-subcharacters
by ch(G). The group G acts on ch(G) by conjugation. The G-set ch(G)
is a poset with the relation ≤ defined by
[TABLE]
for any (U,μ) and (V,ν) in ch(G).
As an abelian group we have
[TABLE]
where (V,ν) runs over G-representatives
of the C-subcharacters of G, details can be seen in [FIB].
2.2 The category of C-monomial G-sets
Let G be a finite group and C be an abelian group.
Given a G-set X, we consider its transporter category X
whose objects are the elements of X and given x, y in X
the set of morphisms from x to y is
[TABLE]
Let ∙C denote the category with one object
where morphisms are the elements of C and composition is multiplication in C.
Now we define C-monomial G-sets as follows.
Definition 1**.**
A C-monomial G-set is a pair (X,l) consisting of a finite G-set X and a functor l:X→∙C.
In otherwords, for each x,y∈X and g∈G such that gx=y, we have an element l(g,x,y) of C, with the property that l(h,y,z)l(g,x,y)=l(hg,x,z) if h∈G and hy=z, and l(1,x,x)=1 for any x∈X.
Let (X,l) and (Y,m) be C-monomial G-sets. If f:X→Y is a map of G-sets, we slightly abuse notation and also denote by f:X→Y the obvious functor induced by f. Now a map (f,λ):(X,l)→(Y,m)
of C-monomial G-sets is a pair consisting of a map f:X→Y of G-sets
and a natural transformation λ:l→m∘f.
We denote by CMG-set the category whose objects are C-monomial G-sets,
morphisms are the maps of C-monomial G-sets, and composition is the obvious one.
Let (X,l) and (X′,l′) be C-monomial
G-sets. We define the disjoint union of C-monomial G-sets as
(X,l)⊔(X′,l′)=(X⊔X′,l⊔l′)
where X⊔X′ is the disjoint union of G-sets and
[TABLE]
is the functor such that
[TABLE]
for any z1,z2∈X⊔X′ such that gz1=z2 for
some g∈G.
The product of C-monomial G-sets
(X,l),(X′,l′) is defined
to be (X×X′,l×l′)
where X×X′ is the product of G-sets and
l×l′:X×Y→∙C
is the functor defined by
[TABLE]
for g∈G and (x,x′),(y,y′)∈X×X′
such that g(x,x′)=(y,y′).
Our goal is to show that the categories CMG-set and CFG-set are equivalent.
For this, we define a functor F:CMG-set→CFG-set as follows:
given a C-monomial G-set (X,l), we set
[TABLE]
which is the direct product C×X endowed with the (C×G)-action defined by
(k,g)(c,x)=\big{(}kc\mathfrak{l}(g,x,gx),gx\big{)} for any (k,g)∈C×G and (c,x)∈C×X.
Given a map (f,λ):(X,l)→(Y,m) of C-monomial G-sets, we define
[TABLE]
by F(f,λ)(c,x)=(cλx,f(x)) for any
(c,x)∈C×lX. Then F(f,λ) is
a (C×G)-map: indeed, given (k,g)∈C×G and (c,x)∈C×X, we have
[TABLE]
It is clear that F:CMG-set→CFG-set is a functor.
Lemma 2**.**
Let C be an abelian group and G be a finite group. Then the above functor
F:CMG-set→CFG-set is an equivalence of categories.
Proof.
We prove that F is fully faithful and essentially surjective.
First we show that F is essentially surjective. Given a C-fibred G-set X,
let C\X be the set of C-orbits. Clearly C\X is a G-set.
We define a functor l:C\X→∙C.
Let Cx, Cy∈C\X such that Cgx=Cy for some g∈G.
Then there exists a unique c∈C such that gx=cy. We set
l(g,Cx,Cy)=c. We have
F(C\X,l)=C×l(C\X).
Now choose a set [C\X] of G-representatives of the G-action
on C\X. Then for any x∈X, there exits a unique
Cσx∈[C\X] such that x∈Cσx. Since X is
C-free, there exists a unique cx∈C such that x=cxσx.
We define a (C×G)-map
f:X→C×l(C\X) such that
f(x)=(cx,Cσx). Then
[TABLE]
[TABLE]
So f is a (C×G)-map and clearly an isomorphism. Thus,
F is essentially surjective.
Let (X,l) and (Y,m) be
C-monomial G-sets. We need to show that the map
[TABLE]
induced by F is surjective and
injective. Let φ:C×lX→C×mY be a (C×G)-map.
Given (1,x)∈C×lX,
let φ(1,x)=(cx,zx)
for (cx,zx)∈C×Y.
Since φ is a (C×G)-map, we get
[TABLE]
and
[TABLE]
for any c∈C and g∈G. We define a map
[TABLE]
such that
f:X→Y is defined by f(x)=zx and
λ:l→m∘f
is defined by λx=cx for any x∈X.
Clearly, f is a G-set map.
Let x∈X and g∈G. Then
[TABLE]
[TABLE]
So λ:l→m∘f is a natural
transformation and (f,λ) is a map of C-monomial
G-sets. Thus, F(f,λ)=φ and F
is surjective. The injectivity is clear, so F is fully faithful.
∎
Proposition 3**.**
Let G be a finite group. Then BC(G) is isomorphic to the Grothendieck ring of the category CMG-set, for relations given by decomposition into disjoint unions of C-monomial G-sets and multiplication induced by product of C-monomial G-sets.
Proof.
We let BC1(G) denote the Grothendieck ring of
the category CMG-set.
The equivalence
[TABLE]
induces a bijection
[TABLE]
such that
[TABLE]
for any C-monomial G-set (X,l). Now we show that
F is a ring homomorphism. Let (X1,l1) and
(X2,l2) be C-monomial G-sets. Then
[TABLE]
[TABLE]
For multiplicativity of F we define a map
[TABLE]
such that
f\big{(}c,(x_{1},x_{2})\big{)}=(c,x_{1})\times_{C}(1,x_{2}).
Let (k,g)∈C×G and
\big{(}c,(x_{1},x_{2})\big{)}\in C\times_{\mathfrak{l}_{1}\times\mathfrak{l}_{2}}(X_{1}\times X_{2}).
Then
[TABLE]
So f is a (C×G)-map and obviously, f is a (C×G)-isomorphism.
Using f we get
[TABLE]
Thus, the desired result follows.
∎
Remark 4**.**
Let (X,l) be a C-monomial G-set.
For all x∈X, we get a character
lx:Gx→C
defined by lx(g)=l(g,x,x)
for g∈Gx. On the other hand given a subgroup U
of G and a group homomorphism μ:U→C we
get a C-monomial G-set (G/U,μ) where
and μ:G/U→∙C
is the functor such that given gU,kU∈G/U if hgU=kU
for some g∈G then μ(h,gU,kU)=μ(k−1hg). Moreover,
[U,μ]G and [G/U,μ] represents the same element in BC(G).
2.3 The Lefschetz invariant attached to a monomial G-poset
A G-poset X is a partially ordered set (X,≤) with a compatible G-action (that is gx≤gy whenever g∈G and x≤y in X). A map of G-posets is a G-equivariant map of posets. We denote by G-poset the category of finite G-posets obtained in this way.
There is an obvious functor ιG:G-set→G-poset sending each finite G-set to the set X ordered by the equality relation, and each G-equivariant map to itself.
The Lefschetz invariant attached to a finite G-poset,
which is an element of the Burnside ring of G has been
introduced in [LEF] by Thévenaz.
We will define similarly a Lefschetz invariant attached
to a C-monomial G-poset as an element of the
C-monomial Burnside ring of G.
2.3.1 The category of C-monomial G-posets
Given a G-poset X, we consider the category
X whose objects
are the elements of X and given x,
y in X the set of morphisms from x to y is
[TABLE]
Now we define a C-monomial G-poset as follows.
Definition 5**.**
A C-monomial G-poset is a pair (X,l) consisting of a G-poset X and a functor l:X→∙C.
In otherwords, for each x,y∈X and g∈G such that gx≤y, we have an element l(g,x,y) of C, with the property that l(h,y,z)l(g,x,y)=l(hg,x,z) if h∈G and hy≤z, and l(1,x,x)=1 for any x∈X.
Let (X,l) and (Y,m) be C-monomial
G-posets. A map of C-monomial G-posets from (X,l) to (Y,m) is a pair
(f,λ):(X,l)→(Y,m),
where f:X→Y is a map of G-posets and
λ:l→m∘f is
a natural transformation. We denote the
category of C-monomial G-posets by CMG-poset.
Product and disjoint union of C-monomial G-posets
are defined as for C-monomial G-sets.
When C is the trivial group, we will identify the category CMG-poset with G-poset.
Remark 6**.**
If (X,l) is a C-monomial G-poset, then for any x∈X
we get a character lx:Gx→C defined by
lx(g)=l(g,x,x). Moreover, if x≤y, then
[TABLE]
because we have the following commutative diagram:
[TABLE]
Let H be a subgroup of G and (X,l) be a C-monomial H-set.
We let G×HX to be the quotient of G×X by the action of H.
The set G×HX is a G-set
via the action g(u,Hx)=(gu,Hx), for any
g∈G, and (u,Hx)∈G×HX.
We define an order relation
≤ on G×HX as
[TABLE]
Since we have
[TABLE]
it’s enough to consider the chains of type
(u,Hx0)<...<(u,Hxn) in G×HX for some u∈G and a chain
x0<...<xn in X for some n∈N.
Let (u,Hx),(u,Hy)∈G×HX and g∈G such that g(u,Hx)≤(u,Hy).
Then
there exists h∈H such that
gu=uh and hx≤y.
We define the induced C-monomial G-posetIndHG(X,l) of (X,l) as the pair (G×HX,G×Hl)
where G×Hl:G×HX→∙C
is defined by
[TABLE]
Now show that (G×HX,G×Hl) is a
C-monomial G-poset.
Let (u,Hx),(u,Hy),(u,Hz)∈G×HX
such that
[TABLE]
and
[TABLE]
for some g,g′∈G. Then there exist some h,h′∈H
such that
[TABLE]
Then t=h′h∈H. Moreover g′gu=uh′h=ut and tx=h′hx≤z.
Now we get
[TABLE]
[TABLE]
We also have (G\times_{H}\mathfrak{l})\big{(}1,(u,_{H}x),(u,_{{}_{H}}x)\big{)}=1
for any (u,Hx)∈G×HX. Thus G×Hl is a functor.
So IndHG(X,l) is a C-monomial G-poset.
Given a C-monomial G-poset (Y,m), the restrictionResHG(Y,m) of (Y,m)
is the pair (ResHGY,resHGm)
where ResHGY is the restriction of the G-poset Y to H-poset and
resHGm is the restriction of the functor m from
Y to ResHGY.
Proposition 7**.**
Let G be a finite group.
If Y is a finite G-poset, denote by 1Y:Y→∙C the trivial functor defined by 1Y(g,x,y)=1 for any g∈G and x,y∈Y such that gx≤y. Then the assignment Y↦(Y,1Y) is a functor τG from G-poset to CMG-poset.
2. 2.
Let H be a subgroup of G. The assignment (X,l)↦IndHG(X,l) is a functor IndHG:CMH-poset→CMG-poset, and the assignment (Y,m)↦ResHG(Y,m) is a functor ResHG:CMG-poset→CMH-poset.
3. 3.
Moreover the diagrams
[TABLE]
of categories and functors are commutative.
Proof.
Let f:X→Y be a map of G-posets. We set
[TABLE]
where 1f:1X→1Y∘f is defined by
1fx=1 for any x∈X. Obviously (f,1f) is a map of C-monomial
G-posets and τG is a functor.
2. 2.
Let (f,λ):(X,l)→(Y,m) be a map of C-monomial H-posets.
We set the pair
[TABLE]
where
[TABLE]
is defined by
(G\times_{H}f)(u,_{{}_{H}}x)=\big{(}u,_{{}_{H}}f(x)\big{)} and
[TABLE]
is defined by (G×Hλ)(u,Hx)=λx for any (u,Hx)∈G×HX.
It’s clear that G×Hf is a map of C-monomial G-posets. Now we show that
G×Hλ is a natural transformation. Let (u,Hx),(u,Hy)∈G×HX
such that g(u,Hx)≤(u,Hy) for some g∈G. Then gu=uh and hx≤y
for some h∈H. Since λ:l→m∘f is
a natural transformation, we get
[TABLE]
[TABLE]
Now consider (idX,idl):(X,l)→(X,l)
where idX:X→X is the identity map on the H-set X and
idl:l→l∘idX is the identity transformation.
Then we get
[TABLE]
Now let (f,λ):(X,l)→(Y,m) and
(t,β):(Y,m)→(Z,r) be the maps of C-monomial H-posets. We obviously have
[TABLE]
and
[TABLE]
Thus,
[TABLE]
So IndHG:CMH-poset→CMG-poset is a functor.
Now let (f,λ):(X,l)→(Y,m) be
a map of C-monomial G-posets. We set the pair
[TABLE]
where f∣H:ResHGX→ResHGY is defined as the restriction of map of G-posets f to map of H-posets and
λ∣H:resHGl→resHGm∘f∣H
is defined as the restriction of λ. Clearly, we get that
ResHG:CMG-poset→CMH-poset is a functor.
3. 3.
Let X be an H-poset. Commmutativity of the first diagram follows from
[TABLE]
Now let Y be a G-poset. Commutativity of the second diagram follows from
[TABLE]
[TABLE]
∎
Proposition 8**.**
Let G be a finite group and H be subgroup of G. Then the functor IndHG:CMH-poset→CMG-poset is left adjoint to the functor (Y,m)↦ResHG(Y,m).
Proof.
We prove that for any C-monomial H-poset (X,l) and any C-monomial G-poset (Y,m) we have a bijection
[TABLE]
natural in (X,l) and (Y,m).
We define
[TABLE]
where
[TABLE]
such that
[TABLE]
defined by
φ(f)(x)=f(1,Hx) and
[TABLE]
defined by
φ(λ)x=λ(1,Hx)
for any x∈X. Obviously, φ(f) is a map of
H-posets. We need to show that
[TABLE]
is a natural transformation.
Let x,y∈X such that gx≤y for some g∈G. Then
[TABLE]
We define an inverse map to φ as
[TABLE]
where
[TABLE]
such that
[TABLE]
defined as θ(ψ)(u,Hx)=uψ(x) and
[TABLE]
defined as
[TABLE]
for any (u,Hx)∈G×HX. Obviously, the map θ(ψ)
is a map of G-posets. We need to show that θ(β) is
a natural transformation. Let
(u,Hx),(u,Hy)∈G×HX such that
g(u,Hx)≤(u,Hy) for some g∈G.
Then there exists some h∈H such that
gu=uh and hx≤y. Now, we have
[TABLE]
Clearly, φ and θ are mutual inverse maps, and natural in (X,l) and (Y,m).
∎
2.3.2 The Lefschetz invariant attached to a C-monomial G-poset
Let (X,l) be a C-monomial G-poset.
The Lefschetz invariantΛ(X,l) of (X,l)
is the element of BC(G) defined by
[TABLE]
where x0<...<xn runs over G-representatives of the
chains in X. The group Gx0,...,xn is the stabilizer of the set {x0,...,xn}, that is Gx0,...,xn=∩i=0nGxi. Here ResGx0,...,xnGx0(lx0) denotes the restriction of the character lx0 introduced in Remark 4. Observe that if x0<...<xn is a chain in X for some n∈N, by Remark 6
we have
[TABLE]
for any 0≤i≤n.
Let (X,l) be a C-monomial G-poset. Given n∈N, let Sdn(X)
denote the set of chains in X with order n+1. Obviously, the set Sdn(X)
is a G-set. Then (Sdn(X),ln) is a C-monomial G-set where
ln:Sdn(X)→∙C is the functor defined by
[TABLE]
for any x0<...<xn, and y0<...<yn in Sdn(X) such that
[TABLE]
for some g∈G.
Remark 9**.**
Given a C-monomial G-poset (X,l), we have the following isomorphism of monomial G-sets:
[TABLE]
for any n∈N.
Proof.
Let [G/Sdn(X)] be a set of representative of the G-action on Sdn(X).
Let x=x0<...<xn be a chain in Sdn(X) then there exist some gx∈G and a unique
σx∈[G/Sdn(X)] such that x=gxσx where
σx=σx0<...<σxn.
We define
[TABLE]
where f(x)=gxGσx∈G/Gσx and λx=l(gx−1,gxσx0,σx0).
Obviously,
[TABLE]
is an isomorphism of G-sets. We show that
[TABLE]
is a natural transformation. Let x=x0<...<xn, and y=y0<...<yn be sequences
in Sdn(X)
such that gx=y for some g∈G. There exist a unique
σx,σy∈[G/Sdn(X)] such that x=gxσx and y=gyσy
for some gx and gy in G. Then x0=gxσx0 and y0=gyσy0
so y0=gx0=ggxσx0. Thus, by uniqueness σx0=σy0 and so
gy−1ggx∈Gσx0. Then setting r={\widehat{\,\mathrm{Res}^{G_{x_{0}}}_{G_{x}}(\mathfrak{l}_{x_{0}})}}\big{(}g,f(x),f(y)\big{)}\lambda_{x}, we have that
[TABLE]
∎
By Remark 9, the Lefschetz invariant of a C-monomial G-set
(X,l) can be written as
[TABLE]
It follows that ΛX=ΛτG(X), where ΛX the Lefschetz invariant of the G-poset X introduced in [BIS].
We define similarly the reduced Lefschetz invariant of (X,l)
[TABLE]
where 1G is the trivial character of G.
Lemma 10**.**
Let G be a finite group and C be an abelian group.
Let (X,l) be a C-monomial G-set, viewed a a C-monomial G-poset ordered by the equality relation on X. Then
Λ(X,l)=[C×lX] in BC(G).
2. 2.
Let (X,l) and (Y,m)
be C-monomial G-posets.
Then Λ(X⊔Y,r)=Λ(X,l)+Λ(Y,m)
in BC(G).
3. 3.
Given C-monomial G-posets (X,l)
and (Y,m),
we have Λ(X×Y,l×m)=Λ(X,l)Λ(Y,m) in BC(G).
Proof.
1. and 2. are clear.
3. In the following proof using the inclusion
[TABLE]
we identify the elements of BC(G) with their image
in Q⊗ZBC(G). We start with rearranging
the chains in X×Y as in the proof of
Lemma 11.2.9 in [BIS].
Let n∈N. Given a chain z=z0<...<zn
in X×Y projection of z on X is
denoted by zX and on Y is denoted by zY.
Then zX is a chain in X with order i+1
for some i≤n and zY is a chain in Y with
order j+1 for some j≤n such that i+j=n. Let si
be the chain s0<...<si and tj
be the chain t0<...<tj. Now
[TABLE]
where
[TABLE]
Now,
[TABLE]
On the other hand
[TABLE]
Thus, Λ(X×Y,l×m)=Λ(X,l)Λ(Y,m).
∎
The first assertion of Lemma 10 tells us that
every positive element of BC(G) is in of the form
Λ(X,l) for some C-monomial
G-poset (X,l).
Now consider the poset
X={a,b,c,d,e} with the ordering
{a≤c,a≤d,a≤e,b≤c,b≤d,b≤e}.
Consider trivial G-action on X.
Then ΛτG(X)=−1BC(G).
So as a consequence of Lemma 10 we
get the following corollary.
Corollary 11**.**
Any element of the monomial Burnside ring can
be expressed as the Lefschetz invariant
of some (non unique) monomial G-poset.
Proposition 12**.**
Let H be a subgroup of G. Given a C-monomial
H-poset (X,l), we have
[TABLE]
Proof.
Since
[TABLE]
we need to show that there exists a C-monomial
G-set isomorphism between
[TABLE]
and
[TABLE]
for any n∈N.
We define
[TABLE]
where
[TABLE]
such that
[TABLE]
for any chain (u,Hx0<...<xn)
in G×HSdn(X).
Let (u0,Hx0)<...<(un,Hxn) be a chain
in Sdn(G×HX). There exist some hi∈H
such that uihi=ui+1 and hi−1xi<xi+1
for all 0≤i≤n−1. Then
[TABLE]
Obviously, fn is a map of G-sets and injective.
Now, we show that G×Hln=(G×Hl)n∘fn.
We consider an element k∈G, and chains (u,Hx0<...<xn) in G×HSdn(X) such that
[TABLE]
There exists some h∈H such that
ku=vh and hxi=yi for all 0≤i≤n.
Then
[TABLE]
∎
Let (X,l) be a G-poset and let x∈X. Then the pairs
(]x,⋅[X,l>x) and (]⋅,x[X,l<x) are C-monomial
Gx-posets where
[TABLE]
which are Gx-posets
and l>x:]x,⋅[X→∙C and l<x:]⋅,x[X→∙C are the restrictions of the functor l.
Lemma 13**.**
Let (X,l) be a monomial G-poset. We have
[TABLE]
Proof.
[TABLE]
∎
Remark 14**.**
We can define the opposite of a C-monomial G-poset (X,l) as follows. We consider the pair
(Xop,lop) where
Xop is the opposite G-poset with the order ≤op defined by
[TABLE]
and lop:Xop→∙C is defined
by
[TABLE]
for any x,y∈Xop and g∈G such that gx≤opy.
Obviously, the pair (Xop,lop) is a C-monomial G-poset.
Moreover the assignment (X,l)↦(Xop,lop)
is a functor CMG-poset→CMG-poset: if
(f,λ):(X,l)→(Y,m) is a map
of C-monomial G-posets, then f:Xop→Yop is a map
of G-posets and for any gx≤opx′, we get the commutative diagram
[TABLE]
Observe that (lop)x(g)=l−1(g−1,x,x)=l(g,x,x)=lx(g), for any x∈X and g∈Gx. It follows that Λ(X,l)=Λ(Xop,lop).
Let (f,λ):(X,l)→(Y,m) be
a map of C-monomial G-posets. Given y∈Y, following [BURN] we set
[TABLE]
which are both Gy-posets. We denote by (fy,l∣fy) the C-monomial Gy-poset where l∣fy:fy→∙C is the restriction of the functor l. Similarly, we denote by
(fy,l∣fy) to be C-monomial Gy-poset where
l∣fy:fy→∙C is the
restriction of the functor l.
Example 15**.**
Let (f,λ):(X,l)→(Y,m)
be a map of C-monomial G-posets. We define a G-poset X∗f,λY with underlying G-set X⊔Y as follows: for z,z′∈X⊔Y, we set
[TABLE]
We define the functor
l∗f,λm:X⊔Y→∙C by
[TABLE]
for any z,z′∈X∗f,λY and g∈G such that gz≤z′.
Now let z1,z2,z3∈X∗f,λY and g,g′∈G such that gz1≤z2 and
g′z2≤z3. We aim to show that
[TABLE]
We have four cases to consider:
•
z1,z2,z3∈X**
•
z1,z2∈X* and z3∈Y*
•
z1∈X* and z2,z3∈Y*
•
z1,z2,z3∈Y.
In the first case we get
[TABLE]
[TABLE]
In the second case, using the naturality of λ we get
[TABLE]
[TABLE]
In the third case, we get
[TABLE]
[TABLE]
In the fourth case
[TABLE]
[TABLE]
Let z∈X∗f,λY then obviously we have
(l∗f,λm)(1,z,z)=1. Thus,
(X∗f,λY,l∗f,λm)
is a C-monomial G-poset.
Lemma 16**.**
Let (f,λ):(X,l)→(Y,m)
be a map of C-monomial G-posets. Then
Λ(X∗f,λY,l∗f,λm)=Λ(Y,m).**
Proof.
Let z∈Z=X∗f,λY. If z∈X consider the map g:]z,⋅[Z→[f(z),⋅[Y defined by
[TABLE]
Let g^{\prime}:\,\big{[}f(z),\cdot\big{[}\rightarrow\big{]}z,\cdot\big{[} defined
by g′(s)=s. Then g and g′ are maps of
Gz-posets
such that g∘g′=Id and Id≤g′∘g. So if z∈X
using [[BURN], Lemma 4.2.4 and Proposition 4.2.5], we get
Λ]z,⋅[=Λ[f(z),⋅[=0. Thus,
[TABLE]
∎
As a consequence, we give an analogue of Proposition 4.2.7. in [BURN], which in turn was inspired by a much deeper theorem of Quillen in [quillen].
Proposition 17**.**
Let (f,λ):(X,l)→(Y,m) be a map
of C-monomial G-posets. Then in BC(G)
[TABLE]
[TABLE]
Proof.
We follow the proof of Proposition 4.2.7 in [BURN].
For any n∈N, any chain z=z0<...<zn∈Sdn(X∗f,λY) can be of two
types, depending on zn∈X or zn∈Y. For a sequence z of the first type we get
[TABLE]
Now a sequence z of the second type has a smallest element y=zi in Y, thus, we can write the sequence as
[TABLE]
such that x0<...<xi−1 is in Sdi−1(fy), and y0<...<yn−i−1
is in Sdn−i−1(]y,⋅[Y). We get
[TABLE]
Let xi−1 denote the chain x0<...<xi−1 and
yn−i−1 denote the chain y0<...<yn−i−1.
Then, by Lemma 10 and Lemma 16 we get
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
For the second assertion we consider the opposite map
[TABLE]
Since we have Λ(X,l)=Λ(Xop,lop) by Remark 14,
the result follows.
∎
Corollary 18**.**
Let (f,λ):(X,l)→(Y,m) be a map of C-monomial G-posets. If Λfy=0 for all y∈Y (resp. if Λfy=0 for all y∈Y), then ΛX,l=ΛY,m.
Remark 19**.**
The assumption of this corollary is fulfilled in particular if f:X→Y admits a right adjoint g, in other words if there exists a map of posets g:Y→X such that f(x)≤y⇔x≤g(y) for any x∈X and y∈Y, i.e. equivalently if f∘g(y)≤y and g∘f(x)≤x for any x∈X and any y∈Y.
Now we set some notation. Given a C-monomial G-set (X,l), we can rewrite
its Lefschetz invariant as
[TABLE]
[TABLE]
where
[TABLE]
Given a C-monomial G-poset (X,l)
we let the set (X,l)U,μ to be
[TABLE]
where (U,μ) is a subcharacter of G.
Then given a C-subcharacter (U,μ)∈ch(G) we have
[TABLE]
where
[TABLE]
Now ∣NG(V,ν):V∣mV,νX,l=γV,νX,l. Using this fact
we prove the following lemma.
Lemma 20**.**
Let (X,l) and (Y,m)
be C-monomial G-posets then Λ(X,l)=Λ(Y,m) if and only if
\chi\big{(}(X,\mathfrak{l})^{U,\mu}\big{)}=\chi\big{(}(Y,\mathfrak{m})^{U,\mu}\big{)} for every C-subcharacter (U,μ) of G.
Proof.
Assume Λ(X,l)=Λ(Y,m). Then
[TABLE]
[TABLE]
So γV,νX,l=γV,νY,m and then
mV,nuX,l=mV,nuY,m for every C-subcharacter (V,ν)
of G. We get
[TABLE]
Thus, \chi\big{(}(X,\mathfrak{l})^{U,\mu}\big{)}=\chi\big{(}(Y,\mathfrak{m})^{U,\mu}\big{)}
for every C-subcharacter (U,μ) of G.
Conversely, assume that \chi\big{(}(X,\mathfrak{l})^{U,\mu}\big{)}=\chi\big{(}(Y,\mathfrak{m})^{U,\mu}\big{)}
for every C-subcharacter (U,μ) of G. Then
[TABLE]
[TABLE]
Let z be the matrix with the coefficients
[TABLE]
for any C-subcharacters (U,μ),(V,ν). If we list the C-subcharacters
in non-decreasing order of size of the subgroups, the matrix z is upper triangular with
nonzero diagonal coefficients. Thus, z is nonsingular and so
mV,νX,l=mV,νY,m. This implies
γV,νX,l=γV,νY,m. We get
[TABLE]
This proves the lemma.
∎
3 Generalized tensor induction
Let G and H be finite groups. A set U is a (G,H)-biset
if U is a left G-set and right H-set such that the G-action
and the H-action commute. Any (G,H)-biset U is a left
(G×H)-set with the following action:
[TABLE]
A C-monomial (G×H)-set (U,λ) will be called
a C-monomial (G,H)-biset, and usually denoted by Uλ for simplicity.
Now let Uλ be a C-monomial (G×H)-set and u,u′∈U. Then the set of morphisms from u to u′ in U is
[TABLE]
If (g,h)∈HomU(u,u′),
we denote the image of (g,h)
under λ by λ(g,h,u,u′).
Let Uλ be a C-monomial (G,H)-biset
and Vρ be a C-monomial (H,K)-biset.
Consider the set
[TABLE]
The set Uλ∘Vρ is an H-set with the action
[TABLE]
Indeed, the condition that we impose on Uλ∘Vρ amounts to saying that given (u,v)∈Uλ∘Vρ, the
linear character ξu,v:h↦λ(1,h,u,u)ρ(h,1,v,v) of Hu∩Hv is trivial. Moreover we have ξux,x−1v(h)=ξu,v(xhx−1)=1 for x∈H and h∈Hux∩Hx−1v, i.e. xhx−1∈Hu∩Hv.
We let Uλ∘HVρ denote the set of H-orbits on Uλ∘Vρ and (u,Hv) denote the
H-orbit containing (u,v). The set Uλ∘HVρ
is (G,K)-biset with the action
[TABLE]
We obtain a C-monomial (G,K)-biset (Uλ∘HVρ,λ×ρ), where λ×ρ is defined as follows: if (u,Hv) and (u′,Hv′)∈Uλ∘HVρ and (g,k)∈G×K are such that g(u,Hv)=(u′,Hv′)k, then there exists h∈H such that gu=u′h and hv=v′k. This element h need not be unique, but it is well defined up to multiplication on the right by an element of Hu∩Hv. We set
[TABLE]
which does not depend on the choice of h, by the defining property of Uλ∘Vρ.
Note that Uλ∘HVρ=U×HV when V is a left free (H,K)-biset, or when λ and ρ are both equal to the trivial functor.
Given a C-monomial G-poset (X,l), we let tU,λ(X,l) be the set of G-equivariant maps f:U→X such that
[TABLE]
for all u∈U and
g∈Gu. Then tU,λ(X,l) is an H-poset with the action (hf)(u)=f(uh),
for any h∈H, for any f∈tU,λ(X,l), for any u∈U. The order ≤ is given as follows:
[TABLE]
Now we define a functor LU,λ:tU,λ(X,l)→∙C. Let f, f′∈tU,λ(X,l) and h∈H
such that hf≤f′. We choose a set [G\U] of representatives of G-orbits of U. Then for all u∈U there exist some
gh,u∈G and a unique σh(u)∈[G\U] such that
[TABLE]
Since hf≤f′, we get {g_{h,u}}f\big{(}{\sigma_{h}(u)}\big{)}\leq{f^{\prime}}(u), and we set
[TABLE]
Now we show that this definition does not depend on the choice of gh,u. Assume that there exist
gh,u, gh,u′∈G such that
[TABLE]
So there exists w∈Gσh(u) such that gh,u=gh,u′w. We get
[TABLE]
Furthermore, we get the following commutative diagram:
[TABLE]
Thus,
[TABLE]
Definition 21**.**
The above construction T_{U,\lambda}:(X,\mathfrak{l})\mapsto\big{(}t_{U,\lambda}(X,\mathfrak{l}),\mathfrak{L}_{U,\lambda}\big{)} is called the
generalized tensor induction for C-monomial G-posets, associated to (U,λ).
Lemma 22**.**
Let G and K be finite groups and U be a (G,K)-biset. Then there exists a bijection
between the sets
{(u,t)∣u∈[G\U/K],t∈[(K∩Gu)\K]} and [G\U].
Proof.
Let u∈[G\U/K] and t∈[(K∩Gu)\K] then there exist some
gt,u∈G and a unique σt(u)∈[G\U] such that
[TABLE]
We define
ψ:{(u,t)∣u∈[G\U/K],t∈[(K∩Gu)\K]}→[G\U]
by ψ(u,t)=σt(u).
∎
Lemma 23**.**
Let G and H be finite groups, (U,λ) be a monomial (G,H)-biset and (X,l) be a C-monomial G-poset.
\big{(}t_{U,\lambda}(X,\mathfrak{l}),\mathfrak{L}_{U,\lambda}\big{)}* is a C-monomial H-poset.*
2. 2.
\big{(}t_{U,\lambda}(X,\mathfrak{l}),\mathfrak{L}_{U,\lambda}\big{)}* does not depend on the choice of representative set [G\U], up to isomorphism.*
Proof.
We show that LU,λ:tU,λ(X,l)→∙C
is a functor. Let h, h′∈H and f,f′,f′′∈tU,λ(X,l)
such that hf≤f′ and h′f′≤f′′. Let u∈[G\U]. Then there exist some
gh,u,gh′,u,gh′h,u in G and unique elements σh(u),σh′(u),σh′h(u) in [G\U] such that
[TABLE]
Also there exist some
gh,σh′(u)∈G and a unique {\sigma_{h}\big{(}\sigma_{h^{\prime}}(u)\big{)}}\in[G\backslash U] such that
[TABLE]
Now we get
[TABLE]
and
[TABLE]
Then there exists w∈Gσh′h(u) such that
[TABLE]
We have the following commutative diagram:
[TABLE]
On the other hand since w∈Gσh′h(u), we get
[TABLE]
Thus, setting L=LU,λ(h′h,f,f′′), we have
[TABLE]
Moreover, given f∈TU,λ(X,l) we have
[TABLE]
Thus, LU,λ:tU,λ(X,l)→∙C is a functor.
2. 2.
Let h∈H and f, f′∈tU,λ(X,l) such that hf≤f′.
Let S=[G\U] and let S′ be the another choice of representatives. If u′∈S′ then
there exist some au∈G, and a unique u∈S such that u′=auu. Then there exist some gh,auu,
gh,u∈G, a unique σh′(auu)∈S′, and a unique σh(u)∈S such that
[TABLE]
and
[TABLE]
Then
[TABLE]
So σh′(auu)=aσh(u)σh(u). Note that aσh(u)σh(u)∈S′.
We get the following commutative diagram:
[TABLE]
Thus, setting L=LU,λ′(h,f,f′), we have
[TABLE]
where
[TABLE]
and
[TABLE]
∎
Proposition 24**.**
Let G and H be finite groups and (U,λ) be a C-monomial (G,H)-biset.
Let (X,l),(X′,l′)
be C-monomial G-posets then
[TABLE]
2. 2.
TU,λ:CMG-poset* →CMH-poset is a functor.*
Proof.
is clear.
2. 2.
Let (φ,β):(X,l)→(Y,m)
be a map of C-monomial G-posets. We define
a map of C-monomial G-posets
[TABLE]
where
[TABLE]
such that TU,λ(φ)(f)=φ∘f
and
[TABLE]
such that
[TABLE]
for any f∈tU,λ(X,l). Clearly,
φ∘f:U→X→Y is
a map of G-posets. Since
given g∈Gu and u∈U
the map β:l→m∘φ is natural, we have the following commutative diagram:
[TABLE]
So
[TABLE]
Since g∈Gf(u), we have
[TABLE]
Then we get
[TABLE]
Thus, φ∘f∈tU,λ(Y,m).
Now we show that
[TABLE]
is a natural transformation. Let f,f′∈tU,λ(X,l) and h∈H
such that hf≤f′. We show that the following diagram is commutative:
[TABLE]
Let u∈[G\U]. Then there exist some gh,u∈G and
a unique σh(u)∈[G\U]
such that
[TABLE]
Since β:l→m∘φ is
a natural transformation, we obtain the following commutative diagram :
[TABLE]
Using the commutativity of the above diagram, and setting T=TU,λ(β)f′∘L(h,f,f′), we get
[TABLE]
So TU,λ(β):L→M∘TU,λ(φ) is a natural transformation. Thus,
[TABLE]
is a map of C-monomial G-posets.
∎
Lemma 25**.**
*Let G,H and K be finite groups. If U is a (G,H)-biset and
V is a left free (H,K)-biset, then the map (u,v)∈U×V↦(u,Hv)∈U×HV restricts to a bijection π:[G\U]×[H\V]→[G\(U×HV)], where brackets denote sets of representatives of orbits.
*
Proof.
For (u,v)∈U×V, there exists v0∈[G\V] and h∈H such that v=hv0. Then there exists u0∈[G\U] and g∈G such that uh=gu0. Then (u,Hv)=g(u0,Hv0). Hence π is surjective. Now if (u0,v0) and (u1,v1) are pairs in [G\U]×[H\V] which lie in the same G-orbit, there exists g∈G and h∈H such that (gu0,v0)=(u1h−1,hv1). Hence hv1=v0, so v0=v1=hv1, and h=1 since H act freely on V. Then gu0=u1, so u0=u1, and π is injective.
∎
Proposition 26**.**
Let G,H and K be finite groups.
Let (∙,1) be the C-monomial G-poset where ∙
is G-poset with one element and 1:∙→∙C is the functor
such that 1(g,∙,∙)=1. Then TU,λ(∙,1)=(∙,1).
2. 2.
Let (∅,z) be the empty C-monomial (G,H)-poset. Then T∅,z is the constant functor with value (∙,1).
3. 3.
Let (U,λ) and (U′,λ′) be C-monomial (G,H)-bisets
and let (X,l) be
a C-monomial G-poset then
[TABLE]
4. 4.
Let idG stand for the identity (G,G)-biset. Then
TidG,1(X,l)=(X,l) for any C-monomial G-poset (X,l).
5. 5.
Let (V,ρ) be a C-monomial left free (H,K)-biset, and (U,λ) be a C-monomial (H,G)-biset. Then
[TABLE]
Proof.
1., 2., 3. and 4. are clear.
5. Note that since V is left free, we have Uλ∘HVρ≅GU×HVK.
Let (X,l) be a C-monomial G-poset. We need to show that
[TABLE]
We define a K-poset map
\varphi:t_{V,\rho}\big{(}t_{U,\lambda}(X,\mathfrak{l}),\mathfrak{L}_{U,\lambda}\big{)}\rightarrow t_{U\times_{H}V,\lambda\times\rho}(X,\mathfrak{l})
such that
[TABLE]
for any f\in t_{V,\rho}\big{(}t_{U,\lambda}(X,\mathfrak{l}),\mathfrak{L}_{U,\lambda}\big{)}
and (u,Hv)∈U×HV. It’s clear that the map φ(f) is a map of G-posets.
Let g∈G(u,Hv). Note that since V is H-free, we have g∈Gu.
Then
[TABLE]
[TABLE]
and so
φ(f)∈tU×HV,λ×ρ(X,l).
Now we define a map
[TABLE]
such that θ(t)(v)(u)=t(u,Hv) for any t∈tU×HV,λ×ρ(X,l),
u∈U and v∈V. We show that \theta(t)\in t_{V,\rho}\big{(}t_{U,\lambda}(X,\mathfrak{l}),\mathfrak{L}_{U,\lambda}\big{)}. Indeed, the map θ(t) is clearly a map of H-sets and moreover, since V is H-free, we have Hv=1 for any v∈V. Then
[TABLE]
Clearly, θ(t)(v) is a map of G-sets. Let g∈Gu. Then g∈G(u,Hv), and we get
[TABLE]
[TABLE]
So \theta(t)\in t_{V,\rho}\big{(}t_{U,\lambda}(X,\mathfrak{l}),\mathfrak{L}_{U,\lambda}\big{)}.
Now we show that LV,ρ∘LU,λ=LU×HV,λ×ρ.
Let k∈K and f,{f^{\prime}}\in t_{V,\rho}\big{(}t_{U,\lambda}(X,\mathfrak{l}),\mathfrak{L}_{U,\lambda}\big{)} such that kf≤f′.
Let v∈[H\V]. Then there exist a unique
σk(v)∈[H\V] and some hk,v∈H such that
[TABLE]
Let u∈[G\U]. Then
there exist a unique σhk,v(u)∈[G\U] and some ghk,v,u∈G such that
[TABLE]
Then
[TABLE]
[TABLE]
We get
[TABLE]
Then
[TABLE]
and
[TABLE]
for some w∈Gσk(u,Hv). We get the following commutative diagram:
[TABLE]
Using the commutativity of the above diagram and Lemma 25 we get
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
∎
Remark 27**.**
The following example shows that the assumption that V is left free seems to be necessary for Assertion 5. Suppose that H=N⋊K is a semidirect product of a normal subgroup N with K. Let G be the group K, viewed as a subgroup of H. Let moreover U be the set H, viewed as a (G,H)-biset by left and right multiplication, and let V be the set K, acted on by K on the right by multiplication, and by H on the left by projection to K=H/N, followed by multiplication in K. Let moreover λ and ρ be equal to the trivial functor on U and V, respectively.
Then Uλ∘HVρ=U×HV, as λ and ρ are both trivial. Moreover U×HV=G×HK is equal to the identity (K,K)-biset (this makes sense since G=K), so TU×HV,λ×ρ=TidK,1 is the identity functor, by Assertion 4.
On the other hand G\U=K\(NK)≅N, and H\V has cardinality 1. So in the computation of the functor LU,1 appearing in TU,1(X,l), we have a product of values of l, indexed by N. So the composition TV,1∘TU,1 cannot act in general as the identity on (X,l), if N is non trivial. Hence TV,λ∘TU,ρ=TU×HV,λ×ρ in this situation.
Remark 28**.**
Let G and H be finite groups, and U be a (finite) (G,H)-biset. Then one can check that the diagram
[TABLE]
of categories and functors is commutative, up to isomorphism, where the functor TU on the left is the usual generalized tensor induction functor for G-posets.
Lemma 29**.**
Let G and H be finite groups, and let (U,λ) be a C-monomial (G,H)-biset.
Then there exists a unique map
[TABLE]
such that
TU,λ(Λ(X,l))=ΛTU,λ(X,l)
for any finite C-monomial G-poset (X,l).
Proof.
We show that if (X,l)
and (Y,m) are finite C-monomial G-posets such that if
Λ(X,l)=Λ(Y,m) in BC(G),
then ΛTU,λ(X,l)=ΛTU,λ(Y,m) in BC(H).
So it’s enough to show that \chi\Big{(}T_{U,\lambda}\big{(}(X,\mathfrak{l})\big{)}^{K,\theta}\Big{)}=\chi\Big{(}T_{U,\lambda}\big{(}(Y,\mathfrak{m})\big{)}^{K,\theta}\Big{)}, by Lemma 20 for any
(K,θ) of ch(G).
Let u∈[G\U/K], k∈K and t∈[K∩Gu\K] then there exist
a unique σk(ut)∈[G\U] and some
gk,ut∈G such that
[TABLE]
Also there exist some ck,t∈K∩Gu and a unique τk(t)∈[K∩Gu\K]
such that
[TABLE]
Since ck,t∈K∩Gu, there exists
γk,t,u∈G such that
[TABLE]
Now
[TABLE]
So σk(ut)=uτk(t) and there exists w∈Gσk(ut) such that
gk,ut=γk,t,uw. We get the following commutative diagram:
[TABLE]
Now let f∈tU,λ(X,l)K,θ and k∈K such that
kf=f. Note that since f is K-fixed, we have
[TABLE]
so γk,t,u∈Gf(u). Hence
[TABLE]
Let γk,u=t∈[K∩Gu\K]∏γk,t,u and
ϕu(k)=t∈[K∩Gu\K]∏λ−1(γk,t,u,k,σk(ut),ut).
Then
[TABLE]
Let Ξ be the family of the sets ξ={ξu}u∈[G\U/K] where
ξu:uK→C is a character such that resuKGf(u)(lf(u))=ξu and
[TABLE]
for all k∈K and u∈[G\U/K].
We claim that
[TABLE]
Let f∈TU,λ(X,l)K,θ,
then f(guk)=gf(u) for all g∈G,u∈U,
and k∈K. So to determine f, it’s enough to know
f(u) for u∈[G\U/K]. Let f(u)=xu.
Then resuKGxulxu∈{ξu}u∈[G\U/K]
for some {ξu}u∈[G\U/K]∈ξ.
Conversely, let us choose xu∈X for any u∈[G\U/K]. Let
v∈V then v=guk for some g∈G, for some k∈K
and a unique u∈[G\U/K]. We set f(v)=gxu.
Now f is well defined if and only if gxu=xu whenever g∈uK or equivalently
xu∈XuK. We want that f∈TU,λ(X,l)K,θ. If
xu∈(X,l)uK,ξu then resuKGxu(lxu)=ξu
and
[TABLE]
So f∈TU,λ(X,l)K,θ.
Now using [[BIS], Lemma 11.2.9] we get
[TABLE]
Thus, if Λ(X,l)=Λ(Y,m) then ΛTU,λ(X,l)=ΛTU,λ(Y,m).
So we can define a map
[TABLE]
such that
TU,λ(a)=ΛTU,λ(X,l) where (X,l)
is a C-monomial G-poset such that
a=Λ(X,l), as in Corollary 11.
∎
Proposition 30**.**
Let G and H be finite groups, and let (U,λ) be a C-monomial
(G,H)-biset.
TU,λ([G,1G]G)=[H,1H]H.**
2. 2.
TU,λ(ab)=TU,λ(a)TU,λ(b), for any a,b∈BC(G).
In particular, the restriction of TU,λ to BC(G)× is a group
homomorphism
[TABLE]
Proof.
Consider the C-monomial G-poset (∙,1) then clearly Λ(∙,1)=[H,1H]H. So using the first assertion of Proposition 26 we get
[TABLE]
2. 2.
Let a,b∈BC(G) then by Corollary 11 there exist C-monomial G-posets (X,l)
and (Y,m) such that Λ(X,l)=a and Λ(Y,m)=b. Then
[TABLE]
[TABLE]
∎
Proposition 31**.**
Let G, H, and K be finite groups.
Let idG stand for the identity (G,G)-biset. Then TidG,1G
is the identity map of BC(G).
2. 2.
Let (U,λ) and (U′,λ′) be C-monomial (G,H)-bisets. Then for any a∈BC(G)
[TABLE]
3. 3.
Let (U,λ) be a C-monomial (G,H)-biset and let (V,ρ) be a monomial left free (H,K)-biset then
[TABLE]
Proof.
Let a∈BC(G) then by Corollary 11 there exists a C-monomial G-poset (X,l)
such that a=Λ(X,l).
Using the third assertion of Proposition 26, we get
[TABLE]
2. 2.
Using the second assertion of Proposition 26, we get
[TABLE]
3. 3.
Using the fourth assertion of Proposition 26, we get
[TABLE]
[TABLE]
∎
Corollary 32**.**
Let G and H be finite groups. The map (U,λ)↦TU,λ× of Proposition 30 extends to a bilinear map
[TABLE]
Proof.
This follows from Assertion 2 of Proposition 26 and Assertion 2 of Proposition 31, and from the fact that the map T(U,λ)× depends only on the isomorphism class of (U,λ). ∎
Remark 33**.**
It follows from Remark 28 that if U is a finite (G,H)-biset, the square
[TABLE]
of groups and multiplicative maps, is commutative, where TU on the left is the usual generalized tensor induction map for Burnside rings, and the horizontal maps tG and tH are the ring homomorphisms induced by the functors τG and τH.
Acknowledgement
The second author was granted
the Fellowship Program for Abroad Studies 2214-A
by the Scientific and Technological Research Council of Turkey (Tübitak).
The second author also wishes to thank LAMFA for their
hospitality during the visit.