MHB How Do You Prove Two Spans Are Equal?

  • Thread starter Thread starter Dethrone
  • Start date Start date
Dethrone
Messages
716
Reaction score
0
I just want to make sure I'm understand this. If I want to show to spans are equal, say $\text{span}(X)=\text{span}(Y)$, then I think I read that if we can represent all the elements of $X$ as a linear combination of the elements of $Y$, then $\text{span}(X) \subseteq \text{span}(Y)$ and if we can show all the elements of $Y$ can be represented as a linear combination of the elements of $X$, then $\text{span}(Y) \subseteq \text{span}(X)$. Therefore, the spans are equal.

Now, this is my understanding on why that is true, can you let me know if it is right? If we can show that all the elements of $X$ can be represented as a linear combination of the elements of $Y$, that would mean that $X_{i}\in \text{span}(Y)$, where $X_i$ is an element of $X$. Furthermore, all linear combinations of $X_i$ are also in $\text{span}(Y)$, since the elements themselves are linear combinations of the elements in $Y$. Thus, $\text{span}(X) \subseteq \text{span}(Y)$. The same reasoning holds for the other way around...
Is this correct, and is there any better way to think about this? It hurts my brain :(
 
Physics news on Phys.org
Maybe an easier way to imagine it is that if you can express each vector in $X$ as a linear combination of vectors in $Y$, then any vector that can be expressed as a linear combination of $X$ can be expressed as a linear combination of $Y$, by simply expanding out the $x_i$'s as their representation as a linear combination of elements of $Y$, and collecting terms. So any vector that is in the span of $X$ is automatically in the span of $Y$.

For instance suppose that you have $X = \{ x_1, x_2, x_3 \}$ and $Y = \{ y_1, y_2 \}$. Furthermore suppose that:
$$x_1 = 2y_1 + y_2$$
$$x_2 = y_1 + (-3)y_2$$
$$x_3 = 2y_1 + 2y_2$$
Now let $u$ be any vector in the span of $X$, so that:
$$u = c_1 x_1 + c_2 x_2 + c_3 x_3$$
Then we expand out to get:
$$u = c_1 (2y_1 + y_2) + c_2(y_1 + (-3)y_2) + c_3 (2y_1 + 2y_2)$$
$$u = 2 c_1 y_1 + c_1 y_2 + c_2 y_1 + (-3) c_2 y_2 + 2 c_3 y_1 + 2 c_3 y_2$$
$$u = (2 c_1 + c_2 + 2 c_3) y_1 + ( c_1 - 3c_2 + 2 c_3) y_2$$
And so $u$ can be expressed as a linear combination of $y_1$ and $y_2$ and so is in the span of $Y$.

From there your reasoning on expressing $X$ in terms of $Y$ and $Y$ in terms of $X$ to show that their spans are equal is perfectly valid. Of course, if you think on it a bit you will find that $X$ and $Y$ can be linearly independent without loss of generality, and so for their spans to be equal there must be the same number of (linearly independent) vectors in $X$ and $Y$ anyway, which leads you straight to the idea of a linear transformation between $X$ and $Y$ representable as a square invertible matrix $A$, from which you can establish a bijection between the coefficients in the linear combinations of vectors in either span... or something like that. I need to go now, I might add more details later if someone else hasn't.​
 
Thanks Bacterius for the well-written answer! Your reasoning makes complete sense. I was worried that I might have had the wrong idea, but it seems that my ideas conform with yours, which is a great feeling. :D
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...

Similar threads

Back
Top