06.09.2021 Views

Linear Algebra, 2020a

Linear Algebra, 2020a

Linear Algebra, 2020a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Section III. Basis and Dimension 145<br />

also write R 3 = xy-plane + yz-plane. To check this, note that any ⃗w ∈ R 3 can<br />

be written as a linear combination of a member of the xy-plane and a member<br />

of the yz-plane; here are two such combinations.<br />

⎛<br />

⎜<br />

w ⎞ ⎛<br />

1<br />

⎟ ⎜<br />

w ⎞ ⎛ ⎞ ⎛<br />

1 0<br />

⎟ ⎜ ⎟ ⎜<br />

w ⎞ ⎛ ⎞ ⎛ ⎞<br />

1 w 1<br />

0<br />

⎟ ⎜ ⎟ ⎜ ⎟<br />

⎝w 2 ⎠ = 1 · ⎝w 2 ⎠ + 1 · ⎝ 0 ⎠ ⎝w 2 ⎠ = 1 · ⎝w 2 /2⎠ + 1 · ⎝w 2 /2⎠<br />

w 3 0 w 3 w 3 0<br />

The above definition gives one way in which we can think of a space as a<br />

combination of some of its parts. However, the prior example shows that there is<br />

at least one interesting property of our benchmark model that is not captured by<br />

the definition of the sum of subspaces. In the familiar decomposition of R 3 ,we<br />

often speak of a vector’s ‘x part’ or ‘y part’ or ‘z part’. That is, in our prototype<br />

each vector has a unique decomposition into pieces from the parts making up<br />

the whole space. But in the decomposition used in Example 4.4, we cannot refer<br />

to the “xy part” of a vector — these three sums<br />

⎛<br />

⎜<br />

1<br />

⎞ ⎛<br />

⎟ ⎜<br />

1<br />

⎞ ⎛ ⎞ ⎛<br />

0<br />

⎟ ⎜ ⎟ ⎜<br />

1<br />

⎞ ⎛<br />

⎟ ⎜<br />

0<br />

⎞ ⎛<br />

⎟ ⎜<br />

1<br />

⎞ ⎛<br />

⎟ ⎜<br />

0<br />

⎞<br />

⎟<br />

⎝2⎠ = ⎝2⎠ + ⎝0⎠ = ⎝0⎠ + ⎝2⎠ = ⎝1⎠ + ⎝1⎠<br />

3 0 3 0 3 0 3<br />

all describe the vector as comprised of something from the first plane plus<br />

something from the second plane, but the “xy part” is different in each.<br />

That is, when we consider how R 3 is put together from the three axes we<br />

might mean “in such a way that every vector has at least one decomposition,”<br />

which gives the definition above. But if we take it to mean “in such a way<br />

that every vector has one and only one decomposition” then we need another<br />

condition on combinations. To see what this condition is, recall that vectors are<br />

uniquely represented in terms of a basis. We can use this to break a space into a<br />

sum of subspaces such that any vector in the space breaks uniquely into a sum<br />

of members of those subspaces.<br />

4.5 Example Consider R 3 with its standard basis E 3 = 〈⃗e 1 ,⃗e 2 ,⃗e 3 〉. The subspace<br />

with the basis B 1 = 〈⃗e 1 〉 is the x-axis, the subspace with the basis B 2 = 〈⃗e 2 〉 is<br />

the y-axis, and the subspace with the basis B 3 = 〈⃗e 3 〉 is the z-axis. The fact<br />

that any member of R 3 is expressible as a sum of vectors from these subspaces<br />

⎛ ⎞ ⎛<br />

x<br />

⎜ ⎟ ⎜<br />

x<br />

⎞ ⎛ ⎞ ⎛<br />

0<br />

⎟ ⎜ ⎟ ⎜<br />

0<br />

⎞<br />

⎟<br />

⎝y⎠ = ⎝0⎠ + ⎝y⎠ + ⎝0⎠<br />

z 0 0 z<br />

reflects the fact that E 3 spans the space — this equation<br />

⎛ ⎞ ⎛<br />

x<br />

⎜ ⎟ ⎜<br />

1<br />

⎞ ⎛<br />

⎟ ⎜<br />

0<br />

⎞ ⎛<br />

⎟ ⎜<br />

0<br />

⎞<br />

⎟<br />

⎝y⎠ = c 1 ⎝0⎠ + c 2 ⎝1⎠ + c 3 ⎝0⎠<br />

z 0 0 1<br />

w 3

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!