TheoremBase

Proof sketch: every identity is checked on values, using the linearity of the maps involved and the vector space axioms of the codomain; the monoid and group structure then come from the general facts about monoids and their units.

Proof

Routine facts about the sum, the scalar multiple and the composite of linear maps as operations, and about the values of the inverse of a bijection, are used without comment (Toolkit for AL2).

Two functions with the same domain and codomain and the same values are equal (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (i)), so every identity between linear maps below is checked on values. We first show that sums and scalar multiples of linear maps are linear. Let S,T∈L(V,W)S,T\in\mathcal{L}(V,W), λ,μ∈K\lambda,\mu\in K and u,v∈Vu,v\in V. By Operations on Linear Maps (ii) and the linearity of SS and TT (Linear Maps, Linear Operators and Isomorphisms of Vector Spaces (i)),

(S+T)(u+v)=(Su+Sv)+(Tu+Tv)=(Su+Tu)+(Sv+Tv)=(S+T)u+(S+T)v,(S+T)(u+v)=(Su+Sv)+(Tu+Tv)=(Su+Tu)+(Sv+Tv)=(S+T)u+(S+T)v,

where the four terms are rearranged by Vector Space over a Field (i) and Vector Space over a Field (ii) in WW; and (S+T)(μv)=μSv+μTv=μ(S+T)v(S+T)(\mu v)=\mu Sv+\mu Tv=\mu(S+T)v by Vector Space over a Field (vii). Likewise, by Operations on Linear Maps (iii), (λT)(u+v)=λ(Tu+Tv)=λTu+λTv(\lambda T)(u+v)=\lambda(Tu+Tv)=\lambda Tu+\lambda Tv by Vector Space over a Field (vii), and

(λT)(μv)=λ(μTv)=(λμ)Tv=(μλ)Tv=μ(λTv)(\lambda T)(\mu v)=\lambda(\mu Tv)=(\lambda\mu)Tv=(\mu\lambda)Tv=\mu(\lambda Tv)

by Vector Space over a Field (v) and the commutativity of the multiplication of KK. So S+TS+T and λT\lambda T are linear.

Consequently the sum is a binary operation on the set L(V,W)\mathcal{L}(V,W) of Operations on Linear Maps (i), and the scalar multiplication is a map from K×L(V,W)K\times\mathcal{L}(V,W) to L(V,W)\mathcal{L}(V,W). The conditions Vector Space over a Field (i), Vector Space over a Field (ii), Vector Space over a Field (v), Vector Space over a Field (vi), Vector Space over a Field (vii) and Vector Space over a Field (viii) hold for these operations because, by Operations on Linear Maps (ii) and Operations on Linear Maps (iii), each reduces at every v∈Vv\in V to the same condition in WW; for instance, by Vector Space over a Field (viii) in WW,

((λ+μ)T)v=(λ+μ)Tv=λTv+μTv=(λT+μT)v.\bigl((\lambda+\mu)T\bigr)v=(\lambda+\mu)Tv=\lambda Tv+\mu Tv=(\lambda T+\mu T)v .

The conditions Vector Space over a Field (iii) and Vector Space over a Field (iv) are checked next. The zero map z:v↦0z:v\mapsto0 is linear, since z(u+v)=0=0+0z(u+v)=0=0+0 by The Zero Vector, Negatives and Differences in a Vector Space (i) and z(μv)=0=μ0z(\mu v)=0=\mu0 by Elementary Identities in a Vector Space (iii), and it is a zero of L(V,W)\mathcal{L}(V,W), as (T+z)v=Tv+0=Tv(T+z)v=Tv+0=Tv. It is the only one: any zero z′z' satisfies z=z+z′=z′+z=z′z=z+z'=z'+z=z'. For the negatives condition it therefore suffices to find, for each TT, a map whose sum with TT is zz, and (−1)T(-1)T does this: its values are (−1)Tv=−Tv(-1)Tv=-Tv by Elementary Identities in a Vector Space (iv), so (T+(−1)T)v=Tv+(−Tv)=0(T+(-1)T)v=Tv+(-Tv)=0 (The Zero Vector, Negatives and Differences in a Vector Space (ii)). Thus L(V,W)\mathcal{L}(V,W) is a vector space over KK, and its zero vector is zz by The Zero Vector, Negatives and Differences in a Vector Space (i). This proves (i).

Next, composition. Let RR, SS, S1S_{1}, S2S_{2}, TT, T1T_{1}, T2T_{2} and λ\lambda be as in (ii), and let u,u′∈Uu,u'\in U and μ∈K\mu\in K. By Operations on Linear Maps (iv), (ST)u=S(Tu)(ST)u=S(Tu), so the linearity of TT and of SS (Linear Maps, Linear Operators and Isomorphisms of Vector Spaces (i)) gives

(ST)(u+u′)=S(Tu+Tu′)=STu+STu′,(ST)(μu)=S(μTu)=μ STu,(ST)(u+u')=S(Tu+Tu')=STu+STu',\qquad(ST)(\mu u)=S(\mu Tu)=\mu\,STu,

and STST is linear. The values of R(ST)R(ST) and (RS)T(RS)T at uu are both R(S(Tu))R(S(Tu)), so the two maps are equal. The distributive laws hold on values: S(T1u+T2u)=ST1u+ST2uS(T_{1}u+T_{2}u)=ST_{1}u+ST_{2}u and S(λTu)=λSTuS(\lambda Tu)=\lambda STu by the linearity of SS, which gives S(T1+T2)=ST1+ST2S(T_{1}+T_{2})=ST_{1}+ST_{2} and S(λT)=λ(ST)S(\lambda T)=\lambda(ST); while (S1+S2)T=S1T+S2T(S_{1}+S_{2})T=S_{1}T+S_{2}T and (λS)T=λ(ST)(\lambda S)T=\lambda(ST) follow from Operations on Linear Maps (ii) and Operations on Linear Maps (iii) alone. This proves (ii).

By Operations on Linear Maps (v), IVv=vI_{V}v=v for v∈Vv\in V, so IV(u+v)=IVu+IVvI_{V}(u+v)=I_{V}u+I_{V}v and IV(μv)=μIVvI_{V}(\mu v)=\mu I_{V}v, and IV∈L(V)I_{V}\in\mathcal{L}(V). For T∈L(V,W)T\in\mathcal{L}(V,W) we have TIV=T=IWTTI_{V}=T=I_{W}T by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (iv). This proves (iii).

Taking U=V=WU=V=W in (ii), the composite of two operators on VV is again one, so (S,T)↦ST(S,T)\mapsto ST is a binary operation on L(V)\mathcal{L}(V) (a map by Maps from Functional Predicative Relations, and Families of Sections (ii)). It is associative, since R(ST)=(RS)TR(ST)=(RS)T, so L(V)\mathcal{L}(V) with it is a semigroup; and IVI_{V} is a neutral element by (iii) with W=VW=V. Hence L(V)\mathcal{L}(V) is a monoid with identity IVI_{V} by Monoids (i), which is (iv).

Now let T∈L(V,W)T\in\mathcal{L}(V,W) be an isomorphism of VV onto WW. By Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (vi), T−1T^{-1} is a bijective map from WW to VV with

T(T−1w)=w(w∈W),T−1(Tv)=v(v∈V).T(T^{-1}w)=w\quad(w\in W),\qquad T^{-1}(Tv)=v\quad(v\in V).

For w,w′∈Ww,w'\in W and μ∈K\mu\in K, the linearity of TT gives

T(T−1w+T−1w′)=w+w′,T(μT−1w)=μw,T(T^{-1}w+T^{-1}w')=w+w',\qquad T(\mu T^{-1}w)=\mu w,

and applying T−1T^{-1} to both sides of these equalities yields T−1(w+w′)=T−1w+T−1w′T^{-1}(w+w')=T^{-1}w+T^{-1}w' and T−1(μw)=μT−1wT^{-1}(\mu w)=\mu T^{-1}w. So T−1T^{-1} is linear, and as it is bijective it is an isomorphism of WW onto VV (Linear Maps, Linear Operators and Isomorphisms of Vector Spaces (iii)). This proves (v).

Finally, let T∈L(V)T\in\mathcal{L}(V). If TT is a unit, with inverse S∈L(V)S\in\mathcal{L}(V) (Units of a Monoid (i)), then TS=ST=IVTS=ST=I_{V}, so TT is bijective by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (vii). Conversely, if TT is bijective, it is an isomorphism of VV onto itself, so T−1∈L(V)T^{-1}\in\mathcal{L}(V) by (v), and TT−1=T−1T=IVTT^{-1}=T^{-1}T=I_{V} by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (vi); thus TT is a unit. That the set GL(V)\mathrm{GL}(V) of units, with the restriction of composition, is a group with identity IVI_{V} is Units of a Monoid: Unique Inverses, Products, and the Group of Units (v), applied to the monoid of (iv). This proves (vi).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…