Proving Solutions of Linear Transformations Using Kernel and Fixed Vectors

laminatedevildoll
Messages
211
Reaction score
0
\ Let T: V \rightarrow W be a linear transformation, let b \in Wbe a fixed vector, and let x_0 \in V be a fixed solution of
T(x)=b. Prove that a vector x_1 \in Vis a solution of T(x)=b, if and only if x_1is of the form x_1=x_h +x_0where x_h \in kerT

I started out by saying that

x_i \in X_i

(x_1... x_n) \in \prod (where i=1 and h is at the top) X_0

(x_1... x_n) \in \prod X_i

x_i \in X_i \rightarrow x_1 is not equal to the empty set for all i.

I am not sure if I am doing this right. I'd appreciate any feedback.
 
Last edited:
Physics news on Phys.org
You're looking for these:

\neq \emptyset

\prod_{i=1}^{h}

\ker T
 
Last edited:
to see if you are right, ask yourself if your argument is logically convincing. it is crucial to be able to decide for yourself, if such arguments are correct. i.e. practice playing both roles, argue it then ask if it could possibly be wrong, then answer yourself.
 
I think that it's convincing, but sometimes I find it hard to convince myself that it's right because I doubt myself all the time.
 
well that's the goal to achieve. to reduce your arguments to logic so simple and clear that you can persuade yourself that you must be right. keep practicing.
 
##\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...
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...
Back
Top