4.2 Isomorphisms of Vector Spaces
Motivation
P2 := {a0 + a1x + a2x2|ai ∈ R}
l
R3 = {(a0, a1, a2)|ai ∈ R}
형태는 다르게 보이지만, 구조는 같은 vector space 들을 골라내자.
함수를 나타내는 다양한 표현 방식을 보자.
S T f
a b c
ㄱ ㄴ ㄷ
(I) f (a) = 1, f (b) = 7, f (c) = 4 (II) f : a → ㄱ
b → ㄷ c → ㄴ (III) (a,ㄱ) ∈ f
(b,ㄷ) ∈ f
(c,ㄴ) ∈ f
f = {(a,ㄱ), (b,ㄷ), (c,ㄴ)} ⊂ A× ㄱ
Definition 4.2.1.
A mapping(function, transformation) from S to T is a set f = {(s, t)|s ∈ S, t ∈ T } such that
for s ∈ S, there exists exactly one t ∈ T s.t. (s, t) ∈ f or f (s) = t;
or s1 = s2 in S ⇒ f (s1) = f (s2) in T let f ⊂ S × T,
say f : well-defined (as a function) if
S1 = S2 ⇒ f (S1) = f (S2); 함수가 정의되었는지 확인할 때 사용
S T
“exactly one t ∈ T ” means:
(i) f (s) 값은 존재해야 한다.
(ii) f (s) 값은 두개이상이 되면 안된다.
Definition 4.2.2.
f is one-to-one (injective) if for a, b ∈ S, f (a) = f (b) ⇒ a = b or
a 6= b ⇒ f (a) 6= (b)
S T
Definition 4.2.3.
f is onto (surjective) if for every t ∈ T , there is s ∈ S s.t. f (s) = t
S T
Definition 4.2.4.
f is bijective if f is one-to-one and onto
Definition 4.2.5.
f : U → W : function on vector spaces say f has a homomorphy property if
f (au + bv) = af (u) + bf (v) for any a, b : scalar & u, v ∈ U
“f has a homomorphy property ” means
the vector space structure of U is identical to the vector space structure of V (actually the image f (u))
Definition 4.2.6.
let f : U → V : mapping
define f is an isomorphism if 0. f is well-defined 1. f is one-to-one.
2. f is onto.
3. f has homomorphy.
call such U, V are isomorphic
Example 4.2.7. define f : R3 −→ P2 as
(a1, a2, a3) 7→ a3 + (a2 − a1)x + (a1 + a3)x2 show f : isomorphism
(0) show well-defined i.e.
u = v ⇒ f (u) = f (v)
let u, v ∈ R3, u = (a1, a2, a3), v = (b1, b2, b3) assume u = v i.e.
a1 = b1, a2 = b2, a3 = b3, −(?)
then f (u) = a3 + (a2 − a1)x + (a1 + a3)x2 and f (v) = b3 + (b2 − b1)x + (b1 + b3)x2
form (?), a3 = b3, a2 − a1 = b2 − b1, a1 + a3 = b1 + b3
∴ f (u) = f (v)
(1) show one-to-one i.e.
f (u) = f (v) ⇒ u = v assume f (u) = f (v) i.e.
(??) a3 = b3, a2 − a1 = b2 − b1, a1 + a3 = b1 + b3 from (??), a1 = b1, a2 = b2, a3 = b3
∴ u = v
hence f : one-to-one
(2) show f : onto, i.e.
∀w ∈ P2, ∃ u ∈ R3 s.t. f (u) = w let w ∈ P2, write w = α1 + α2x + α3x2 let u = (a1, a2, a3) ∈ R3
want f (u) = a3 + (a2 − a1)x + (a1 + a3)x2
= α1 + α2x + α3x2
a3 = α1, a2 − a1 = α2, a1 + a3 = α3
⇒ a3 = α1, a1 = α3 − α1, a2 = α1 + α2 − α3 let u = (−α1 + α3, α1 + α2 − α3, α1)
then f (u) = w
∴ f : onto.
(3) show f : homomorphy, i.e.
f (au + bv) = af (u) + bf (v) let u = (a1, a2, a3), v = (b1, b2, b3)
f (au + bv) = f (aa1 + bb1, aa2 + bb2, aa3 + bb3)
= (aa3 + bb3) + (aa2 + bb2 − aa1 − bb1)x + (aa1 + bb1 + aa3 + bb3)x2
= aa3 + (aa2 − aa1)x + (aa1 + aa3)x2 + bb3 + (bb2 − bb1)x + (bb1 + bb3)x2
= a(a + (a − a )x + (a + a )x2) + b(b + (b − b )x + (b + b )x2)
= af (a1, a2, a3) + bf (b1, b2, b3)
= af (u) + bf (v)
∴ f : homomorphy therefore f : isomorphism
Example 4.2.8. define h : R −→ P2 as (a1, a2, a3) 7→ a3 + (a3 − a1)x + a3x2 not isomorphism.
because, not one-to-one, h(0, 0, 0) = h(0, 1, 0) = 0
(성립하지 않는경우 구체적인 반례제시; counterexample)
Theorem 4.2.9.
V : n − dim vector space over F Fn = {(a1, · · · , an)|ai ∈ F}
then V ≈ Fn; isomorphic (structure 상 일치한다.)
idea of proof. let B = {v1, · · · , vn} basis for V for u ∈ V , can write uniquely
u = a1v1 + a2v2 + · · · + anvn
where ai ∈ F, ai : unique define f : V → Fn
u 7→ (a1, a2, · · · , an)
(0) well-defined?
let u = P aivi, v = P bivi ∈ V assume u = v
then u − v = 0 = P(ai − bi)vi
since {vi} : linearly independent, ai − bi = 0, ∀ i
∴ ai = bi, ∀ i
∴ (a1, a2, · · · , an) = (b1, b2, · · · , bn)
⇒ f (u) = f (v)
(1) one-to-one?
f (u) = f (v) ⇒ ai = bi, ∀
⇒ P aivi = P bivi
⇒ u = v
(2) onto?
let a = (a1, · · · , an) ∈ Fn
choose u = a1v1 + a2v2 + · · · + an then f (u) = (a1, · · · , an) = a
(3) homomorphic?
f (au + bv) = f (aP aivi + b P bivi)
= f (P(aai + bbi)vi)
= (a · a1 + b · b1, · · · , a · an + b · bn)
= a(a1, · · · , an) + b(b1, · · · , bn)
= af (u) + bf (v)
∴ homorphism
therefore f : isomorphism and V ≈ Fn