Maths WorkshopMaths problems with full solutions
Exercise 1352Topology › Topology of Mn(ℝ) › Density and closuresL3Added 6 Nov 2026

Proper algebraic subsets of M_n(R) have measure zero

#Lebesgue measure#polynomials#Fubini#induction

Statement

Show that a proper algebraic subset of Mn(R)M_n(\mathbb{R}) (a proper subset defined as the common zero set of polynomials in the entries) has Lebesgue measure zero.

Hint

Show first that the zero set of a nonzero polynomial on Rk\mathbb{R}^k is null, by induction on kk and Fubini's theorem.

Show solutionHide solution

Solution

Reduction. A proper algebraic subset Z={p1=⋯=pm=0}⊊MnZ=\{p_1=\dots=p_m=0\}\subsetneq M_n must have some pi≢0p_i\not\equiv0 (if all were 00, ZZ would be everything). Then Z⊆{pi=0}Z\subseteq\{p_i=0\}, so it suffices to treat one nonzero polynomial pp on Rk\mathbb{R}^k, k=n2k=n^2.

Claim. If p≢0p\not\equiv0 is a polynomial on Rk\mathbb{R}^k, then {p=0}\{p=0\} has Lebesgue measure 00.

*k=1k=1:* a nonzero polynomial has finitely many roots.

*Induction step.* Assume the claim in dimension k−1k-1. Write
p(x′,xk)=∑j=0dqj(x′)xkj,x′=(x1,…,xk−1),p(x',x_k)=\sum_{j=0}^dq_j(x')x_k^j,\qquad x'=(x_1,\dots,x_{k-1}),
with qd≢0q_d\not\equiv0 (the top coefficient is a nonzero polynomial in x′x'). Let Z′={qd=0}⊂Rk−1Z'=\{q_d=0\}\subset\mathbb{R}^{k-1}, null by the induction hypothesis.
- For x′∉Z′x'\notin Z', xk↦p(x′,xk)x_k\mapsto p(x',x_k) is a polynomial of degree exactly dd, so it has at most dd roots: the slice {xk:p(x′,xk)=0}\{x_k:p(x',x_k)=0\} is finite, hence null.
- The set {p=0}\{p=0\} is closed, hence measurable, so by Tonelli
λk({p=0})=∫Rk−1λ1({xk:p(x′,xk)=0})dx′=∫Z′(⋯ )dx′+∫Rk−1∖Z′0 dx′=0,\lambda_k(\{p=0\})=\int_{\mathbb{R}^{k-1}}\lambda_1\bigl(\{x_k:p(x',x_k)=0\}\bigr)dx'=\int_{Z'}(\cdots)dx'+\int_{\mathbb{R}^{k-1}\setminus Z'}0\,dx'=0,
because Z′Z' is null.

Remark. So "generic" in the sense of Zariski (complement of an algebraic set) implies "almost every" in the sense of Lebesgue. For example, almost every matrix is invertible, has distinct eigenvalues and is diagonalisable over C\mathbb{C}. Lesson. Induction on the number of variables plus Fubini is the standard way to handle null sets of polynomials.