Difference between revisions of "Brauer's permutation lemma"

From Groupprops
Jump to: navigation, search
(Facts)
(Facts)
 
(4 intermediate revisions by the same user not shown)
Line 5: Line 5:
 
Brauer's permutation lemma has the following equivalent forms:
 
Brauer's permutation lemma has the following equivalent forms:
  
# If a row permutation and a column permutation have the same effect on a nonsingular matrix, then they must have the same number of cycles of a given length
+
# If a row permutation and a column permutation have the same effect on a nonsingular matrix, then they must have the same [[cycle type]] i.e., the same number of cycles of each length in their [[cycle decomposition]]s.
 
# The [[symmetric group]] is a [[conjugacy-closed subgroup]] in the [[general linear group]] over any [[field]] of characteristic zero
 
# The [[symmetric group]] is a [[conjugacy-closed subgroup]] in the [[general linear group]] over any [[field]] of characteristic zero
# If two permutation matrices are conjugate in the general linear group over a field of characteristic zero, then they have the same number of cycles of each length, viz, are conjugate in the symmetric group itself
+
# If two permutation matrices are conjugate in the general linear group over a field of characteristic zero, then they have the same [[cycle type]] (i.e., the same number of cycles of each length in their [[cycle decomposition]]s), i.e., are conjugate in the symmetric group itself
 
# If two permutation representations of a [[cyclic group]] are conjugate in the general linear group over a field of characteristic zero, they are also conjugate in the symmetric group
 
# If two permutation representations of a [[cyclic group]] are conjugate in the general linear group over a field of characteristic zero, they are also conjugate in the symmetric group
  
 
==Facts==
 
==Facts==
  
* [[Analogue of Brauer's permutation lemma fails to hold for every non-cyclic finite group]]: If <math>G</math> is a non-cyclic finite group, we can find two permutation representations <math>\varphi_1, \varphi_2</math> of <math>G</math> that are equivalent as linear representations but not as permutation representations.
+
===Opposite facts===
 +
 
 +
* [[Analogue of Brauer's permutation lemma fails over rationals for every non-cyclic finite group]]: If <math>G</math> is a non-cyclic finite group, we can find two permutation representations <math>\varphi_1, \varphi_2</math> of <math>G</math> that are equivalent as linear representations over the rational numbers but not as permutation representations.
 +
* [[Symmetric group of degree six or higher is not weak subset-conjugacy-closed in general linear group over rationals]]
  
 
==Applications==
 
==Applications==

Latest revision as of 03:51, 14 January 2014

This article gives the statement, and proof, of a particular subgroup in a group being conjugacy-closed: in other words, any two elements of the subgroup that are conjugate in the whole group, are also conjugate in the subgroup
View a complete list of such instances/statements

Statement

Brauer's permutation lemma has the following equivalent forms:

  1. If a row permutation and a column permutation have the same effect on a nonsingular matrix, then they must have the same cycle type i.e., the same number of cycles of each length in their cycle decompositions.
  2. The symmetric group is a conjugacy-closed subgroup in the general linear group over any field of characteristic zero
  3. If two permutation matrices are conjugate in the general linear group over a field of characteristic zero, then they have the same cycle type (i.e., the same number of cycles of each length in their cycle decompositions), i.e., are conjugate in the symmetric group itself
  4. If two permutation representations of a cyclic group are conjugate in the general linear group over a field of characteristic zero, they are also conjugate in the symmetric group

Facts

Opposite facts

Applications

Brauer's permutation lemma helps us exploit the conjugacy class-representation duality in two interesting ways. Let C(G) denote the set of conjugacy classes of a finite group G and I(G) denote the set of indecomposable linear representations of G. Let \chi(c,\rho) denote the trace of \rho(g) where g \in G (i.e. the character value).

Note that since the field has characteristic zero, the irreducible representations are the same as indecomposable representations.

Consider the matrix with rows indexed by indecomposable representations, columns indexed by conjugacy classes, and the entry in row \rho and column c is \chi(c,\rho).

We can now consider two different actions: