For mixing transformations \(rank(T^ k)=k\cdot rank(T)\) (Q580678)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: For mixing transformations \(rank(T^ k)=k\cdot rank(T)\) |
scientific article; zbMATH DE number 4017678
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | For mixing transformations \(rank(T^ k)=k\cdot rank(T)\) |
scientific article; zbMATH DE number 4017678 |
Statements
For mixing transformations \(rank(T^ k)=k\cdot rank(T)\) (English)
0 references
1986
0 references
For the class of finite-rank transformations having no partial rigidity (this contains the class of mixing maps) the rank behaves like a logarithm on positive powers in that \(rk(T^ k)=k\cdot rk(T)\). The proof proceeds via a coding argument on generic names. Combined with a group-theoretic argument, this theorem yields a structure theorem for the commutant group of a mixing T: It is a type of twisted product (a ``carry product'') of the integers with a certain finite group called the essential commutant. A consequence of this is that any mixing map with rank no greater than five must have an abelian commutant. [The algebraic argument is done in a more general setting in the article: Joining-rank and the structure of finite rank mixing transformations, which will appear in J. d'Analyse.]
0 references
finite-rank transformations
0 references
partial rigidity
0 references
essential commutant
0 references
mixing map
0 references