Ask your own question, for FREE!
Mathematics 15 Online
OpenStudy (usukidoll):

Prove that R^n and R^m are isomorphic if and only if m=n

OpenStudy (usukidoll):

Given: R^n and R^m are isomorphic n =m Since we're given a biconditional statement, we must prove two claims: If R^n and R^m are isomorphic, then m=n If m = n, then R^n and R^m are isomorphic

OpenStudy (usukidoll):

R^n and R^m are isomorphic if and only if their dimensions are equal.

OpenStudy (anonymous):

Two mathematical structures are said to be isomorphic if there is an isomorphism between them.

terenzreignz (terenzreignz):

Yeah... isn't that enough, @UsukiDoll ?

terenzreignz (terenzreignz):

Oh wait, that's what you're trying to prove, lol NVM

OpenStudy (usukidoll):

I just want to make sure that it's correct. that's all/

OpenStudy (usukidoll):

R^n and R^m are isomorphic if and only if their dimensions are equal.

OpenStudy (anonymous):

I know how to solve it

OpenStudy (usukidoll):

OH GO AWAY SOTY!

OpenStudy (usukidoll):

so anyway....that one sentence is the proof...umm is that all I need to write?

OpenStudy (perl):

you can probably do a proof by contradiction

OpenStudy (usukidoll):

:( really?

OpenStudy (perl):

case 1 . n > m, case 2 . n < m , both lead to contradiction

terenzreignz (terenzreignz):

That one sentence looks like that which you are trying to prove, @UsukiDoll :(

OpenStudy (usukidoll):

well if they don't have equal dimensions, there is no way that R^n and R^m can be isomorphic

terenzreignz (terenzreignz):

Yeah... isn't that what you are trying to prove in the first place?

OpenStudy (usukidoll):

oh got one! like perl said earlier.... and mine as well. If the dimensions aren't equal, then they can't be isomorphic. the only way for R^m and R^n to be isomorphic is when the dimensions are equal m=n

OpenStudy (usukidoll):

If N > M or N < M, then the dimensions aren't equal.

OpenStudy (usukidoll):

would that be right @perl

OpenStudy (perl):

we have to define dimension.

OpenStudy (usukidoll):

define dimension?

terenzreignz (terenzreignz):

I have an idea... use this fact Let T be a linear transformation... \[\huge T: U \rightarrow V\] \[\huge U = \mathbb{R}^n\]\[\huge V=\mathbb{R}^m\] And use the fact that that \[\huge \dim[T(U)]\le \dim(V)\]

terenzreignz (terenzreignz):

Or not... never mind...

OpenStudy (usukidoll):

no my class isn't using linear transformations for it

terenzreignz (terenzreignz):

oh...

OpenStudy (usukidoll):

ack how is dimension defined?

terenzreignz (terenzreignz):

Dimension is the cardinality (number of elements) of the basis (which is the maximal linearly independent set) or the linearly independent spanning set of a Vector Space.

OpenStudy (usukidoll):

o-o

terenzreignz (terenzreignz):

Simply put... \[\huge \dim(\mathbb{R}^n) =n\]

OpenStudy (usukidoll):

Ok. HOw's this? R^n and R^m are isomorphic if and only if their dimensions are equal. However if n > m or n < m, then the dimensions aren't equal and R^n and R^m can't be isomorphic

terenzreignz (terenzreignz):

As long as you're allowed to use the fact that two spaces are isomorphic only if their dimensions are equal, then you're good to go.

OpenStudy (usukidoll):

yeah I am.

OpenStudy (usukidoll):

because it's not fancy stuff. I used inner product on a problem that was in chapter one and the professor was fuming.

OpenStudy (usukidoll):

he was like we didn't learn this. it's a bad idea to put advanced things.

terenzreignz (terenzreignz):

Okay. then it's all good :)

OpenStudy (perl):

basically what you are proving is the following. R^m and R^n are isomorphic if and only their dimensions are equal

OpenStudy (perl):

this sounds like an advanced proof

OpenStudy (usukidoll):

but we are learning about isomorphics. that's section 4.8 in the book. we just finished chapter 4

OpenStudy (usukidoll):

This is the question: Prove that R^n and R^m are isomorphic if and only if m=n

OpenStudy (usukidoll):

@perl real question ^

OpenStudy (usukidoll):

My answer: R^n and R^m are isomorphic if and only if their dimensions are equal. However if n > m or n < m, then the dimensions aren't equal and R^n and R^m can't be isomorphic

OpenStudy (usukidoll):

I'm wondering if its correct. that is all

terenzreignz (terenzreignz):

I'm wondering the same thing :D

OpenStudy (anonymous):

That's not a proof.

OpenStudy (usukidoll):

so where do I begin to prove this biconditional statement?

terenzreignz (terenzreignz):

I suppose we can stick to tradition. Let m = n

OpenStudy (usukidoll):

If R^n and R^m are isomorphic, then m=n If m = n, then R^n and R^m are isomorphic

terenzreignz (terenzreignz):

Then show that R^n is isomorphic to R^m

terenzreignz (terenzreignz):

That's the easy bit.

OpenStudy (usukidoll):

If R^n and R^m are isomorphic, then m=n If m = n, then R^n and R^m are isomorphic

OpenStudy (anonymous):

Obviously the hard part is showing that no isomorphism exists for n not equal to m

OpenStudy (usukidoll):

that's the contradiction. If m doesn't equal to n, then R^n and R^m are NOT isomorphic

terenzreignz (terenzreignz):

Okay, @UsukiDoll Clean slate... Now... suppose m = n It is easy to show that R^n is isomorphic to R^m Right?

OpenStudy (anonymous):

But that's what you're trying to prove is it not. You are just restating the problem.

OpenStudy (usukidoll):

I wish I could just plug in numbers... if m = 4 and n = 4, but that defeats the purpose of a proof

terenzreignz (terenzreignz):

Relax, @UsukiDoll I'm all about proofs (preferably Abstract Algebra) But maybe we can do this together :D

terenzreignz (terenzreignz):

So, suppose m = n

OpenStudy (usukidoll):

sure.

OpenStudy (usukidoll):

at least I attempted to do a proof, not beg for answers only.

OpenStudy (anonymous):

Look that direction is trivial, if n = m then clearly there is an isomorphism just use the identity.

OpenStudy (usukidoll):

the identity of R^n and R^m?

terenzreignz (terenzreignz):

Yeah, just putting it up for the sake of completion. Now the other way around is not nearly as easy, assuming that an isomorphism from R^n to R^m exists...

OpenStudy (anonymous):

UsukiDoll if n=m one isomoprhism between the two spaces is just the identity matrix

terenzreignz (terenzreignz):

So... one direction is clear to you? That \[\huge m = n \rightarrow \mathbb{R}^n \cong \mathbb{R}^m\]

terenzreignz (terenzreignz):

@UsukiDoll

OpenStudy (usukidoll):

huh yeah I'm here

terenzreignz (terenzreignz):

That much is clear, though? So we can proceed to the second part?

OpenStudy (usukidoll):

yup

terenzreignz (terenzreignz):

Okay, now suppose \[\huge \mathbb{R}^n \cong \mathbb{R}^m\]

OpenStudy (anonymous):

I'm pretty sure the other direction is only possible with a fair bit of abstract algebra.

OpenStudy (usukidoll):

What the! But I'm in Intro to Linear Algebra O_O

terenzreignz (terenzreignz):

The two fields are related... to an extent... a Vector Space is a group, after all.

OpenStudy (usukidoll):

@___@

terenzreignz (terenzreignz):

Relax, @UsukiDoll Now... suppose \[\huge \mathbb{R}^n \cong \mathbb{R}^m\] okay...?

OpenStudy (anonymous):

This type of problem is not easy. You need to somehow show that no isomoprhism can exist if \(n \neq m\)

terenzreignz (terenzreignz):

Possibly a lot easier than you might think @Alchemista ;)

OpenStudy (usukidoll):

well somehow this question was inside my elementary linear algebra book

terenzreignz (terenzreignz):

@UsukiDoll I proceed only at your signal :)

OpenStudy (perl):

there are two claims here claim 1 : two real finite-dimensional vector spaces that are isomorphic must have the same dimension. claim 2 . if the dimensions of two real finite dimensional vector spaces are the same then they are isomorphic

OpenStudy (perl):

there are also 'infinite dimensional' vector spaces, R^infinity

OpenStudy (usukidoll):

If R^n and R^m are isomorphic, then m=n If m = n, then R^n and R^m are isomorphic yes that is true we are given two claims

OpenStudy (anonymous):

Yes perl, we already dealt with one direction (claim 2).

OpenStudy (perl):

ok :)

OpenStudy (anonymous):

And I think we are assuming finite dimensionality here.

OpenStudy (perl):

right, try to prove claim 1 using contradiction. so you have two isomorphic vector spaces, but they have different dimension. can this lead to something absurd

OpenStudy (usukidoll):

you mean should two isomorphic vector spaces have different dimensions, the results would be catastrophic.

OpenStudy (perl):

yes, find a catastrophe

OpenStudy (usukidoll):

if m isn't equal to n --->

OpenStudy (usukidoll):

then R^m and R^n aren't isomorphic?

OpenStudy (perl):

so you are given R^n, and R^m which are isomorphic. let n > m

OpenStudy (usukidoll):

or let n < m

OpenStudy (perl):

either way works , yes

OpenStudy (usukidoll):

then isomorphic of R^n and R^m doesn't exist

OpenStudy (perl):

you have to prove that

OpenStudy (usukidoll):

how?

OpenStudy (usukidoll):

maybe the values of n and m are different

OpenStudy (helder_edwin):

just a question @UsukiDoll : how do u define isomorphic without using linear transformations?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!