Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Suppose $G$ is a compact connected Lie group and let $\{X_i\}$ be a basis for its Lie algebra $\mathfrak g$. We know that the exponential $\exp:\mathfrak g \to G$ is surjective but when is it the case that $G$ is generated by $\{\exp(tX_i) : t\in \mathbb R\}$?

share|improve this question
Ah, whoops... I forgot that the compact + connected implies surjectivity –  Dylan Wilson Jan 27 '11 at 5:09

1 Answer 1

up vote 6 down vote accepted

The map $\mathbb{R}^n \to G$ sending $(t_1, \dots, t_n)$ to $\mathrm{exp}(t_1 X_1) \dots \mathrm{exp}(t_n X_n)$ has nonsingular Jacobian at $0$, so its image contains a neighborhood of the origin. By a standard argument, a neighborhood of the origin in a connected topological group generates the full group.

share|improve this answer
Very nice! Thanks! –  Eric O. Korman Jan 27 '11 at 3:04
Can you explain why for the compact connected Lie group the exponential map has to be surjective? (though there can be cases where the exponential map has a finite injectivity radius) –  Anirbit Feb 17 '11 at 8:14
@Anirbit: One way to see this is to use the Hopf-Rinow theorem in Riemannian geometry (since the geodesics with respect to a bi-invariant metric are precisely $\exp(tX)$ for $X$ in the Lie algebra). Sorry for the very delayed response! –  Akhil Mathew Feb 25 '12 at 16:00
@Anirbit Akhil's argument is great but if you do not wish to explicitly use Riemannian geometry, then there is an alternative proof if you assume Cartan's theorem on the maximal tori in a compact connected Lie group (Cartan's theorem can be proved using the Lefschetz fixed point theorem in algebraic topology). Indeed, each element of $G$ is an element of some maximal torus $T\subseteq G$ which means that we need only prove the surjectivity of the exponential map $\text{exp}:\mathfrak{t}\to T$ where $T$ is a torus. Of course, this is very easy to do. –  Amitesh Datta Jun 27 '12 at 2:22

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.