Idea. Closedness is a compactness argument (eigenvalues cannot escape to infinity). For n=2 the condition becomes a single inequality on (tr,det).
Step 1: R is closed. Let Ak→A with Ak∈R and real eigenvalues λk. If Akv=λkv with ∣v∣=1, then ∣λk∣≤∥Ak∥. As (Ak) converges, ∥Ak∥ is bounded, so (λk) is bounded and has a convergent subsequence λkj→λ∈R. By continuity of det,
det(A−λI)=jlimdet(Akj−λkjI)=0,
so λ is a real eigenvalue of A and A∈R.
Step 2: the case n=2. The characteristic polynomial is t2−(trA)t+detA, with discriminant Δ(A)=(trA)2−4detA. It has a real root iff Δ≥0:
R={Δ≥0}.
Step 3: interior. We claim intR={Δ>0}.
- {Δ>0} is open (as Δ is continuous) and contained in R.
- Let Δ(A)=0 with A=(acbd) and let J=(01−10). Then A+εJ=(ac+εb−εd) has the same trace and det(A+εJ)=detA−ε(b−c)+ε2, so
Δ(A+εJ)=Δ(A)+4ε(b−c)−4ε2=4ε(b−c)−4ε2.
If b=c this is −4ε2<0 for any ε=0; if b=c choose the sign of ε so that ε(b−c)<0. In both cases Δ(A+εJ)<0 for small ε=0, so A+εJ∈/R and A∈/intR.
Check. A=(1011) (Δ=0). For ε=−0.01 the eigenvalues of A+εJ are 1±0.1005i (non-real), while for ε=+0.01 they are 1±0.0995 (real). So A is a boundary point.
Remark.
- For odd n the characteristic polynomial has odd degree, so every real matrix has a real eigenvalue and R=Mn(R) trivially.
- For n=2 the boundary of R is {Δ=0}: matrices with a double real eigenvalue. These are the places where a pair of real eigenvalues collides and leaves the real line.