We use the notation of the statement. Throughout, A(λv+μw)=λAv+μAw is claim 1 of Linearity, Compatibility with the Matrix Product, and a Norm Bound for the Matrix-Vector Product, and by claim 3 of that lemma there is C∈R with 0≤C such that
∥Av∥≤C∥v∥for every v∈Rn.(C)
In particular A0=0. We write e1,…,en for the standard basis vectors of Rn. If (pl)l∈N is a strictly increasing sequence in N then l≤pl for every l, by Principle of Induction for the Natural Numbers.
Claim 1. Suppose no such c exists. Then for every m∈N, the number 1/m being positive, there is hm∈Rn with ∥Ahm∥<m1∥hm∥; necessarily hm=0, since for hm=0 both sides would be 0. Put um=hm/∥hm∥; by claim 5 of Elementary Properties of the Euclidean Norm on Rn, ∥um∥=1 and
∥Aum∥=∥hm∥1∥Ahm∥<m1.
The points um lie in the bounded set Bˉ(0,1), so Bolzano-Weierstrass Theorem in Euclidean Space provides u∈Rn and a strictly increasing sequence (pl)l∈N in N with (upl)l∈N converging to u. By claim 6 of Elementary Properties of the Euclidean Norm on Rn applied to upl=u+(upl−u) and to u=upl+(u−upl), together with ∥u−upl∥=∥upl−u∥, which is claim 5 of that lemma with the scalar −1,
1−∥upl−u∥≤∥u∥≤1+∥upl−u∥,
and letting l increase, Arithmetic of Limits of Real Sequences and Order Properties of Limits of Real Sequences give ∥u∥=1; in particular u=0 by claim 3 of Elementary Properties of the Euclidean Norm on Rn. Moreover, by claim 6 of that lemma and (C),
∥Au∥≤∥A(u−upl)∥+∥Aupl∥≤C∥u−upl∥+pl1≤C∥u−upl∥+l1,
whose right-hand side can be made smaller than any prescribed positive real by taking l large, using The Archimedean Property of the Real Numbers. Hence ∥Au∥=0 and Au=0. Since also A0=0 and u=0, the map h↦Ah is not injective, contrary to hypothesis.
Claim 2. If Ah,Ah′∈A(Rn) and θ∈R with 0≤θ≤1, then θAh+(1−θ)Ah′=A(θh+(1−θ)h′)∈A(Rn), so A(Rn) is convex by Convex Subset of Rn; and 0=A0∈A(Rn).
Now suppose h↦Ah is injective and let c be as in claim 1. We verify the criterion of Sequential Characterization of Closed Subsets of a Metric Space. Let (zm)m∈N be a sequence in A(Rn) converging to z∈Rn; by injectivity each zm is Ahm for a uniquely determined hm, so no choice is involved. Since (zm) converges there is m0 with ∥zm−z∥≤1, hence ∥zm∥≤∥z∥+1, for m0≤m; letting R be the largest of the finitely many numbers ∥z∥+1 and ∥z1∥,…,∥zm0∥, we get ∥zm∥≤R for every m, and therefore ∥hm∥≤c−1∥Ahm∥≤c−1R by claim 1. The points hm thus lie in the bounded set Bˉ(0,c−1R), and Bolzano-Weierstrass Theorem in Euclidean Space provides h∈Rn and a strictly increasing (pl)l∈N with (hpl) converging to h. By claim 6 of Elementary Properties of the Euclidean Norm on Rn and (C),
∥Ah−z∥≤∥A(h−hpl)∥+∥zpl−z∥≤C∥h−hpl∥+∥zpl−z∥,
which can be made smaller than any prescribed positive real; hence ∥Ah−z∥=0 and z=Ah∈A(Rn). So A(Rn) is closed.
Claim 3. Suppose A(Rn)=Rn and pick b∈Rn∖A(Rn). By claim 2 the set A(Rn) is nonempty, convex and closed, so claim 1 of Nearest-Point Projection onto a Nonempty Closed Convex Subset of Euclidean Space defines the nearest point π(b)∈A(Rn) and claim 2 of that lemma gives
(b−π(b))⋅(w−π(b))≤0for every w∈A(Rn).
Put ν0=b−π(b); then ν0=0, since π(b) lies in A(Rn) and b does not. Write π(b)=Ag. For h∈Rn and t∈R the point w=A(g+th)=π(b)+tAh lies in A(Rn), so the displayed inequality gives t(ν0⋅(Ah))≤0 for every t∈R, using Bilinearity and Symmetry of the Dot Product on Rn. Taking t of either sign forces ν0⋅(Ah)=0. Hence ν=ν0/∥ν0∥, which has norm 1 by claim 5 of Elementary Properties of the Euclidean Norm on Rn, satisfies ν⋅(Ah)=0 for every h, contrary to hypothesis. Therefore A(Rn)=Rn.
Claim 4. By claim 3, for each i∈{1,…,n} there is bi∈Rn with Abi=ei, and it is unique by injectivity. Let B be the real n×n matrix with Bji=(bi)j. For k∈Rn, Matrix-Vector Product gives (Bk)j=∑i=1nBjiki=∑i=1nki(bi)j, that is Bk=∑i=1nkibi. Claim 1 of Linearity, Compatibility with the Matrix Product, and a Norm Bound for the Matrix-Vector Product gives A(v+w)=Av+Aw and A(μv)=μAv for two summands, and hence, by Principle of Induction for the Natural Numbers on the number of summands, A(∑i=1rμivi)=∑i=1rμiAvi for every r∈N. Therefore
A(Bk)=i=1∑nkiAbi=i=1∑nkiei=k,
the last equality because the jth coordinate of ∑ikiei is kj, by the description of the standard basis vectors in Orthonormal Families, Standard Basis Vectors, and Plane Rotations of Euclidean Space. By claim 2 of Linearity, Compatibility with the Matrix Product, and a Norm Bound for the Matrix-Vector Product, (AB)k=A(Bk)=k for every k. Taking k=eβ and using (Meβ)α=∑iMαi(eβ)i=Mαβ for any real n×n matrix M, which is Matrix-Vector Product, we get (AB)αβ=(eβ)α=(In)αβ for all α,β, where In is the identity matrix; that is, AB=In.
For the other side, let h∈Rn. Then A(B(Ah))=Ah by what was just proved applied to k=Ah, so B(Ah)=h by injectivity, that is (BA)h=h=Inh for every h by claim 2 of Linearity, Compatibility with the Matrix Product, and a Norm Bound for the Matrix-Vector Product and claim 2 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum. Reading off entries as before gives BA=In. Hence B is an inverse of A in the sense of Inverse Matrix and Invertible Real Square Matrix, so A is invertible and A−1=B by Uniqueness of the Matrix Inverse.
Finally, let k∈Rn and put h=A−1k, so that Ah=k. Claim 1 gives ∥k∥=∥Ah∥≥c∥h∥, and dividing by the positive number c gives ∥A−1k∥≤c−1∥k∥.