Hey there! Sign in to join this conversationNew here? Join for free
    • Thread Starter
    Offline

    0
    ReputationRep:
    Let V be the space of polynomials with degree \leq n (dimV=n+1)
    i. Let D:V->V be differentiation, i.e. D: f(x) -> f'(x)
    What are the eigenvalues of D? Is D diagonalisable?

    ii. Let T be the endomorphism T:f(x) -> (1-x)2 f''(x).
    What are the eigenvalues of T? Is T diagonalisable?


    i. I have constructed the matrix of D with respect to the basis {1,x,x2,...,x2}
    C = \left[ \begin{array}{ccccc} 0 & 1 & 0 & ... & 0 \\ 0 & 0 & 2 & ... & 0 \\ : & : & : & : & : \\ 0 & 0 & 0 & 0 & n \\ 0 & 0 & 0 & 0 & 0 \end{array} \right]

    The characteristic polynomial of this (I think) is xn+1

    So the only eigenvalue is 0 and D is not diagonalisable?

    How would I go about part ii?
    Offline

    2
    ReputationRep:
    (Original post by Kate2010)
    Let V be the space of polynomials with degree \leq n (dimV=n+1)
    i. Let D:V->V be differentiation, i.e. D: f(x) -> f'(x)
    What are the eigenvalues of D? Is D diagonalisable?

    ii. Let T be the endomorphism T:f(x) -> (1-x)2 f''(x).
    What are the eigenvalues of T? Is T diagonalisable?


    i. I have constructed the matrix of D with respect to the basis {1,x,x2,...,x2}
    C = \left[ \begin{array}{ccccc} 0 & 1 & 0 & ... & 0 \\ 0 & 0 & 2 & ... & 0 \\ : & : & : & : & : \\ 0 & 0 & 0 & 0 & n \\ 0 & 0 & 0 & 0 & 0 \end{array} \right]

    The characteristic polynomial of this (I think) is xn+1

    So the only eigenvalue is 0 and D is not diagonalisable?

    How would I go about part ii?
    I think your first part is right, although it's more because there's only one eigenvector for that eigenvalue.

    With the second bit, just try to think what eigenvectors could be. To start with, you get two eigenvectors which'll have eigenvalue zero. What other eigenvectors can you get? Look carefully at f(x) to see if you can find 'em and if not, they're all quite similar to

    MASSIVE HINT:
    Spoiler:
    Show
    (x-1)^2


    So how many are there? What eigenvalues will we get?
    Offline

    0
    ReputationRep:
    Constructing the matrix of T would be a start.

    As an aside, the linear algebra lecturer this term was pretty good.
    • Thread Starter
    Offline

    0
    ReputationRep:
    Do we get the eigenvalues 0, 2, 6, 12 ,..., n(n-1) i.e. -n(n-1) for n>0. (From considering the matrix)

    For the eigenvectors, we could have g(x) = constant (eigenvalue 0), g(x) = px (eigenvalue 0), g(x) = (x-1)^2 (eigenvalue 2), then could we have (1-x)^n?

    So we have n linearly independent eigenvectors, so T is diagonalisable?
    Offline

    2
    ReputationRep:
    (Original post by Kate2010)
    Do we get the eigenvalues 0, 2, 6, 12 ,..., n(n-1) i.e. -n(n-1) for n>0. (From considering the matrix)

    For the eigenvectors, we could have g(x) = constant (eigenvalue 0), g(x) = px (eigenvalue 0), g(x) = (x-1)^2 (eigenvalue 2), then could we have (1-x)^n?

    So we have n linearly independent eigenvectors, so T is diagonalisable?
    Yup, I think that's right.
 
 
 
Poll
Who is your favourite TV detective?
Useful resources

Make your revision easier

Maths

Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

Equations

How to use LaTex

Writing equations the easy way

Student revising

Study habits of A* students

Top tips from students who have already aced their exams

Study Planner

Create your own Study Planner

Never miss a deadline again

Polling station sign

Thinking about a maths degree?

Chat with other maths applicants

Can you help? Study help unanswered threads

Groups associated with this forum:

View associated groups

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Write a reply...
Reply
Hide
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.