Number of equations in orthogonal matrix? I have an orthogonal matrix $A^{n\times n}$, that is $A^TA=I$. What is the number of equations $A$ has to satisfy?
It seems to me that the answer is $\frac{n}{2}(n+1)$. My reasoning as follows. Each element of $A^TA$ corresponds to an equation. The diagonal elements are not repeated but the off diagonal elements in the upper triangular matrix are repeated also in the lower triangular matrix. So we need half the elements + the rest of the diagonal matrix that is $n^2/2 + n/2$. Is this correct?
 A: As noted in the comments
$$
A^T A  = I
$$
is equivalent to $n^2$ equations in the matrix components:
$$
\sum_j a_{ij}^T a_{jk} = \sum_j a_{ji} a_{jk} = \delta_{ik} \quad\quad (i, k \in \{1,\dotsc, n\})
$$
On the main diagonal we have $i=k$ and up to $n$ different equations
$$
\sum_j a_{ji}^2 = 1
$$
Otherwise we have 
$$
0 = \sum_j a_{ji} a_{jk} = \sum_j a_{jk} a_{ji}
$$
which gives up to $(n-1) + (n-2) + \dotsb + 1 = (n-1)n/2$ different equations.
So we have up to $n(n+1)/2$ different equations.
A: Since $A^TA$ is symmetric, it is not difficult to see that $A^TA=I$ can be written in the form of $n(n+1)/2$ "different" equations. Unfortunately, the concept of "different equations"  has no geometric interpretation. That is important is the concept of algebraically independent relations between the $(a_{i,j})$ (cf. the Darij Grinberg's post); here our $n(n+1)/2$ relations are independent but we must prove that. To do that, we can use the @DisintegratingByParts 's post; yet, is not easy because behind, there is a fibration...
The easiest and best method is to calculate the dimension $d$ of the kernel of $Df_A$  where $f:A\rightarrow A^TA-I$. Then the number of degrees of freedom of $O(n)$ is $n^2-d$. On this website, I wrote the associated proof several times; unfortunately, when talking about derivatives, most students throw themselves on the "matrix cookbook"; then, of course, they do not understand anything about the proof they read. 
In short, I am discouraged and I will not write the same proof again (it suffices to use the search button). When I see that the OP gave the green chevron to @mvw (he himself knows that his answer is just smoke),  I tell myself that there is still a long way ahead of us. 
A: The matrix equation $A^{T}A=I$ is equivalent to saying that the columns of $A$ form an orthonormal basis. There are $n$ length equations. After that, there are $n-1$ equations stating that column $1$ is orthogonal to columns $2$ to $n$. And there are $n-2$ equations stating that column $2$ is orthogonal to columns $3$ to $n$. So the total number of equations is
$$
       n+(n-1)+(n-2)+\cdots+1=\frac{n(n+1)}{2}
$$
