Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Bounds on the order of generation of SO(n,R) by one-parameter subgroups - MaRDI portal

Bounds on the order of generation of SO(n,R) by one-parameter subgroups (Q804720)

From MaRDI portal





scientific article; zbMATH DE number 4202612
Language Label Description Also known as
English
Bounds on the order of generation of SO(n,R) by one-parameter subgroups
scientific article; zbMATH DE number 4202612

    Statements

    Bounds on the order of generation of SO(n,R) by one-parameter subgroups (English)
    0 references
    1991
    0 references
    Let G be a compact Lie group and \(X_ 1,...,X_ k\) a set of generators of its Lie algebra \({\mathfrak g}\). Then any element of G can be written as a finite product of exponentials exp \(t_ jX_ j\), \(j\in \{1,...,k\}\). The author addresses the question how many factors of this kind one needs. For \(G=SO(n)\) he constructs various sets of generators via a successive use of the Cartan decomposition of G when viewed as the group of isometries of a compact Riemannian symmetric space. Then he gives uniform bounds for the number of factors needed. In the case SO(3) he shows that any two elements of \({\mathfrak g}\) which are not collinear can be used as generators and calculates the minimal number of factors in terms of the angle between the two infinitesimal rotations (i.e. their axes).
    0 references
    compact Lie group
    0 references
    generators
    0 references
    Lie algebra
    0 references
    Cartan decomposition
    0 references
    group of isometries
    0 references
    compact Riemannian symmetric space
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references