Is There a Simpler Way to Construct a Linear Functional Given a Linear Operator?

ihggin
Messages
14
Reaction score
0
Let V be a finite-dimensional vector space over the field F and let T be a linear operator on V. Let c be a scalar and suppose there is a non-zero vector \alpha in V such that t \alpha = c \alpha. Prove that there is a non-zero linear functional f on V such that T^{t}f=cf, where T^{t}f=f\circ T is the transpose.

I tried the following: let B be a basis for V that contains \alpha (we can do this since \alpha \neq 0). Then define f such that f(\alpha)=1 and f(b)=0 for all the other basis vectors. Extend the definition to arbitrary vectors using linearity of f. So if v=\sum c_i b_i for scalars c_i and basis vectors b_i with b_1= \alpha, we have f(v)=c_1. However, I then ran into the problem that when I take f(Tv), T can map other basis vectors into vectors with components in \alpha, which messes my strategy up.

Is there some smart choice of basis vectors that can prevent this from happening? Or is this just not a good way of doing the problem?
 
Physics news on Phys.org
I would suggest, contemplate these equations and questions:

f(Tv)=cf(v)

f((T-cI)v)=0

Can T-cI be invertible? How big is the image (T-cI)V? Can it be the whole of V?

Can you find a nonzero functional vanishing on this image?
 
Thank you! So basically (T-cI)\alpha=0 so the dimension of the kernel is greater than zero, which means the dimension of the image is less than that of V. We can then take a vector x that is not in the image and generate a basis from it. We then define f so that it's zero on all the basis vectors except x.
 
You almost got it. But you need to choose a basis in such a way that the dim(Im) vectors span the image and set your functional to vanish on these and not to vanish on at least one basis vector outside.
 
Last edited:
##\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