Show f(x)=x^3 is 1-1 for U(16)

  • Thread starter Thread starter 1800bigk
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around demonstrating that the function f(x) = x³ is a one-to-one mapping (injective) for the group U(16), which consists of the elements {1, 3, 5, 7, 9, 11, 13, 15} under multiplication modulo 16. Participants are exploring the implications of this function within the context of group theory.

Discussion Character

  • Conceptual clarification, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss the validity of calculating f(x) for each element in U(16) to show distinct outputs. There is also a mathematical exploration of the expression f(x) - f(y) and its implications for distinct elements x and y. One participant raises a question regarding the relationship between modular equivalence and equality of cubes.

Discussion Status

The discussion is active, with various approaches being considered to establish the injectivity of the function. Some participants suggest that calculating all outputs is a valid but tedious method, while others provide algebraic reasoning to explore the distinctness of f(x) and f(y). There is no explicit consensus yet on the most elegant proof method.

Contextual Notes

Participants are working under the assumption that U(16) is finite, which implies that if f is one-to-one, it must also be onto. There is a question regarding the implications of modular arithmetic on the equality of cubes, indicating a potential area of confusion or exploration.

1800bigk
Messages
42
Reaction score
0
I need to show that f(x)=x^3 is an automorphism of U(16) ie.
{1,3,5,7,9,11,13,15} with operation (multiplication)mod 16. I am having trouble showing that f is 1 to 1. I know it is 1 to 1 because I took each element calculated it to make sure, but how do I show that it is 1 to 1. I would usually assume f(a)=f(b) then show a = b but I am stuck there. Once I show its 1 to 1 I am pretty much done because its guaranteed to be onto since U(16) is finite.
 
Physics news on Phys.org
Showing that f(x)= f(y) only if x= y by calculating f(x) for every possible x is tedious but completely valid.
 
Well if you calculated them all, and they're all different, that constitutes a proof, albeit a rather unelegant one. Suppose x and y are distinct. To show f(x) and f(y) are distinct, observe:

f(x) - f(y) = x³ - y³ = (x-y)(x² + xy + y²) = (A)(B)

i.e. A = x-y, B = x² + xy + y²

Now for f(x) and f(y) to be distinct elements of U(16), AB will have to be divisible by 16. But note that B is an odd number, since it is the sum of 3 numbers, each of which is odd because each of them is a product of two odd numbers. So A would itself would have to be divisible by 16 (possibly being 0). But A is not zero because we're trying to prove that when x and y are distinct, then f maps them to different elements. And A is certainly no other multiple of 16, because two distinct elements of that set can't possibly differ by 16.
 
thanks, if a,b in U(16) does (a^3)mod16 = (b^3)mod16 imply (a^3)=(b^3)?
 

Similar threads

  • · Replies 20 ·
Replies
20
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
7
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
4
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K