Group Theory + Fermat's Little Number Theorem

In summary: But then I had a very good teacher -- who might also have been a very good expositor and written a very good book. Or not.I don't remember what I did for group theory. I remember the course (and the teacher) but not the book (if any).In summary, the conversation discusses a problem from a math text about group theory and quantum mechanics. The problem involves proving that for a group of order (p-1), where p is a prime, with elements 1,2,...,(p-1) and group multiplication defined as multiplication mod p, for any element A of the group, A^(p-1) is equal to the multiplicative identity. The conversation includes different approaches to solving the problem
  • #1
mufusisrad
8
0
This isn't a homework problem as it is me working through some math texts in order to add some "rigor" to my physics/engineering acumen. As an undergrad, I attempted to take a course in abstract algebra, but had to drop it due to scheduling problems. I've been working through my copy of Hungerford and am using Tinkham's "Group Theory and Quantum Mechanics" to supplement the rather minimal treatment of group theory while providing some good practical problems. This problem is from the first chapter of Tinkham.

Homework Statement



Consider a group of order (p-1), where p is a prime, with elements 1,2,..,(p-1) and group multiplcation is defined as multiplcation mod p. Prove that for any element of the group, A, the following relationship holds: A^(p-1)=E (the multiplicative identity).

Homework Equations



This is equivalent to proving that for a given integer, N, and a prime, P, that N^P is congruent to N modulo P.

The Attempt at a Solution



The solution I have is very simple, but I feel as if it is missing something

-Assume that any element, A, generates a cyclic subgroup of order k, s.t. A^k=E.
-By Lagrange's theorem, k must be an integer divisor of (p-1), the order of the larger group. This leads to n*k=(p-1).
-A^(p-1)=A*(n*k)=(A^k)^n=(E)^n=E, Q.E.D.

I like the proof, but the first statement doesn't seem complete. I don't feel comfortable just assuming that any element can generate such a subgroup. Can anyone help me justify this?
 
Physics news on Phys.org
  • #2
I don't feel comfortable just assuming that any element can generate such a subgroup.
Firstly, there's a general definition:

Given a subset S of a group G, the subgroup of G generated by S is defined to be the smallest subgroup of G that contains S.

You can prove that the subgroup generated by S always exists -- but here we don't have to resort to such generalities. You can explicitly write down the subgroup generated by A! And for the purposes of this proof, you don't even care that it's the smallest; all you care is that the powers of A form a group.
 
  • #3
mufusisrad said:
-Assume that any element, A, generates a cyclic subgroup of order k, s.t. A^k=E.

this is not an assumption. Any element A does generate a subgroup of some order


-By Lagrange's theorem, k must be an integer divisor of (p-1), the order of the larger group. This leads to n*k=(p-1).
-A^(p-1)=A*(n*k)=(A^k)^n=(E)^n=E, Q.E.D.

This is perfectly correct but sort of too good. Yes, you invoke Lagrange's theorem, but Lagrange's theorem is a generalization of the idea that the order of an element divides the order of the group (which is all you're asking).

You can find much more interesting proofs than this using a little number theory or combinatorics or even just the binomial theorem:

A^p = (A-1 +1)^p=(A-1)^p + 1 = A-1+1 =A (all '=' are congruence mod p)

Here you should verify that the 'naive' mistake of writing (x+y)^p=x^p+y^p is actually vali: p choose r is p! divided by smaller factorials, so the p in p! never cancels unless r=0 or p.
The third equality is just induction, by the way.

I suspect that is the proof they had in mind - after all you never use the fact that you're operating 'mod p' for p a prime do you? You've just proven that x^|G|=1 for any group G, which is far more powerful. Has the book even mentioned Lagrange's theorem at this point?
 
Last edited:
  • #4
Thanks for both of your responses! I feel much more comfortable with my initial statement. When I first saw the problem, I actually ended up doing the binomial theorem proof first, but wanted to see if I could do it using only the theorems that had been brought up in the book up until that point. Tinkham doesn't actually refer to Lagrange's Theorem by name, but he does prove it in the second chapter so he can use it when he introduces factor groups. What did either of you use for your first texts in Group Theory?
 
  • #5
So you used a technique in chapter 2 to prove a result in chapter 1? That surely points to you that you weren't supposed to use Lagrange's theorem.

I didn't have a text for group theory. I still don't. I had lecture notes.
 

What is Group Theory?

Group Theory is a branch of mathematics that studies the algebraic structures known as groups. A group is a set of elements with a binary operation (such as multiplication or addition) that satisfies certain properties, including closure, associativity, identity, and invertibility.

What is Fermat's Little Number Theorem?

Fermat's Little Number Theorem is a fundamental theorem in number theory that states that for any prime number p, and any integer a not divisible by p, a^(p-1) is congruent to 1 modulo p. In simpler terms, it means that if you take any number, raise it to the power of a prime number minus 1, and divide by that prime number, the remainder will always be 1.

How is Group Theory related to Fermat's Little Number Theorem?

Group Theory is used to prove Fermat's Little Number Theorem. Specifically, the concept of a group of units is used, where a group of units is a set of numbers that have a multiplicative inverse modulo p. By using Group Theory, we can prove that the group of units modulo p has a specific structure, which leads to the proof of Fermat's Little Number Theorem.

What are the applications of Fermat's Little Number Theorem?

Fermat's Little Number Theorem has many applications in number theory and cryptography. Some examples include primality testing, encryption algorithms, and digital signature schemes. It is also used in various areas of mathematics, such as in the proof of the irrationality of certain numbers.

What are some other important theorems related to Fermat's Little Number Theorem?

There are several other important theorems related to Fermat's Little Number Theorem, including Euler's Totient Theorem, Wilson's Theorem, and Euler's Criterion. These theorems all have similar properties and are used in various areas of mathematics, including number theory, algebra, and cryptography.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
720
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
955
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
6
Views
798
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
Back
Top