Maths WorkshopMaths problems with full solutions
Exercise 2036Topology › Topology of Mn(ℝ) › Norms and metric structureM1Added 7 Nov 2026

An upper bound of the determinant

#Hadamard inequality#AM-GM#equality case#determinant

Statement

Show that ∣det⁡A∣≤(∥A∥Fn)n|\det A|\le\left(\dfrac{\|A\|_F}{\sqrt n}\right)^n for every A∈Mn(R)A\in M_n(\mathbb{R}), with equality iff AA is a multiple of an orthogonal matrix (including A=0A=0).

Hint

Combine Hadamard's inequality with the AM-GM inequality applied to the numbers ∣aj∣2|a_j|^2.

Study the equality cases of both inequalities.

Show solutionHide solution

Solution

Idea. Hadamard bounds the determinant by the product of column lengths; AM-GM then bounds this product by the arithmetic mean of the squared lengths, which is ∥A∥F2/n\|A\|_F^2/n.

Step 1: Hadamard. ∣det⁡A∣2≤∏j=1n∣aj∣2|\det A|^2\le\prod_{j=1}^n|a_j|^2.

Step 2: AM-GM. For the non-negative numbers ∣aj∣2|a_j|^2,
∏j=1n∣aj∣2≤(1n∑j=1n∣aj∣2)n=(∥A∥F2n)n,\prod_{j=1}^n|a_j|^2\le\Big(\frac1n\sum_{j=1}^n|a_j|^2\Big)^n=\Big(\frac{\|A\|_F^2}n\Big)^n,
since ∑j∣aj∣2=∑i,jaij2=∥A∥F2\sum_j|a_j|^2=\sum_{i,j}a_{ij}^2=\|A\|_F^2. Taking square roots of the combined inequality gives the claim.

Equality, if det⁡A≠0\det A\ne0. We need equality in both steps. Equality in Hadamard means the columns are pairwise orthogonal; equality in AM-GM means all ∣aj∣2|a_j|^2 are equal, say to s2>0s^2>0. Then ATA=s2IA^TA=s^2I, so A/sA/s is orthogonal and A=sUA=sU with U∈O(n)U\in O(n).

Equality, if det⁡A=0\det A=0. The left side is 00, so the right side must vanish: ∥A∥F=0\|A\|_F=0, i.e. A=0A=0.

Converse. If A=sUA=sU then ∣det⁡A∣=∣s∣n|\det A|=|s|^n and ∥A∥F=∣s∣n\|A\|_F=|s|\sqrt n, so both sides equal ∣s∣n|s|^n.

Remark. Writing the inequality as ∣det⁡A∣2/n≤1n∥A∥F2=1ntr⁡(ATA)|\det A|^{2/n}\le\frac1n\|A\|_F^2=\frac1n\operatorname{tr}(A^TA) shows it is the AM-GM inequality for the eigenvalues of the PSD matrix ATAA^TA (whose determinant is det⁡(A)2\det(A)^2 and whose trace is ∥A∥F2\|A\|_F^2): det⁡(S)1/n≤tr⁡(S)/n\det(S)^{1/n}\le\operatorname{tr}(S)/n.