[Linear Algebra] Finding T*; complex conjugate linear transformation

Click For Summary
The discussion revolves around finding the adjoint T* of the linear operator T defined on the vector space of real linear polynomials, P_1(R). The inner product is defined using integration, and the participants explore the relationship between T and T* through matrix representations. It is established that T is not self-adjoint, as the matrices for T and T* differ. The conversation highlights the importance of using an orthonormal basis to compute the adjoint correctly and emphasizes the need to express the matrix as a linear transformation to derive T*. The key conclusion is that the adjoint can be constructed from the matrix representation, leading to a clearer understanding of the linear mapping.
mick25
Messages
13
Reaction score
0
[Linear Algebra] Finding T* adjoint of a linear operator

Homework Statement



Consider P_1{}(R), the vector space of real linear polynomials, with inner product

< p(x), q(x) > = \int_0^1 \! p(x)q(x) \, \mathrm{d} x

Let T: P_1{}(R) \rightarrow P_1{}(R) be defined by T(p(x)) = p'(x) + p(x). Find T^*(p(x)) for an arbitrary
p(x) = a + bx^2 \in P_1{}(R).


Homework Equations



< T(p(x)), q(x) > = < p(x), T^*(q(x)) >

The Attempt at a Solution



Using the standard basis of P_1{}(R), \alpha = <1, x>

<T(1),1> = 1
<T(1), x> = 1/2
<T(x), 1> = 3/2
<T(x), x> = 5/6

<br /> [T]_\alpha^{\alpha} =<br /> \left[ {\begin{array}{cc}<br /> 1 &amp; 3/2 \\<br /> 1/2 &amp; 5/6 \\<br /> \end{array} } \right]<br />
<br /> [T^*]_\alpha^{\alpha} =<br /> \left[ {\begin{array}{cc}<br /> 1 &amp; 1/2 \\<br /> 3/2 &amp; 5/6 \\<br /> \end{array} } \right]<br />

Not sure how to find T^* from here...
 
Last edited:
Physics news on Phys.org
What you did only works for an orthonormal basis. So perhaps you should first find an orthonormal basis of your space??
 
I just got the new matrices with the orthonormal basis but I'm still at the same sticking point

The matrices aren't equal so T isn't self-adjoint; that's all I can conclude right now
 
If you work in an orthonormal basis, then the adjoint is given by the hermition conjugate. So find the hermitian conjugate and express the matrix as a linear transformation. And there you have your adjoint!
 
\alpha = &lt;1, \sqrt{3}(2x-1)&gt; is an orthonormal basis for P_1{}(R)

By the definition of the inner product space, have

&lt; T(p(x)), q(x) &gt; = \int_0^1 \! p&#039;(x)q(x) \, \mathrm{d} x + \int_0^1 \! p(x)q(x) \, \mathrm{d} x

So I computed

&lt; T(1), 1 &gt; = 1

&lt; T(1), \sqrt{3}(2x-1) &gt; = 0

&lt; T(\sqrt{3}(2x-1)), 1 &gt; = 4\sqrt3

&lt; T(\sqrt{3}(2x-1)), \sqrt{3}(2x-1) &gt; = 1

<br /> [T]_\alpha^{\alpha} =<br /> \left[ {\begin{array}{cc}<br /> 1 &amp; 4\sqrt{3} \\<br /> 0 &amp; 1 \\<br /> \end{array} } \right]<br />

<br /> [T^*]_\alpha^{\alpha} =<br /> \left[ {\begin{array}{cc}<br /> 1 &amp; 0 \\<br /> 4\sqrt{3} &amp; 1 \\<br /> \end{array} } \right]<br />

Still not sure how to find T^* from this...

Verifying the matrix...

&lt; T(p(x)), q(x) &gt; = \int_0^1 \! p&#039;(x)q(x) \, \mathrm{d} x + \int_0^1 \! p(x)q(x) \, \mathrm{d} x = &lt; p(x), T^*(q(x))&gt;

&lt; T(p(x)), q(x) &gt; = \int_0^1 \! p&#039;(x)q(x) \, \mathrm{d} x + \int_0^1 \! p(x)q(x) \, \mathrm{d} x

&lt; p(x), T(q(x)) &gt; = \int_0^1 \! p(x)q&#039;(x) \, \mathrm{d} x + \int_0^1 \! p(x)q(x) \, \mathrm{d} x = p(1)q(1) - p(0)q(0) - \int_0^1 \! p&#039;(x)q(x) \, \mathrm{d} x + \int_0^1 \! p(x)q(x) \, \mathrm{d} x

So T is not self-adjoint.
 
Doesn't that matrix for T* actually give you T*?? How do you construct a linear mapping from a matrix?
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
8
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
4
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 16 ·
Replies
16
Views
2K