Determining whether homomorphism or not

  • Thread starter tgt
  • Start date
In summary, the key to determining whether a homomorphism exists lies in understanding how elements are multiplied in the domain group and whether this multiplication is preserved in the mapping to another algebraic structure. This can be verified by checking if the binary operation preserves structure and if the key components such as inverses, identity, and values align with the mapped algebraic structure.
  • #1
tgt
522
2
It seems to be that the key to answering this question is in how elements are multiplied in the domain group. In other words, the type of multiplication in the domain group. What do you think?
 
Physics news on Phys.org
  • #2
Considering the definition of a homomorphism is that it preserves multiplicative structure, I imagine the key to figuring out whether it's a homomorphism lies in figuring out whether it preserves multiplicative structure.
 
  • #3
Office_Shredder said:
Considering the definition of a homomorphism is that it preserves multiplicative structure, I imagine the key to figuring out whether it's a homomorphism lies in figuring out whether it preserves multiplicative structure.

Definition of a homomorphism from a general perspective doesn't necessarily mean that it preserves a multiplicative structure.

A homomorphism doesn't even have to be using multiplication as the binary operation.

It depends also if you're dealing with let's say, rings, or groups (ring theory vs group theory).

Basically, a binary operation is homomorphic if it preserves structure from one domain to another.

You can do this by checking if the inverses, identity, and values from the binary operation coincide with the algebraic structure being mapped to.
 
Last edited:

1. What is a homomorphism?

A homomorphism is a mapping between two algebraic structures that preserves the operations of the structures. In simpler terms, it is a function that preserves the structure and relationships between elements of a mathematical system.

2. How do you determine if a function is a homomorphism?

To determine if a function is a homomorphism, it must satisfy the property of preserving the operations of the structures. This means that for any two elements in the original structure, the function must produce the same result as the corresponding elements in the new structure when the same operation is applied.

3. What is the difference between a homomorphism and an isomorphism?

A homomorphism preserves the operations of a structure, while an isomorphism preserves both the operations and the structure. In other words, an isomorphism is a bijective homomorphism.

4. Can a homomorphism exist between structures of different types?

Yes, a homomorphism can exist between structures of different types as long as the operations are preserved. For example, a homomorphism can exist between a group and a ring, as long as the function preserves the group operation and the ring addition and multiplication operations.

5. How is a homomorphism used in mathematics?

Homomorphisms are used in mathematics to identify and study relationships between different structures. They allow us to compare and contrast different structures and understand how they are related to each other. Homomorphisms are also used in applications such as cryptography, computer science, and physics.

Similar threads

  • Linear and Abstract Algebra
Replies
7
Views
983
  • Linear and Abstract Algebra
Replies
2
Views
1K
Replies
27
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
1K
Replies
11
Views
2K
  • Linear and Abstract Algebra
Replies
8
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
656
  • Linear and Abstract Algebra
Replies
5
Views
2K
  • Linear and Abstract Algebra
Replies
19
Views
1K
Back
Top