Proving Isomorphism without Explicit Functions in Abstract Algebra

In summary, it seems that one cannot always show two things are isomorphic without a function, but there are often short cuts or methods to be used.
  • #1
quasar_4
290
0
I am having a very hard time with a general concept of proving something. If I have some arbitrary function mapping one ring, let's say R, to another ring, S, and want to prove that R is isomorphic to S, then I need to show that there exists a bijective homomorphism between R and S. But how do I do this if I don't know explicitly what f is? In general, how does one show that two things are isomorphic without a function?

It seems a lot easier in linear algebra with vector spaces since one can often make some kind of dimension argument, but I don't know what to do in the abstract algebra case. :confused:
 
Physics news on Phys.org
  • #2
Deciding whether two groups (i.e. just the additive parts) are isomorphic is a HARD problem. I mean that, roughly, in the proper sense of the word. There is no way to do it in general. If the ring is finite, then the work is expected to be exponenetial in the number of elements of the ring. In general it is easier to decide when things are not isomorphic. Of course, in any particular case, there may be (frequently are) short cuts, and things to exploit. The nearest things I can think of to structure properties are

1) Algebras decomposing into matrix sub algebras

2) Morita equuivalence i.e. when two rings have the same module theory (but are very much not required to be isomorphic) e.g. If F is any field, then F and M_n(F) are morita equivalent, but not isomorphic for n>1.
 
Last edited:
  • #3
hm, so I can't just define some bijective function between them that is also a homomorphism?
 
  • #4
Well, if they are isomorphic, such a thing will exist, but there is in general no way to find any such homomorphism.
 
  • #5
without a mapping, it is usually not possible to show things are isomorphic. i.e. to show two things are isomorphic, first look for a natural map between them. then try to show it has an inverse, or at least to comopute its kernel. then try to show that it is surjective.

example, if we have nested increasing modules N<M<P over the same ring, to show the

P/M is isomorphic to [P/N]/[M/N], find a map. One can easily map P to [P/N]/[M/N], by sending an element of P to the equivalence class mod M/N of its equivalence class mod N.

But a map in the other direction is also at hand. Take an element of P and send it to its equivalence class mod M. Then everything in N goes to zero, so we get a map alsp from P/N to P/M. But here again everything in P/N which is represented by an element of P which is actually in M goes to zero. So we get an induced map[P/N]/[M/N]-->P/M, which is inverse to the previous one since composing takes the class of element {x} to itself.

the composition being the identity is trivial, it was the welldefiendness that was needed. confusing huh?
 

1. What is isomorphism between rings?

Isomorphism between rings is a type of mathematical mapping that establishes a one-to-one correspondence between two rings, preserving the structure and operations of the rings. It means that the two rings are essentially the same, just with different names for elements and operations.

2. How do you prove two rings are isomorphic?

To prove two rings are isomorphic, you must show that there exists a bijective function between the two rings that preserves the ring structure. This means that the function must preserve addition, multiplication, and identity elements. If such a function exists, then the two rings are isomorphic.

3. What is the significance of isomorphism between rings?

Isomorphism between rings allows us to study and understand complex algebraic structures by breaking them down into simpler, isomorphic rings. It also helps in identifying patterns and properties that may not be obvious in the original ring.

4. Can two non-identical rings be isomorphic?

Yes, two non-identical rings can be isomorphic if there exists a bijective function between them that preserves the ring structure. This means that even though the rings may have different elements and operations, they are essentially equivalent and can be considered the same.

5. How is isomorphism between rings different from homomorphism?

Isomorphism and homomorphism are both types of mathematical mappings, but they serve different purposes. Isomorphism establishes a one-to-one correspondence between two rings, while homomorphism preserves the structure and operations within a single ring. Isomorphism is a stronger condition than homomorphism, as it also requires the function to be bijective.

Similar threads

  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
13
Views
978
  • Linear and Abstract Algebra
Replies
4
Views
2K
Replies
6
Views
1K
  • Linear and Abstract Algebra
Replies
2
Views
855
  • Linear and Abstract Algebra
Replies
2
Views
2K
  • Linear and Abstract Algebra
Replies
2
Views
1K
Replies
3
Views
1K
  • Linear and Abstract Algebra
Replies
8
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
1K
Back
Top