MHB Please Critique My Solution Involving Linear Independence, Linear Dependence and Span

bwpbruce
Messages
60
Reaction score
1
Problem:

True or False? If $x$ and $y$ are linearly independent, and if $\{\textbf{x}, \textbf{y}, \textbf{z}\}$ is linearly dependent, then $\textbf{z}$ is in Span $\{\textbf{x},\textbf{y}\}$

Solution:
$\textbf{True}$. If $a\textbf{x} + b\textbf{y} = \textbf{0}$ is true and if $a\textbf{x} + b\textbf{y} + c\textbf{z} = \textbf{0}$ is true, then $-a\textbf{x} -b\textbf{y} = \textbf{z}$ must also be true because when $c = 1$: \begin{align*}a\textbf{x} + b\textbf{y} + (1)\textbf{z} = \textbf{0}\end{align*}, we have the non-trivial solution. Furthermore,
\begin{align*}a\textbf{x} + b\textbf{y} + \textbf{z} = \textbf{0}\end{align*} becomes
\begin{align*}a\textbf{x} + b\textbf{y} = -\textbf{z}\end{align*} which simplifies to
\begin{align*}-a\textbf{x} + -b\textbf{y} = \textbf{z}\end{align*}
 
Last edited:
Physics news on Phys.org
I'll use regular (not bold) letters from the end of the alphabet for vectors and letters from the beginning of the alphabet for numbers.

You may have shown that if $ax+by=0$ and $ax+by+cz=0$, then $z\in\operatorname{Span}\{x,y\}$. But the assumption in the problem was simply $ax+by+cz=0$ for some $a,b,c$; you were not authorized to assume that $ax+by=0$, especially with the same coefficients $a,b$. But you don't seem to actually use the assumption $ax+by=0$ later in the proof.

Further, what right do you have to assume that $c=1$? More precisely, of course, you can assume anything, but for the proof to be complete you also need to consider the case $c\ne 1$. Instead of assuming $c=1$ try dividing the equation by $c$. But first you need to prove that $c\ne0$.

A minor note is that to make a proof easy to read, it should start with assumptions, use them to deduce intermediate statements, use those to deduce other statements and progress in that way until you arrive at the conclusion. You, in contrast, started with assumptions and then announced a goal that you seem to have proved only at the end. In other words, if you are using words like "therefore", "so" and "thus", you are moving forward; but if you are using "because", then you reversed your direction and are now justifying facts announced ahead of time. It's a matter of style and readability, so this is not necessarily bad, but if you are learning to write proofs, the forward-moving style is preferable.
 
Can you please provide me with an example of how to write a proof in the manner that you suggest. I'm awful with it and my proofs often ends up getting ripped to shreds in the same manner you just did.
 
Assumptions:

(A1) $x,y$ are linearly independent, i.e., $ax+by=0$ implies $a=b=0$ for all $a,b$.

(A2) $x,y,z$ are linearly dependent, i.e., there exists $a,b,c$ such that $ax+by+cz=0$ and it is not the case that $a=b=c=0$.

Take some $a,b,c$ guaranteed to exist by (A2). Assume that $c=0$; then (A2) implies that $ax+by=0$, but it is not the case that $a=b=0$ (otherwise we would have $a=b=c=0$). But this contradicts (A1); therefore, the assumption $c=0$ was false and $c\ne0$. Dividing both sides of $ax+by+cz=0$ by $c$ we get $\frac{a}{c}x+\frac{b}{c}y+z=0$, or
\[
z=-\frac{a}{c}x-\frac{b}{c}y.
\]
Therefore, $z\in\operatorname{Span}\{x,y\}$.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
10
Views
2K
Replies
2
Views
1K
Replies
6
Views
2K
Replies
6
Views
2K
Replies
3
Views
3K
Replies
6
Views
2K
Replies
3
Views
3K
Back
Top