Skip to content
Hub Nexus

Linear Algebra, Linear Geometry of n-Space

No author yetClaim it

Version 1Updated 1 min read

Support

For readers who have seen the elements of vectors before, in calculus or physics, this section is an optional review. However, later work will refer to this material so it is not optional if it is not a review.

In the first section, we had to do a bit of work to show that there are only three types of solution sets— singleton, empty, and infinite. But in the special case of systems with two equations and two unknowns this is easy to see. Draw each two-unknowns equation as a line in the plane and then the two lines could have a unique intersection, be parallel, or be the same line.

Unique solutionNo solutionsInfinitely many solutions
\begin{matrix}3 x & + & 2 y & = & 7 \\ x & − & y & = & − 1\end{matrix}\begin{matrix}3 x & + & 2 y & = & 7 \\ 3 x & + & 2 y & = & 4\end{matrix}\begin{matrix}3 x & + & 2 y & = & 7 \\ 6 x & + & 4 y & = & 14\end{matrix}

These pictures don't prove the results from the prior section, which apply to any number of linear equations and any number of unknowns, but nonetheless they do help us to understand those results. This section develops the ideas that we need to express our results from the prior section, and from some future sections, geometrically. In particular, while the two-dimensional case is familiar, to extend to systems with more than two unknowns we shall need some higher-dimensional geometry.

Where this page came from

This page was imported from Wikibooks. From “Linear Algebra” on Wikibooks, by its contributors, under CC BY-SA 4.0. Changed here: set as a page; navigation and edit links left out; each image under its own licence, credited in its caption.

Nobody has written it yet — it is the source material at a new address, which is why search engines are asked to skip it and why no one earns from it. It is up for grabs: take it on, and it is yours to rewrite and to earn from.

Comments

Spinner Logo

Read next

Next in Linear Algebra

Linear Algebra, Vectors in Space
CC BY-SA 4.0
"Higher-dimensional geometry" sounds exotic. It is exotic— interesting and eye-opening. But it isn't distant or unreachable. We begin by defining one-dimensional space to be the set ${ℝ}^{1}$.
Linear Algebra, Length and Angle Measures
CC BY-SA 4.0
We've translated the first section's results about solution sets into geometric terms for insight into how those sets look. But we must watch out not to be mislead by our own terms; labeling subsets of ${ℝ}^{k}$ of the forms $\{ \overset{→}{p} + t \overset{→}{v} \ | \ t ∈ ℝ \}$ and $\{ \overset{→}{p
Linear Algebra, Reduced Echelon Form
CC BY-SA 4.0
After developing the mechanics of Gauss' method, we observed that it can be done in more than one way. One example is that we sometimes have to swap rows and there can be more than one row to choose from. Another example is that from this matrix $( \begin{matrix}2 & 2 \\ 4 & 3\end{matrix} )$ Gauss'
Linear Algebra, Gauss-Jordan Reduction
CC BY-SA 4.0
Gaussian elimination coupled with back-substitution solves linear systems, but it's not the only method possible. Here is an extension of Gauss' method that has some advantages. Example 1.1 To solve $\begin{matrix}x & + & y & − & 2 z & = & − 2 \\ & & y & + & 3 z & = & 7 \\ x & & & − & z & = & − 1\en
Linear Algebra, Row Equivalence
CC BY-SA 4.0
We will close this section and this chapter by proving that every matrix is row equivalent to one and only one reduced echelon form matrix. The ideas that appear here will reappear, and be further developed, in the next chapter. The underlying theme here is that one way to understand a mathematical
Linear Algebra, Topic: Computer Algebra Systems
CC BY-SA 4.0
The linear systems in this chapter are small enough that their solution by hand is easy. But large systems are easiest, and safest, to do on a computer. There are special purpose programs such as LINPACK for this job. Another popular tool is a general purpose computer algebra system, including both