Prove that R^n and R^m are isomorphic if and only if m=n
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
R^n and R^m are isomorphic if and only if their dimensions are equal.
Two mathematical structures are said to be isomorphic if there is an isomorphism between them.
Yeah... isn't that enough, @UsukiDoll ?
Oh wait, that's what you're trying to prove, lol NVM
I just want to make sure that it's correct. that's all/
R^n and R^m are isomorphic if and only if their dimensions are equal.
I know how to solve it
OH GO AWAY SOTY!
so anyway....that one sentence is the proof...umm is that all I need to write?
you can probably do a proof by contradiction
:( really?
case 1 . n > m, case 2 . n < m , both lead to contradiction
That one sentence looks like that which you are trying to prove, @UsukiDoll :(
well if they don't have equal dimensions, there is no way that R^n and R^m can be isomorphic
Yeah... isn't that what you are trying to prove in the first place?
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
If N > M or N < M, then the dimensions aren't equal.
would that be right @perl
we have to define dimension.
define dimension?
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)\]
Or not... never mind...
no my class isn't using linear transformations for it
oh...
ack how is dimension defined?
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.
o-o
Simply put... \[\huge \dim(\mathbb{R}^n) =n\]
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
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.
yeah I am.
because it's not fancy stuff. I used inner product on a problem that was in chapter one and the professor was fuming.
he was like we didn't learn this. it's a bad idea to put advanced things.
Okay. then it's all good :)
basically what you are proving is the following. R^m and R^n are isomorphic if and only their dimensions are equal
this sounds like an advanced proof
but we are learning about isomorphics. that's section 4.8 in the book. we just finished chapter 4
This is the question: Prove that R^n and R^m are isomorphic if and only if m=n
@perl real question ^
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
I'm wondering if its correct. that is all
I'm wondering the same thing :D
That's not a proof.
so where do I begin to prove this biconditional statement?
I suppose we can stick to tradition. Let m = n
If R^n and R^m are isomorphic, then m=n If m = n, then R^n and R^m are isomorphic
Then show that R^n is isomorphic to R^m
That's the easy bit.
If R^n and R^m are isomorphic, then m=n If m = n, then R^n and R^m are isomorphic
Obviously the hard part is showing that no isomorphism exists for n not equal to m
that's the contradiction. If m doesn't equal to n, then R^n and R^m are NOT isomorphic
Okay, @UsukiDoll Clean slate... Now... suppose m = n It is easy to show that R^n is isomorphic to R^m Right?
But that's what you're trying to prove is it not. You are just restating the problem.
I wish I could just plug in numbers... if m = 4 and n = 4, but that defeats the purpose of a proof
Relax, @UsukiDoll I'm all about proofs (preferably Abstract Algebra) But maybe we can do this together :D
So, suppose m = n
sure.
at least I attempted to do a proof, not beg for answers only.
Look that direction is trivial, if n = m then clearly there is an isomorphism just use the identity.
the identity of R^n and R^m?
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...
UsukiDoll if n=m one isomoprhism between the two spaces is just the identity matrix
So... one direction is clear to you? That \[\huge m = n \rightarrow \mathbb{R}^n \cong \mathbb{R}^m\]
@UsukiDoll
huh yeah I'm here
That much is clear, though? So we can proceed to the second part?
yup
Okay, now suppose \[\huge \mathbb{R}^n \cong \mathbb{R}^m\]
I'm pretty sure the other direction is only possible with a fair bit of abstract algebra.
What the! But I'm in Intro to Linear Algebra O_O
The two fields are related... to an extent... a Vector Space is a group, after all.
@___@
Relax, @UsukiDoll Now... suppose \[\huge \mathbb{R}^n \cong \mathbb{R}^m\] okay...?
This type of problem is not easy. You need to somehow show that no isomoprhism can exist if \(n \neq m\)
Possibly a lot easier than you might think @Alchemista ;)
well somehow this question was inside my elementary linear algebra book
@UsukiDoll I proceed only at your signal :)
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
there are also 'infinite dimensional' vector spaces, R^infinity
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
Yes perl, we already dealt with one direction (claim 2).
ok :)
And I think we are assuming finite dimensionality here.
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
you mean should two isomorphic vector spaces have different dimensions, the results would be catastrophic.
yes, find a catastrophe
if m isn't equal to n --->
then R^m and R^n aren't isomorphic?
so you are given R^n, and R^m which are isomorphic. let n > m
or let n < m
either way works , yes
then isomorphic of R^n and R^m doesn't exist
you have to prove that
how?
maybe the values of n and m are different
just a question @UsukiDoll : how do u define isomorphic without using linear transformations?
Join our real-time social learning platform and learn together with your friends!