9
Dual representations of vector spaces Two important ways to represent a vector space V : V =solution set of homogeneous linear system a 1 · x =0,..., a m · x =0 Equivalently, V = Null 2 6 4 a 1 . . . a m 3 7 5 V = Span {b 1 ,..., b n } Equivalently, V = Row 2 6 4 b 1 . . . b n 3 7 5 How to transform between these two representations? From left to right: Given system a 1 · x =0,..., a m · x = 0, find generators b 1 ,..., b n for solution set Equivalently, given matrix A, find B such that Row B = Null A From right to left: Given generators b 1 ,..., b n , find system a 1 · x =0,..., a m · x = 0 whose solution set equals Span {b 1 ,..., b n } Equivalently, given matrix B , find matrix A such that Null A = Row B

Dual Representation

Embed Size (px)

DESCRIPTION

Linear Algebra - Dual Representation.

Citation preview

  • Dual representations of vector spaces

    Two important ways to represent a vector space V:V =solution set of homogeneous linearsystem a1 x = 0, . . . ,am x = 0

    Equivalently, V = Null

    264 a1...am

    375V = Span {b1, . . . ,bn}

    Equivalently, V = Row

    264 b1...bn

    375

    How to transform between these two representations?

    From left to right: Given system a1 x = 0, . . . ,am x = 0, find generatorsb1, . . . ,bn for solution set

    Equivalently, given matrix A, find B such that Row B = Null A

    From right to left: Given generators b1, . . . ,bn, find systema1 x = 0, . . . ,am x = 0 whose solution set equals Span {b1, . . . ,bn}

    Equivalently, given matrix B , find matrix A such that Null A = Row B

  • Dual representations of vector spacesTwo important ways to represent a vector space:

    As the solution set of homogeneous linear systema1 x = 0, . . . ,am x = 0

    Equivalently, Null

    264 a1...am

    375

    As Span {b1, . . . ,bk}

    Equivalently,

    Row

    264 b1...bk

    375How to transform between these two representations?

    From left to right: Given homogeneous linear system a1 x = 0, . . . ,am x = 0,find generators b1, . . . ,bk for solution set

    From right to left:Given generators b1, . . . ,bk ,find homogeneous linear system a1 x = 0, . . . ,am x = 0 whose solution set equalsSpan {b1, . . . ,bk}

  • The dual of a vector spaceFrom left to right: Given system a1 x = 0, . . . ,am x = 0,find generators b1, . . . ,bk for solution set

    Solution set is the set of vectors u suchthat a1 u = 0, . . . ,am u = 0264 a1...

    am

    375| {z }

    A

    24 x35 =

    264 0...0

    375Equivalent: Given rows of a matrix A, findgenerators for Null A

    rows of a matrix A#

    Algorithm X

    #generators for Null A

    If u is such a vector thenu (1 a1 + + m am) = 0

    for any coecients 1, . . . ,m.

    Definition: The set of vectors u such thatu v = 0 for every vector v in V is calledthe dual of V. Dual is written as V.Example: The dual of Span {a1, . . . ,am}is the solution set fora1 x = 0, . . . ,am x = 0

    generators for a vector space V#

    Algorithm X

    #generators for dual space V

  • Dual of a vector spaceDefinition: For a subspace V of Fn, the dual space of V, written V, is

    V = {u 2 Fn : u v = 0 for every vector v 2 V}Example over R: Let V = Span {[1, 0, 1], [0, 1, 0]}. Then V = Span {[1, 0,1]}:I Note that [1, 0,1] [1, 0, 1] = 0 and [1, 0,1] [0, 1, 0] = 0.

    Therefore [1, 0,1] v = 0 for every vector v in Span {[1, 0, 1], [0, 1, 0]}.I For any scalar ,

    [1, 0,1] v = ([1, 0,1] v) = 0for every vector v in Span {[1, 0, 1], [0, 1, 0]}.

    I Which vectors u satisfy u v = 0 for every vector v in Span {[1, 0, 1], [0, 1, 0]}?Only scalar multiples of [1, 0,1].

    Example over GF (2): Let V = Span {[1, 0, 1], [0, 1, 0]}. Then V = Span {[1, 0, 1]}:I Note that [1, 0, 1] [1, 0, 1] = 0 (remember GF (2) addition) and

    [1, 0, 1] [0, 1, 0] = 0.I Therefore [1, 0, 1] v = 0 for every vector v in Span {[1, 0, 1], [0, 1, 0]}.I Of course [0, 0, 0] v = 0 for every vector v in Span {[1, 0, 1], [0, 1, 0]}.I [1, 0, 1] and [0, 0, 0] are the only such vectors.

  • Dual space

    Example over R: Let V = Span {[1, 0, 1], [0, 1, 0]}. Then V = Span {[1, 0,1]}dimV + dimV = 3Example over GF (2): Let V = Span {[1, 0, 1], [0, 1, 0]}. Then V = Span {[1, 0, 1]}.dimV + dimV = 3Example over R: Let V = Span {[1, 0, 1, 0], [0, 1, 0, 1]}.Then V = Span {[1, 0,1, 0], [0, 1, 0,1]}. dimV + dimV = 4Dual Dimension Theorem: dimV + dimV = nProof: Let a1, . . . ,am be generators for V.

    Let A =

    264 a1...am

    375Then V = Null A.

    Rank-Nullity Theorem states that

    rank A + nullity A = ndimV + dimV = n

    QED

  • The dual of a vector space

    Definition: For a subspace V of Fn, the dual space of V, written V, isV = {u 2 Fn : u v = 0 for every vector v 2 V}

    rows of a matrix A generators for a vector space V# #

    Algorithm X = Algorithm X

    # #generators for Null A generators for dual space V

    From left to right: Given system a1 x = 0, . . . ,am x = 0, find generatorsb1, . . . ,bk for solution set

    Algorithm X solves left-to-right problem....

    what about right-to-left problem?

  • The dual of a vector space

    From left to right: Given systema1 x = 0, . . . ,am x = 0,find generators b1, . . . ,bk for solution set

    generators for a vector space V#

    Algorithm X

    #generators for dual space V

    What happens if we apply Algorithm X togenerators for dual space V?

    generators for dual space V#

    Algorithm X

    #generators for dual of dual space (V)

    From right to left: Given generatorsb1, . . . ,bk , find systema1 x = 0, . . . ,am x = 0 whose solutionset equals Span {b1, . . . ,bk}generators for dual space V

    #Algorithm Y

    #generators for original space V

    Theorem: (V) = V (The dual of thedual is the original space.)

    Theorem shows:Algorithm X = Algorithm Y

    We still must prove the Theorem...

  • Dual spaceTheorem: (V) = V (The dual of the dual is the original space.)Proof:Let a1, . . . ,am be a basis for V. Let b1, . . . ,bk be a basis for V.Since b1 v = 0 for every vector v in V,

    b1 a1 = 0,b1 a2 = 0, . . . ,b1 am = 0Similarly bi a1 = 0,bi a2 = 0, . . . ,bi am = 0 for i = 1, 2, . . . , k .Reorganizing,

    a1 b1 = 0,a1 b2 = 0, . . . ,a1 bk = 0which implies that a1 u = 0 for every vector u in Span {b1, . . . ,bk}| {z }

    V

    This shows a1 is in (V). Similarly a2 is in (V), a4 is in (V), ..., am is in (V).Therefore every vector in Span {a1,a2, . . . ,am} is in (V ).Thus Span {a1,a2, . . . ,am}| {z }

    Vis a subspace of (V).

    To show that these are equal, we must show that dimV = dim(V).By Dual Dimension Theorem, dimV + dimV = n.By Dual Dimension Theorem applied to V, dimV + dim(V) = n.Together these equations show dimV = dim(V) QED

    transdissolve13[duration=0.2]

  • Dual spaceTheorem: (V) = V (The dual of the dual is the original space.)Proof:Reorganizing,

    a1 b1 = 0,a1 b2 = 0, . . . ,a1 bk = 0which implies that a1 u = 0 for every vector u in Span {b1, . . . ,bk}| {z }

    V

    This shows a1 is in (V). Similarly a2 is in (V), a4 is in (V), ..., am is in (V).Therefore every vector in Span {a1,a2, . . . ,am} is in (V ).Thus Span {a1,a2, . . . ,am}| {z }

    Vis a subspace of (V).

    To show that these are equal, we must show that dimV = dim(V).By Dual Dimension Theorem, dimV + dimV = n.By Dual Dimension Theorem applied to V, dimV + dim(V) = n.Together these equations show dimV = dim(V) QED

    transdissolve13[duration=0.2]