Verifying Solutions to Isomorphism Problem: Need Help!

  • Context: MHB 
  • Thread starter Thread starter Joe20
  • Start date Start date
  • Tags Tags
    Isomorphism
Click For Summary
SUMMARY

The discussion focuses on verifying solutions to the isomorphism problem, specifically parts (a) and (b). The user, Alexis87, received feedback indicating that their proof for part (a) was circular and needed revision. For part (b), the recommendation was to demonstrate the distinctness of images of the mapping function f to establish its injectivity, thereby confirming its bijectivity due to equal cardinality of the sets involved.

PREREQUISITES
  • Understanding of isomorphism in algebraic structures
  • Familiarity with bijective functions and their properties
  • Knowledge of modular arithmetic, specifically $[a]_6$, $[a]_2$, and $[a]_3$
  • Experience with mathematical proofs and logical reasoning
NEXT STEPS
  • Study the properties of bijective functions in detail
  • Learn about modular arithmetic and its applications in isomorphism proofs
  • Explore techniques for constructing mathematical proofs without circular reasoning
  • Investigate alternative methods for proving isomorphisms in algebraic structures
USEFUL FOR

Mathematicians, students studying abstract algebra, and anyone interested in understanding isomorphism proofs and their verification processes.

Joe20
Messages
53
Reaction score
1
Hi, I have attached the question and the solutions to part a and b of this question. Would like someone to verify if I have done anything wrong. Greatly appreciate it! Thanks.

Would also like to check if there is a simpler method to prove f is an isomorphism? Thanks
 

Attachments

  • q4.png
    q4.png
    10.4 KB · Views: 124
  • Webp.net-resizeimage.jpg
    Webp.net-resizeimage.jpg
    107.6 KB · Views: 124
Physics news on Phys.org
Hi Alexis87,

Your proof for part (a) is somewhat circular — the goal was to prove $[a]_6 = _6$ implies $([a]_2,[a]_3) = (_2, _3)$, but you started with that claim. Remove it.

For part (b), remove the beginning part of your proof. To show that $f$ is bijective, you could show that the images $f(j)$, $j = 0,\ldots, 5$, are distinct, and so $f$ is injective. Since $f$ is an injective mapping between two sets of the same cardinality, it is also surjective. Hence, $f$ is bijective.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
6
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 21 ·
Replies
21
Views
1K
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K