< Return to Video

Matrices: Reduced Row Echelon Form 3

  • 0:01 - 0:04
    I have here three linear
    equations of four unknowns.
  • 0:04 - 0:07
    And like the first video, where
    I talked about reduced
  • 0:07 - 0:11
    row echelon form, and solving
    systems of linear equations
  • 0:11 - 0:14
    using augmented matrices, at
    least my gut feeling says,
  • 0:14 - 0:17
    look, I have fewer equations
    than variables, so I probably
  • 0:17 - 0:18
    won't be able to constrain
    this enough.
  • 0:18 - 0:20
    Or maybe I'll have an infinite
    number of solutions.
  • 0:20 - 0:22
    But let's see if I'm right.
  • 0:22 - 0:25
    So let's construct the augmented
    matrix for this
  • 0:25 - 0:27
    system of equations.
  • 0:27 - 0:33
    My coefficients on the x1
    terms are 1, 1, and 2.
  • 0:33 - 0:35
    Coefficients on the x2
    are 2, 2, and 4.
  • 0:39 - 0:44
    Coefficients on x3
    are 1, 2, and 0.
  • 0:44 - 0:46
    There's of course no x3 term,
    so we can view it as a 0
  • 0:46 - 0:47
    coefficient.
  • 0:47 - 0:50
    Coefficients on the x4 are
    1, minus 1, and 6.
  • 0:54 - 0:56
    And then on the right-hand side
    of the equals sign, I
  • 0:56 - 1:01
    have 8, 12, and 4.
  • 1:01 - 1:04
    There's my augmented matrix,
    now let's put this guy into
  • 1:04 - 1:08
    reduced row echelon form.
  • 1:08 - 1:11
    The first thing I want to do is,
    I want to zero out these
  • 1:11 - 1:12
    two rows right here.
  • 1:12 - 1:15
    So what can we do?
  • 1:15 - 1:19
    I'm going to keep my first row
    the same for now, so it's 1,
  • 1:19 - 1:23
    2, 1, 1, 8.
  • 1:23 - 1:28
    That line essentially represents
    my equals sign.
  • 1:28 - 1:31
    What I can do is, let me
    subtract-- let me replace the
  • 1:31 - 1:35
    second row with the second
    row minus the first row.
  • 1:35 - 1:46
    So 1 minus 1 is 0, 2 minus 2
    is 0, 2 minus 1 is 1, 1--
  • 1:46 - 1:55
    negative 1 minus 1 is minus 2,
    and then 12 minus 8 is 4.
  • 1:55 - 1:58
    There you go, that looks good so
    far, it looks like column,
  • 1:58 - 2:01
    or x2 which is represented by
    column two, looks like it
  • 2:01 - 2:05
    might be a free variable, but
    we're not 100% sure yet.
  • 2:05 - 2:07
    Let's do all of our rows.
  • 2:07 - 2:12
    So let's take-- to get rid of
    this guy right here, let's
  • 2:12 - 2:15
    replace our third equation with
    the third equation minus
  • 2:15 - 2:18
    two times our first equation.
  • 2:18 - 2:27
    So we get 2 minus 2 times 1 is
    0, 4 minus 2 times 2, well
  • 2:27 - 2:36
    that's 0, 0 minus 2 times
    1, that's minus 2.
  • 2:36 - 2:40
    6 minus 2 times 1, well
    that's 4, right?
  • 2:40 - 2:42
    6 minus 2.
  • 2:42 - 2:47
    And then 4 minus 2 times
    8, is minus 16, 4
  • 2:47 - 2:53
    minus 16 is minus 12.
  • 2:53 - 2:54
    Now what can we do?
  • 2:54 - 2:57
    Well, let's see if we can
    get rid of this minus
  • 2:57 - 2:58
    2 term right there.
  • 2:58 - 3:04
    So let me rewrite my
    augmented matrix.
  • 3:04 - 3:08
    I'm going to keep row two the
    same this time, so I get a 0,
  • 3:08 - 3:12
    0, 1, minus 2, and essentially
    my equals sign, or the
  • 3:12 - 3:15
    augmented part of the matrix.
  • 3:15 - 3:18
    And now let's see
    what I can do.
  • 3:18 - 3:20
    Let me get rid of this 0 up
    here, because I want to get
  • 3:20 - 3:21
    into reduced row echelon form.
  • 3:21 - 3:24
    So any of my pivot entries,
    which are always going to have
  • 3:24 - 3:27
    the coefficient 1, or the entry
    1, it should be the only
  • 3:27 - 3:29
    non-zero term in my row.
  • 3:29 - 3:31
    How do I get rid of
    this one here?
  • 3:31 - 3:36
    Well I can subtract-- I can
    replace row one with row 1
  • 3:36 - 3:38
    minus row 2.
  • 3:38 - 3:48
    So 1 minus 0 is 1, 2 minus 0 is
    2, 1 minus 1 is 0, 1 minus
  • 3:48 - 3:53
    minus 2, that's 1 plus
    2, which is 3.
  • 3:53 - 3:57
    And then 8 minus 4 is 4.
  • 3:57 - 3:59
    And now how can I get
    rid of this guy?
  • 3:59 - 4:07
    Well let me replace row 3 with
    row 3 plus 2 times row 1.
  • 4:07 - 4:10
    Sorry, with row 3 plus
    2 times row 2.
  • 4:10 - 4:10
    Right?
  • 4:10 - 4:13
    Because then you'd have minus
    2, plus 2 times this, and
  • 4:13 - 4:13
    they'd cancel out.
  • 4:13 - 4:15
    So let's see the zeros.
  • 4:15 - 4:18
    0 plus 2 times 0, that's 0.
  • 4:18 - 4:26
    0 plus 2 times 0, that's 0,
    minus 2 plus 2 times 1 is 0.
  • 4:26 - 4:35
    4 plus 2 times minus 2, that's
    4 minus 4, that's 0.
  • 4:35 - 4:40
    And then I have minus
    12, plus 2 times 4.
  • 4:40 - 4:44
    That's minus 12 plus
    8, that's minus 4.
  • 4:47 - 4:50
    Now, this is interesting right
    now-- this is interesting.
  • 4:50 - 4:53
    I have essentially put this in
    reduced row echelon form.
  • 4:53 - 4:57
    I have two pivot entries, that's
    a pivot entry right
  • 4:57 - 4:59
    there, and that's a pivot
    entry right there.
  • 4:59 - 5:03
    They're the only non-zero term
    in their respective columns.
  • 5:03 - 5:05
    And this is just kind of a style
    issue, but this pivot
  • 5:05 - 5:08
    entry is in a lower
    row than that one.
  • 5:08 - 5:13
    So it's in a column to the right
    of this one right there.
  • 5:13 - 5:17
    And I just inspected, this looks
    like a-- this column two
  • 5:17 - 5:19
    looks kind of like a free
    variable-- there's no pivot
  • 5:19 - 5:20
    entry there, no pivot
    entry there.
  • 5:20 - 5:23
    But let's see, let's
    map this back to
  • 5:23 - 5:25
    our system of equations.
  • 5:25 - 5:27
    These are just numbers to
    me and I just kind of
  • 5:27 - 5:30
    mechanically, almost like a
    computer, put this in reduced
  • 5:30 - 5:31
    row echelon form.
  • 5:31 - 5:33
    Actually, almost exactly
    like a computer.
  • 5:33 - 5:35
    But let me put it back to my
    system of linear equations, to
  • 5:35 - 5:37
    see what our result is.
  • 5:37 - 5:42
    So we get 1 times x1, let
    me write it in yellow.
  • 5:42 - 5:51
    So I get 1 times x1, plus 2
    times x2, plus 0 times x3,
  • 5:51 - 5:55
    plus 3 times x4 is equal to 4.
  • 5:55 - 5:57
    Obviously I could ignore this
    term right there, I didn't
  • 5:57 - 5:59
    even have to write it.
  • 5:59 - 5:59
    Actually.
  • 5:59 - 6:00
    I'm not going to write that.
  • 6:00 - 6:05
    Then I get 0 times x1, plus 0
    times x2, plus 1 times x3, so
  • 6:05 - 6:06
    I can just write that.
  • 6:06 - 6:07
    I'll just write the one.
  • 6:07 - 6:13
    1 times x3, minus 2 times
    x4, is equal to 4.
  • 6:13 - 6:15
    And then this last term,
    what do I get?
  • 6:15 - 6:19
    I get 0 x1, plus 0 x2 plus 0
    x3 plus 0 x4, well, all of
  • 6:19 - 6:21
    that's equal to 0, and I've got
    to write something on the
  • 6:21 - 6:22
    left-hand side.
  • 6:22 - 6:25
    So let me just write a 0,
    and that's got to be
  • 6:25 - 6:28
    equal to minus 4.
  • 6:28 - 6:31
    Well this doesn't make
    any sense whatsoever.
  • 6:31 - 6:33
    0 equals minus 4.
  • 6:33 - 6:36
    This is this is a nonsensical
    constraint, this is
  • 6:36 - 6:37
    impossible.
  • 6:37 - 6:40
    0 can never equal minus 4.
  • 6:40 - 6:43
    This is impossible.
  • 6:46 - 6:49
    Which means that it is
    essentially impossible to find
  • 6:49 - 6:54
    an intersection of these three
    systems of equations, or a
  • 6:54 - 6:56
    solution set that satisfies
    all of them.
  • 6:56 - 6:58
    When we looked at this
    initially, at the beginning of
  • 6:58 - 7:01
    the of the video, we said
    there are only three
  • 7:01 - 7:02
    equations, we have four
    unknowns, maybe there's going
  • 7:02 - 7:04
    to be an infinite set
    of solutions.
  • 7:04 - 7:07
    But turns out that these three--
    I guess you can call
  • 7:07 - 7:11
    them these three surfaces--
    don't intersect in r4.
  • 7:11 - 7:12
    Right?
  • 7:12 - 7:15
    These are all four dimensional,
    we're dealing in
  • 7:15 - 7:19
    r4 right here, because we have--
    I guess each vector has
  • 7:19 - 7:22
    four components, or we have four
    variables, is the way you
  • 7:22 - 7:23
    could think about it.
  • 7:23 - 7:26
    And it's always hard to
    visualize things in r4.
  • 7:26 - 7:29
    But if we were doing things
    in r3, we can imagine the
  • 7:29 - 7:35
    situation where, let's say
    we had two planes in r3.
  • 7:35 - 7:37
    So that's one plane right there,
    and then I had another
  • 7:37 - 7:40
    completely parallel
    plane to that one.
  • 7:40 - 7:42
    So I had another completely
    parallel plane
  • 7:42 - 7:43
    to that first one.
  • 7:43 - 7:47
    Even though these would be two
    planes in r3, so let me give
  • 7:47 - 7:48
    an example.
  • 7:48 - 7:52
    So let's say that this first
    plane was represented by the
  • 7:52 - 8:03
    equation 3x plus 6y plus 9z is
    equal to 5, and the second
  • 8:03 - 8:08
    plane was represented by the
    equation 3x plus 6y plus 9z is
  • 8:08 - 8:11
    equal to 2.
  • 8:11 - 8:16
    These two planes in r3-- this is
    the case of r3, so this is
  • 8:16 - 8:18
    r3 right here.
  • 8:18 - 8:20
    These two planes, clearly
    they'll never intersect.
  • 8:20 - 8:24
    Because obviously this one has
    the same coefficients adding
  • 8:24 - 8:26
    up to 5, this one has the same
    coefficient adding up to 2.
  • 8:26 - 8:29
    And when, if we just looked at
    this initially, if it wasn't
  • 8:29 - 8:31
    so obvious, we would have
    said, we have only two
  • 8:31 - 8:34
    equations with three unknowns,
    maybe this has an infinite set
  • 8:34 - 8:34
    of solutions.
  • 8:34 - 8:37
    But it won't be the case,
    because you can actually just
  • 8:37 - 8:40
    subtract this equation, from the
    bottom equation, from the
  • 8:40 - 8:40
    top equation.
  • 8:40 - 8:42
    And what do you get?
  • 8:42 - 8:44
    You would get a very familiar--
    so if you just
  • 8:44 - 8:46
    subtract the bottom equation
    from the top equation, and you
  • 8:46 - 8:50
    get 3x minus 3x, 6y minus 6y, 9z
    minus 9z-- actually, let me
  • 8:50 - 8:52
    do it right here.
  • 8:52 - 8:55
    So for that minus that, you get
    zero is equal to 5 minus
  • 8:55 - 8:57
    2, which is 3.
  • 8:57 - 8:59
    Which is a very similar result
    that we got up there.
  • 8:59 - 9:03
    So when you have two parallel
    planes, in this case in r3, or
  • 9:03 - 9:07
    really to any kind of two
    parallel equations, or a set
  • 9:07 - 9:09
    of parallel equations,
    they won't intersect.
  • 9:09 - 9:12
    And you're going to get, when
    you put it in reduced row
  • 9:12 - 9:14
    echelon form, or you just do
    basic elimination, or you
  • 9:14 - 9:17
    solve the systems, you're going
    to get a statement that
  • 9:17 - 9:20
    zero is equal to something, and
    that means that there are
  • 9:20 - 9:21
    no solutions.
  • 9:24 - 9:26
    So the general take-away,
    if you have zero equals
  • 9:26 - 9:28
    something, no solutions.
  • 9:28 - 9:32
    If you have the same number of
    pivot variables, the same
  • 9:32 - 9:36
    number of pivot entries as you
    do columns, so if you get the
  • 9:36 - 9:39
    situations-- let me write this
    down, this is good to know.
  • 9:39 - 9:42
    if you have zero is equal
    to anything, then
  • 9:42 - 9:45
    that means no solution.
  • 9:45 - 9:47
    If you're dealing with r3,
    then you probably have
  • 9:47 - 9:51
    parallel planes, in r2 you're
    dealing with parallel lines.
  • 9:51 - 9:56
    If you have the situation where
    you have the same number
  • 9:56 - 10:03
    of pivot entries as columns, so
    it's just 1, 1, 1, 1, this
  • 10:03 - 10:05
    is the case of r4 right there.
  • 10:05 - 10:07
    I think you get the idea.
  • 10:07 - 10:10
    That equals a, b, c, d.
  • 10:10 - 10:12
    Then you have a unique
    solution.
  • 10:16 - 10:19
    Now if, you have any free
    variables-- so free variables
  • 10:19 - 10:23
    look like this, so let's say we
    have 1, 0, 1, 0, and then I
  • 10:23 - 10:30
    have the entry 1, 1,
    let me be careful.
  • 10:30 - 10:33
    0, let me do it like this.
  • 10:33 - 10:41
    1, 0, 0, and then I have the
    entry 1, 2, and then I have a
  • 10:41 - 10:44
    bunch of zeroes over here.
  • 10:44 - 10:45
    And then this has to equal
    zero-- remember, if this was a
  • 10:45 - 10:48
    bunch of zeroes equaling some
    variable, then I would have no
  • 10:48 - 10:50
    solution, or equalling some
    constant, let's say this is
  • 10:50 - 10:53
    equal to 5, this
    is equal to 2.
  • 10:53 - 10:55
    If this is our reduced row
    echelon form that we
  • 10:55 - 10:59
    eventually get to, then we have
    a few free variables.
  • 10:59 - 11:03
    This is a free, or I guess we
    could call this column a free
  • 11:03 - 11:05
    column, to some degree this
    one would be too.
  • 11:05 - 11:07
    Because it has no
    pivot entries.
  • 11:07 - 11:09
    These are the pivot entries.
  • 11:09 - 11:13
    So this is variable x2 and
    that's variable x4.
  • 11:13 - 11:15
    Then these would be
    free, we can set
  • 11:15 - 11:16
    them equal to anything.
  • 11:16 - 11:19
    So then here we have unlimited
    solutions,
  • 11:19 - 11:22
    or no unique solutions.
  • 11:22 - 11:24
    And that was actually the
    first example we saw.
  • 11:24 - 11:26
    And these are really the three
    cases that you're going to see
  • 11:26 - 11:28
    every time, and it's good to
    get familiar with them so
  • 11:28 - 11:30
    you're never going to get
    stumped up when you have
  • 11:30 - 11:33
    something like 0 equals minus
    4, or 0 equals 3.
  • 11:33 - 11:35
    Or if you have just a bunch of
    zeros and a bunch of rows.
  • 11:35 - 11:37
    I want to make that
    very clear.
  • 11:37 - 11:41
    Sometimes, you see a bunch of
    zeroes here, on the left-hand
  • 11:41 - 11:44
    side of the augmented divide,
    and you might say, oh maybe I
  • 11:44 - 11:46
    have no unique solutions,
    I have an
  • 11:46 - 11:47
    infinite number of solutions.
  • 11:47 - 11:50
    But you have to look at
    this entry right here.
  • 11:50 - 11:53
    Only if this whole thing is
    zero and you have free
  • 11:53 - 11:56
    variables, then you have an
    infinite number of solutions.
  • 11:56 - 11:59
    If you have a statement like,
    0 is equal to a, if this is
  • 11:59 - 12:01
    equal to 7 right here, then all
    of the sudden you would
  • 12:01 - 12:03
    have no solution to this.
  • 12:03 - 12:05
    That you're dealing with
    parallel surfaces.
  • 12:05 - 12:08
    Anyway, hopefully you
    found that helpful.
Title:
Matrices: Reduced Row Echelon Form 3
Description:

more » « less
Video Language:
English
Team:
Khan Academy
Duration:
12:08

English subtitles

Revisions Compare revisions