Tidy subgroups for commuting automorphisms of totally disconnected groups: an analogue of simultaneous triangularisation of matrices

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

36 pages, submitted keywords: locally compact group, scale function, tidy subgroup, modular function, automorphism

Scientific paper

Let \alpha be an automorphism of the totally disconnected group G. The compact open subgroup, V, if G is tidy for \alpha if [\alpha(V') : \alpha(V')\cap V'] is minimised at V, where V' ranges over all compact open subgroups of G. Identifying a subgroup tidy for \alpha is analogous to identifying a basis which puts a linear transformation into Jordan canonical form. This analogy is developed here by showing that commuting automorphisms have a common tidy subgroup of G and, conversely, that a group H of automorphisms having a common tidy subgroup V is abelian modulo the automorphisms which leave V invariant. Certain subgroups of G are the analogues of eigenspaces and corresponding real characters of H the analogues of eigenvalues.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Tidy subgroups for commuting automorphisms of totally disconnected groups: an analogue of simultaneous triangularisation of matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tidy subgroups for commuting automorphisms of totally disconnected groups: an analogue of simultaneous triangularisation of matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tidy subgroups for commuting automorphisms of totally disconnected groups: an analogue of simultaneous triangularisation of matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-501905

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.