Hey there! Sign in to join this conversationNew here? Join for free
 You are Here: Home >< Maths

# The Proof is Trivial! watch

1. Problem 369***(easy)

Prove that any diagonalisable matrix satisfies it's own characteristic polynomial

Problem 369***(hard)

This time, without the assumption of diagonalisability.

The hard version is the Caley-Hamilton theorem; the easy one just a special case which is much more straightforward. Getting boring just seeing number theory and integrals.
2. Solution 369

What's a matrix? It's a morphism between vector spaces. So we identify our matrix with the endomorphism of vector spaces where is a finite dimensional vector space over some algebraically closed field, call it . If we do not assume the field algebraically closed, we simply choose a larger algebraically closed field which contains our field.
Now view as a module over under the map , where . Trivial observation shows that is a torsion module. Hence, we can apply the structure theorem for modules over principal rings. Thus, we obtain the Jordan canonical form , where are -invariant which can be written as where are subspaces isomorphic to for some .
Let be the characteristic polynomial. Then the kernel of the map is , where depends on and . Also, and . By and the fact that is generated by the elements of the form , for which , we get for all , and consequently .

We can think of this proof as follows: firstly, we decompose as a direct sum of torsion modules over the principal ring such that these torsion modules have exponents which are prime powers. Then, we use the structure theorem to decompose each of the summands in a direct sum of cyclic modules. Thus, under the corresponding basis our endomorphism is composed of cells in which all the elements are zero, except these on the diagonal (they are equal) and these on the super diagonal (they are not relevant). So we are done if we show that for an endomorphism composed of a single such cell, the proposition is true. But this is obvious since the vector space viewed as a module over the polynomial ring is cyclic and the ring of polynomials is commutative.
Spoiler:
Show
This gibberish is because I think that the notation obscures the main idea.

Edit: I forgot to note the obvious connection between linear algebra and algebra established by the structure theorems for modules over principal rings. I quite like this link. I can post much more interesting propositions; however, I restrain myself from doing it since I do not know whether people would like them (these would be mainly from my current reading list which includes some category theory and algebraic topology).
3. Why is everyone boycotting my question 364?

Posted from TSR Mobile
4. (Original post by Arieisit)
Why is everyone boycotting my question 364?

Posted from TSR Mobile
I have just seen the problem. I personally am not going to do it for it requires too much calculations (for me), and I dislike them passionately.
5. Problem 370**/***

Prove that in the real number system that the inverse of addition is represented by

Posted from TSR Mobile
6. (Original post by Arieisit)
Problem 370*/**

Prove that in the real number system that the inverse of addition is represented by

Posted from TSR Mobile
From what starting point? One perfectly valid definition of the reals is as an ordered field (with a few other properties). Under this definition each numeber, x, has an additive inverse which is normally denoted by -x.
7. (Original post by james22)
From what starting point? One perfectly valid definition of the reals is as an ordered field (with a few other properties). Under this definition each numeber, x, has an additive inverse which is normally denoted by -x.
There are a few ways I can think of in which this can be proven but its up to you to decide what to do (if you can).

Posted from TSR Mobile
8. (Original post by Arieisit)
There are a few ways I can think of in which this can be proven but its up to you to decide what to do (if you can).

Posted from TSR Mobile
My problem is that I could say that -x is the additive inverse of x (by definition of -x) and so x+(-x)=0 as 0 is defined as the additive identity. This is the definition of the reals that I was taught.
9. Not really a problem, but

can be evaluated using Beta functions. I'm not sure how well known this is, so apologies if this is a little mundane.
10. (Original post by henpen)
Not really a problem, but

can be evaluated using Beta functions. I'm not sure how well known this is, so apologies if this is a little mundane.
.

Now, and .

Solution

11. (Original post by Mladenov)
I can post much more interesting propositions; however, I restrain myself from doing it since I do not know whether people would like them (these would be mainly from my current reading list which includes some category theory and algebraic topology).
Go for it.
How's the self-study coming along now? Also, did you finish with Lang's "Algebra" yet?
12. (Original post by Felix Felicis)
.

Now, and .

Solution

Indeed. Any other nice problems solvable with Beta?
13. (Original post by FireGarden)
Problem 369***(easy)

Prove that any diagonalisable matrix satisfies it's own characteristic polynomial

Problem 369***(hard)

This time, without the assumption of diagonalisability.

The hard version is the Caley-Hamilton theorem; the easy one just a special case which is much more straightforward. Getting boring just seeing number theory and integrals.

"Solution" 369:

The characteristic polynomial of a square matrix A is p(x) = det(A-xI). So p(A) = det(A-AI) = det(A-A) = det(0) = 0.

14. Time for some number theory

Problem 371 ***

Prove that for any integer

where is a prime number
15. Let . Observe that

(infinite geometric series: 1+x^2+x^3+...=1/(1-x), given that |x|<1, which is the case here since all prime are greater than 1)

Thus, by the fundamental theorem of arithmetic, when the RHS of the inequality is

,

where the indicates that the sum goes on forever, since there are infinitely many numbers that have factors in . A simple example would be (p being the largest prime ), where take on infinitely many values.

Then the problem boils down to showing that

.

No idea now. This seems more like an analytic number theory problem to me, which I've never studied in my life. (in A2 at the moment; don't even know single variable calculus properly yet lol..)

I can note that the LHS is a finite sum while the RHS is an infinite one. I don't know how to show if it diverges or not though, and how then to deploy that fact on the problem.

EDIT: I also don't know exactly how to deal with the equality case here.
16. (Original post by arkanm)
Let . Observe that

(infinite geometric series: 1+x^2+x^3+...=1/(1-x), given that |x|<1, which is the case here since all prime are greater than 1)

Thus, by the fundamental theorem of arithmetic, when the RHS of the inequality is

,

where the indicates that the sum goes on forever, since there are infinitely many numbers that have factors in . A simple example would be (p being the largest prime ), where take on infinitely many values.

Then the problem boils down to showing that

.

No idea now. This seems more like an analytic number theory problem to me, which I've never studied in my life. (in A2 at the moment; don't even know single variable calculus properly yet lol..)

I can note that the LHS is a finite sum while the RHS is an infinite one. I don't know how to show if it diverges or not though, and how then to deploy that fact on the problem.

EDIT: I also don't know exactly how to deal with the equality case here.
In your last inequality, the RHS diverges and the inequality is obvious enough to assume. You would not be able to prove it formally without knowing some analysis though (not a very intersting problem either and just an application of definitions).
17. (Original post by james22)
In your last inequality, the RHS diverges and the inequality is obvious enough to assume. You would not be able to prove it formally without knowing some analysis though (not a very intersting problem either and just an application of definitions).
Yeah I don't think it's an interesting problem. I would rather have people posting interesting problems that are elementary (e.g. olympiad problems) than ones that are easy but require some advanced theory.

I didn't know that the RHS would diverge because it isn't the harmonic series as the numbers that are in the denominators depend on M. But if it does diverge then I guess it's easy to prove as the LHS is a finite sum.

What about the equality case?
18. Solution 371

Note that , where consists of all numbers whose prime factors are less than or equal to . Hence .

(Original post by MW24595)
Go for it.
How's the self-study coming along now? Also, did you finish with Lang's "Algebra" yet?
It goes well except for the last week during which I completed my application to read mathematics at Cambridge . Nowadays, I read from one not-so-well-known book on algebraic topology by Prodanov, Spanier's classic, Hu's Homotopy Theory (I heard that Bott and Tu's Differential Forms in Algebraic Topology is one of the best books on the subject and introduces spectral sequences from the very beginning). I finished Lang's Algebra two months ago, and I dare say that now I find it perfectly clear and not so dry (it has to be supplemented since it is not so heavy on category theory); this is just because I tried Switzer's Homotopy and Homology which is a total dead end (there exists even worse choice - Elements of Homotopy Theory by Whitehead).

Good luck and enjoy your time at Cambridge.

Problem 372***

Let and be subsets of the topological space so that , where is the interior of . Show that there exist natural homomorphisms such that is an exact sequence, where and are defined by the induced homomorphisms, namely and , , , and .
This is a well-known sequence in algebraic topology which plays crucial role in homology theory. Using the same assumptions, show that the homomorphism is a composition of the following morphisms (now, you might come up with a second proof of the result).

Problem 373***

Let be a subset of , homeomorphic to , . Prove that and , .

Spoiler:
Show
The order of the above problems is intentional.
19. Problem 372***

Prove the following:

If

where D is a connected domain, and if f is holomorphic, and

then

20. Some strange glitch. The latest posts aren't visible :/

Reply
Submit reply
TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: February 15, 2018
Today on TSR

### TSR interviews Minister for Universities

Ask your questions here

### Buying condoms for the first time - help!

Discussions on TSR

• Latest
Poll
Useful resources

## Make your revision easier

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams

Can you help? Study help unanswered threads

## Groups associated with this forum:

View associated groups
Discussions on TSR

• Latest

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.