Skip to content
Hub Nexus

No author yetClaim it

Version 1Updated 1 min read

Support

In the examples following the definition of a vector space
we developed the intuition that some spaces are "the same" as others.
For instance, the space of two-tall column vectors and
the space of two-wide row vectors
are not equal because their
elements—column vectors and row vectors—are
not equal, but we have
the idea that these spaces differ only in how their elements appear.
We will now make this idea precise.

This section illustrates a common aspect of a mathematical investigation.
With the help of some examples, we've gotten an idea.
We will next give a formal definition, and then
we will produce some results backing our contention
that the definition captures the idea.
We've seen this happen already,
for instance, in the first section of the Vector Space chapter.
There, the study of linear systems
led us to consider collections closed under linear combinations.
We defined such a collection as a vector space, and
we followed it with some supporting results.

Of course, that definition wasn't an end point,
instead it led to new insights such as the idea of a basis.
Here too, after producing a definition, and supporting it,
we will get two surprises (pleasant ones).
First, we will find that
the definition applies to some unforeseen, and interesting, cases.
Second, the study of the definition will lead to new ideas.
In this way, our investigation will build a momentum.

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

Next in Linear Algebra

CC BY-SA 4.0
We start with two examples that suggest the right definition. Example 1.1 Consider the example mentioned above, the space of two-wide row vectors and the space of two-tall column vectors. They are "the same" in that if we associate the vectors that have the same components, e.g., $( \begin{matrix}1
CC BY-SA 4.0
In the prior subsection, after stating the definition of an isomorphism, we gave some results supporting the intuition that such a map describes spaces as "the same". Here we will formalize this intuition. While two spaces that are isomorphic are not equal, we think of them as almost equal— as equiv
CC BY-SA 4.0
Definition 1.1 A function between vector spaces $h : V → W$ that preserves the operations of addition if ${\overset{→}{v}}_{1} , {\overset{→}{v}}_{2} ∈ V$ then $h ( {\overset{→}{v}}_{1} + {\overset{→}{v}}_{2} ) = h ( {\overset{→}{v}}_{1} ) + h ( {\overset{→}{v}}_{2} )$ and scalar multiplication if $
CC BY-SA 4.0
Isomorphisms and homomorphisms both preserve structure. The difference is that homomorphisms needn't be onto and needn't be one-to-one. This means that homomorphisms are a more general kind of map, subject to fewer restrictions than isomorphisms. We will examine what can happen with homomorphisms th
CC BY-SA 4.0
The prior section shows that a linear map is determined by its action on a basis. In fact, the equation $h ( \overset{→}{v} ) = h ( {c}_{1} ⋅ {\overset{→}{β}}_{1} + … + {c}_{n} ⋅ {\overset{→}{β}}_{n} ) = {c}_{1} ⋅ h ( {\overset{→}{β}}_{1} ) + … + {c}_{n} ⋅ h ( {\overset{→}{β}}_{n} )$ shows that, if
CC BY-SA 4.0
Example 1.1 Consider a map h with domain ${ℝ}^{2}$ and codomain ${ℝ}^{3}$ (fixing $B = ⟨ ( \begin{matrix}2 \\ 0\end{matrix} ) , ( \begin{matrix}1 \\ 4\end{matrix} ) ⟩ \ \text{and} \ D = ⟨ ( \begin{matrix}1 \\ 0 \\ 0\end{matrix} ) , ( \begin{matrix}0 \\ − 2 \\ 0\end{matrix} ) , ( \begin{matrix}1 \\ 0