[Paper Review] Fixed point sets for permutation modules

Peter Collings|ArXiv.org|Jan 28, 2009

Advanced Differential Equations and Dynamical Systems4 references3 citations

TL;DR

This paper establishes a structural classification of fixed point sets in permutation modules over group algebras in positive characteristic, using vertices and Brauer correspondents. It introduces a decomposition theorem showing that any fixed point set is uniquely expressible as a product of a projective-free fixed point set and an irreducible projective fixed point set, with precise conditions on exponents derived from the invariant $\kappa(\Omega)$, enabling complete characterization of components in symmetric group actions on fixed-point-free elements of order $q$. The key contribution is a complete combinatorial and algebraic description of fixed point sets in terms of irreducible and transitive components.

ABSTRACT

We investigate the representation of the symmetric group afforded by the action on its conjugacy class of fixed point free involutions, over an algebraically closed field of finite characteristic p. We discuss the general form of the set of involutions fixed by an arbitrary vertex of an irreducible component of the module afforded by the action, and show how such a set is composed of certain basic fixed point sets which we can enumerate in the case p = 2. The Broué correspondence allows us to pass from the fixed point sets to the vertices.

Motivation & Objective

• To characterize the structure of fixed point sets in permutation modules for finite groups in positive characteristic, especially when the group algebra is not semisimple.
• To determine the vertices of indecomposable components of permutation modules arising from conjugation actions of symmetric groups on fixed-point-free elements of order $q$.
• To establish a complete classification of fixed point sets in terms of irreducible and transitive components, using a binary multiplication operation on sets.
• To compute invariants such as $\kappa(\Omega)$ to determine when permutation modules admit projective summands, particularly in the case $p = q = 2$.
• To provide a framework for decomposing fixed point sets into irreducible, projective-free, and projective components using algebraic and combinatorial tools.

Proposed method

• Uses Broué’s correspondence to relate components of permutation modules with vertex $Q$ to projective components of $k\operatorname{Fix}_\Omega(Q)$, enabling vertex computation via fixed point sets.
• Introduces a binary multiplication operation on $G$-sets that allows constructing new fixed point sets from existing ones, with a unique decomposition into irreducibles.
• Applies a unary multiplication via the diagonal subset of a cartesian product to generate new fixed point sets from existing ones.
• Employs the invariant $\kappa(\Omega)$, defined as the smallest $u$ such that $k\Omega^{\wr u}$ has no projective summand, to control the exponent in product decompositions.
• Uses the notion of $p$-permutation modules (trivial source modules) and their vertices to characterize indecomposable summands via stabilizers and $P$-invariant bases.
• Applies Green’s vertex theory and Brauer’s theory to relate vertices, sources, and Brauer quotients, especially in the context of symmetric group actions on conjugacy classes of fixed-point-free elements.

Experimental results

Research questions

• RQ1 How can the fixed point sets of indecomposable components of permutation modules be fully classified in terms of their algebraic and combinatorial structure?
• RQ2 What conditions determine whether a permutation module admits a projective summand, and how can this be captured via the invariant $\kappa(\Omega)$?
• RQ3 How do the vertices of components in permutation modules relate to their fixed point sets, and can this relationship be made canonical?
• RQ4 What is the precise structure of the fixed point sets for the action of $\operatorname{Sym}(2n)$ on its conjugacy class of fixed-point-free involutions when $p = q = 2$?
• RQ5 Can every fixed point set be uniquely decomposed into a product of irreducible, projective-free, and projective components, and what are the constraints on the exponents?

Key findings

• A fixed point set $X$ is irreducible and exact if and only if $X = \Delta^{p^i}Y$ for some transitive, irreducible, exact fixed point set $Y$ and $i \geq 0$.
• A fixed point set $X$ is projective-free if and only if $X = X_1^{a_1} * \cdots * X_t^{a_t}$, where the $X_i$ are pairwise coprime irreducible exact fixed point sets and $1 \leq a_i < \kappa(X_i)$.
• Every fixed point set $X$ decomposes uniquely as $X = W * V$, where $W$ is projective-free and $V$ is an irreducible projective fixed point set.
• The vertex of a component with fixed point set $X$ is determined by the product of the vertices of its irreducible components, with $Q_X = Q_W * 1$ when $X = W * V$.
• For $p = q = 2$, the paper enables a complete list of vertices of components in the permutation module for $\operatorname{Sym}(2n)$ acting on fixed-point-free involutions, using $\kappa(\Omega)$ and known character-theoretic results.
• The binary multiplication operation on sets allows for a unique decomposition of fixed point sets into irreducibles, with products of coprime sets being easily controlled, and the diagonal construction provides a unary operation for generating new sets.