In each coordinate space $V$ with dimension $\dim(V)$, we can describe any rotation operator $R : V \to V$ as a product of rotations in as few as $\dim(V) - 1$ orthogonal planes in the space.
Let's say that given the canonical basis $\mathcal B$ of $V$, we take the canonical ordering of the basis vectors $\vec b_i$ and consider only rotations in the planes $\mathcal P = \{\ \mathcal P_{i, i+1} = \text{span} (b_i,b_{i+1})\ |\ b_i, b_{i+1} \in \mathcal B\ \}$. Is there a closed form solution for the matrix of the final rotation operator?
Consider an example in three dimensions. Let $R_{i, j}(\theta_k)$ be the rotation by $\theta_k$ in the plane $\mathcal P_{i, j}$.
\begin{align} R(\theta_1, \theta_2) = R_{1,2}(\theta_1)R_{2,3}(\theta_2) =& \left[\begin{array}{ccc} \cos(\theta_1) & -\sin(\theta_1) & 0 \\ \sin(\theta_1) & \cos(\theta_1) & 0 \\ 0 & 0 & 1 \end{array}\right] \left[\begin{array}{ccc} 1 & 0 & 0 \\ 0 & \cos(\theta_2) & -\sin(\theta_2) \\ 0 & \sin(\theta_2) & \cos(\theta_2) \end{array}\right] \\ =& \left[\begin{array}{ccc} \cos(\theta_1) & -\sin(\theta_1)\cos(\theta_2) & \sin(\theta_1)\sin(\theta_2) \\ \sin(\theta_1) & \cos(\theta_1)\cos(\theta_2) & -\cos(\theta_1)\sin(\theta_2) \\ 0 & \sin(\theta_2) & \cos(\theta_2) \end{array}\right] \end{align}
I can see the beginnings of a pattern, but I feel as though the pattern will break shortly after increasing the number of dimensions.
Is there already a well-studied closed form for this? Is it a fool's errand?
Maybe this ?
It seems that you get a Hessenberg matrix with all sines on the subdiagonal, cosine pairs on the main diagonal, superdiagonals with alternating signs and products on increasing lengths, not so easy to describe.
Update:
With better alignment and pseudo-factors $c_{\bar1},c_4$, the pattern becomes much clearer.
The subdiagonal has all sines. The upper triangle has pairs of cosines (extended row and column indexes), and suffix products of the sines.
$$\left(\begin{matrix} &\color{green}{c_{\bar1}}\color{blue}{c_0}&-\color{green}{c_{\bar1}}\color{blue}{c_1}s_0&\ \ \ \color{green}{c_{\bar1}}\color{blue}{c_2}s_0s_1&-\color{green}{c_{\bar1}}\color{blue}{c_3}s_0s_1s_2&\ \ \ \color{green}{c_{\bar1}}\color{blue}{c_4}s_0s_1s_2s_3\\ &\color{magenta}{s_0}&\ \ \ \color{green}{c_0}\color{blue}{c_1}\ \ \ &-\color{green}{c_0}\color{blue}{c_2}\ \ \ \ s_1&\ \ \ \color{green}{c_0}\color{blue}{c_3}\ \ \ \ s_1s_2&-\color{green}{c_0}\color{blue}{c_4}\ \ \ \ s_1s_2s_3\\ &0&\color{magenta}{s_1}&\ \ \ \color{green}{c_1}\color{blue}{c_2}\ \ \ \ \ \ \ \ &-\color{green}{c_1}\color{blue}{c_3}\ \ \ \ \ \ \ \ s_2&\ \ \ \color{green}{c_1}\color{blue}{c_4}\ \ \ \ \ \ \ s_2s_3\\ &0&0&\color{magenta}{s_2}&\ \ \ \color{green}{c_2}\color{blue}{c_3}\ \ \ \ \ \ \ \ \ \ \ &-\color{green}{c_2}\color{blue}{c_4}\ \ \ \ \ \ \ \ \ \ \ s_3\\ &0&0&0&\color{magenta}{s_3}&\color{green}{c_3}\color{blue}{c_4}\ \ \ \ \ \ \ \ \ \ \ \\ \end{matrix}\right)$$
For the upper triangular elements,
$$R_{rc}=(-1)^{r+c}\color{green}{\cos(\theta_{r-1})}\color{blue}{\cos(\theta_{c})}\prod_{k=r}^{c-1}\sin(\theta_k).$$
By computing the products incrementally, the whole matrix can be obtained in $\approx\dfrac32d^2$ multiplies.