Is fλ an Automorphism of the Rational Numbers Group?

In summary: I'll make sure to consider all those points in the future. In summary, we proved that fλ is a homomorphism, injective, surjective, and an automorphism of the group of rationals with the sum operation (Q,+).
  • #1
AllRelative
42
2

Homework Statement


*This is from a Group Theory class
**My secondary aim is to practice writing the math perfectly because I tend to loose a lot of points for not doing so in exams...

Let λ ∈ Q*
fλ : Q → Q defined as fλ(x) = λx

a) Show that fλ is and automorphism of the group of rationals with the sum operation (Q,+)

Homework Equations



Let f: (G,*) → (G', ⋅)
e is the neutral element of G
e' is the neutral element of G'

The definition of homomorphisms:
f is a homomorphism if
f(x*y) = f(x) ⋅ f(y) , ∀x,y ∈ G

f is injective ⇔ ker(f) = {e}
f is surjective ⇔ Im(f) = G'

The Attempt at a Solution



Let's show that fλ is a homomorphism.

Let x,y ∈ Q
fλ(x+y) = λ(x+y) = λx + λy = fλ(x) + fλ(y)
which proves that fλ is a homomorphism.Let's show that fλ is injective.

The neutral element of Q is 0.
0 = λx ⇒ x = 0 because λ ≠ 0
We can therefore write Ker(fλ ) = {0} which proves that fλ is injective.Let's show that fλ is surjective.

Every element y of Q can be written with the form λx where x∈Q.
This means that Im(fλ) = Q.
This proves that fλ is surjective.Finally, we proved that fλ is a endomorphism that is injective and surjective. This is the definition of an automorphism.
 
Physics news on Phys.org
  • #2
AllRelative said:

Homework Statement


*This is from a Group Theory class
**My secondary aim is to practice writing the math perfectly because I tend to loose a lot of points for not doing so in exams...

Let λ ∈ Q*
fλ : Q → Q defined as fλ(x) = λx

a) Show that fλ is and automorphism of the group of rationals with the sum operation (Q,+)

Homework Equations



Let f: (G,*) → (G', ⋅)
e is the neutral element of G
e' is the neutral element of G'

The definition of homomorphisms:
f is a homomorphism if
f(x*y) = f(x) ⋅ f(y) , ∀x,y ∈ G

f is injective ⇔ ker(f) = {e}
f is surjective ⇔ Im(f) = G'

The Attempt at a Solution



Let's show that fλ is a homomorphism.

Let x,y ∈ Q
fλ(x+y) = λ(x+y) = λx + λy = fλ(x) + fλ(y)
which proves that fλ is a homomorphism.Let's show that fλ is injective.

The neutral element of Q is 0.
0 = λx ⇒ x = 0 because λ ≠ 0
We can therefore write Ker(fλ ) = {0} which proves that fλ is injective.Let's show that fλ is surjective.

Every element y of Q can be written with the form λx where x∈Q.
This means that Im(fλ) = Q.
This proves that fλ is surjective.Finally, we proved that fλ is a endomorphism that is injective and surjective. This is the definition of an automorphism.
Right so far. I would have written in the surjective part: Every element ##y## can be written ##y=1\cdot y= \lambda \cdot \lambda^{-1} \cdot y = f_\lambda(\lambda^{-1}y)## to actually show the preimage.

In general, you will have to consider more points in a proof:
  1. well definition
  2. domain
  3. codomain
  4. homomorphy
  5. injectivity
  6. surjectivity
The first point comes into play when there are more than one possible images. E.g. if we have ##f: \mathbb{Q} \longrightarrow \mathbb{R}## defined as ##f(x)=\,##decimal representation of ##x##, then we want to be sure that ##f(1/2)=f(2/4)##. This is no problem in your example, and also the points 2. and 3. are obvious, but in general should be considered, because if only a rule for a function is given, it's sometimes not automatically clear that the image belongs to the claimed domain.
 
  • Like
Likes AllRelative
  • #3
fresh_42 said:
Right so far. I would have written in the surjective part: Every element ##y## can be written ##y=1\cdot y= \lambda \cdot \lambda^{-1} \cdot y = f_\lambda(\lambda^{-1}y)## to actually show the preimage.

In general, you will have to consider more points in a proof:
  1. well definition
  2. domain
  3. codomain
  4. homomorphy
  5. injectivity
  6. surjectivity
The first point comes into play when there are more than one possible images. E.g. if we have ##f: \mathbb{Q} \longrightarrow \mathbb{R}## defined as ##f(x)=\,##decimal representation of ##x##, then we want to be sure that ##f(1/2)=f(2/4)##. This is no problem in your example, and also the points 2. and 3. are obvious, but in general should be considered, because if only a rule for a function is given, it's sometimes not automatically clear that the image belongs to the claimed domain.
Thanks a lot man! This is exactly the kind of insights I was hoping for.
 

Related to Is fλ an Automorphism of the Rational Numbers Group?

What is a rigorous proof of isomorphism?

A rigorous proof of isomorphism is a mathematical proof that demonstrates that two mathematical structures, such as graphs, groups, or vector spaces, are essentially the same. This means that they have the same underlying structure and can be mapped onto each other in a way that preserves their essential properties.

What is the importance of proving isomorphism?

Proving isomorphism is important because it allows mathematicians to show that seemingly different structures are actually equivalent. This can help to simplify complex problems and provide a deeper understanding of mathematical concepts.

What are the steps involved in proving isomorphism?

The steps involved in proving isomorphism include defining the two structures being compared, establishing a mapping between them, showing that the mapping is bijective, and demonstrating that the mapping preserves the structure and properties of both structures.

What are the common techniques used in rigorous proofs of isomorphism?

Common techniques used in rigorous proofs of isomorphism include the use of algebraic manipulations, induction, and the use of logical arguments such as direct and contrapositive proofs. Graph theory is also often used in proofs of isomorphism.

How can one verify the correctness of a rigorous proof of isomorphism?

One can verify the correctness of a rigorous proof of isomorphism by carefully following the steps and checking for any errors or inconsistencies. The proof should also be reviewed by other mathematicians for feedback and to ensure its validity. In addition, computer-assisted proofs can be used to verify the proof's correctness.

Similar threads

  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
6
Views
854
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
8
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
548
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
7
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
Back
Top