Prime Factorization Theorem and Number Systems

Click For Summary

Discussion Overview

The discussion centers around the Prime Factorization Theorem and its applicability in various number systems, particularly in relation to statements made by Andrew Wiles regarding new number systems where the fundamental theorem of arithmetic does not hold. Participants explore examples of such number systems, including quadratic integer rings and matrices, and seek clarification on the implications of these examples.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • Some participants express confusion about Wiles' statement regarding number systems where the fundamental theorem of arithmetic does not hold and seek clarification.
  • One example provided is the ring ##\mathbb{Z}[\sqrt{-5}##, which is noted to lack prime factorization due to multiple representations of products with irreducible factors.
  • Another participant mentions that a 2×2 matrix with identical integer entries may also lack a fundamental theorem of arithmetic, suggesting that unique factorization is limited to matrices of -1 or 1.
  • It is noted that the rings of integers in number fields do not always exhibit unique factorization, which is tied to the complexity of proving Fermat's Last Theorem.

Areas of Agreement / Disagreement

Participants generally agree on the existence of number systems where the prime factorization theorem does not hold, but there are multiple examples and interpretations discussed, indicating that the topic remains unresolved and open to further exploration.

Contextual Notes

Some limitations include the need for clarity on specific definitions of number systems and the conditions under which unique factorization fails. The discussion also references a paper in the MAA Journal for additional context on matrix number theory.

e2m2a
Messages
354
Reaction score
13
TL;DR
What does it mean that there are some number systems where the prime factorization theorem does not hold?
If you go to "The Abel Prize Interview 2016 with Andrew Wiles" on YouTube, there is a statement made by Andrew Wiles beginning at about 4:10 and ending about 4:54 where he mentions there are some new number systems possible where the fundamental theorem of arithmetic does not hold. I don't understand how this is possible. Can someone please explain what he meant by this and what number systems he is talking about?
 
Mathematics news on Phys.org
e2m2a said:
Summary:: What does it mean that there are some number systems where the prime factorization theorem does not hold?

If you go to "The Abel Prize Interview 2016 with Andrew Wiles" on YouTube, there is a statement made by Andrew Wiles beginning at about 4:10 and ending about 4:54 where he mentions there are some new number systems possible where the fundamental theorem of arithmetic does not hold. I don't understand how this is possible. Can someone please explain what he meant by this and what number systems he is talking about?
Could you give us the link? At least to those who are willing to watch almost an hour of content only to guess what somebody else might have possibly meant.

##\mathbb{Z}[\sqrt{-5}]## is a ring without prime factorization, because ##2\cdot 3=(1+\sqrt{-5})\cdot(1-\sqrt{-5})## are two different representations with irreducible factors.
 
  • Like
Likes   Reactions: pbuk
fresh_42 said:
##\mathbb{Z}[\sqrt{-5}]## is a ring without prime factorization, because ##2\cdot 3=(1+\sqrt{-5})\cdot(1-\sqrt{-5})## are two different representations with irreducible factors.
If you are not familiar with this notation then note that ##\mathbb{Z}[\sqrt{-5}]## is an example of a quadratic integer ring; specifically it is the 'number system' whose elements ## w ## are defined by two (ordinary) integers ## (a, b) ## such that ## w = a + b \sqrt{-5} ##.

As @fresh_42 states, in this number system the number ## (6, 0) ## is an example of a number that has two distinct irreducible ('prime') factorizations: ## (2, 0) (3, 0) ## and ## (1, 1) (1, -1) ##.
 
  • Informative
Likes   Reactions: Janosh89
fresh_42 said:
Could you give us the link? At least to those who are willing to watch almost an hour of content only to guess what somebody else might have possibly meant.

##\mathbb{Z}[\sqrt{-5}]## is a ring without prime factorization, because ##2\cdot 3=(1+\sqrt{-5})\cdot(1-\sqrt{-5})## are two different representations with irreducible factors.
 
Another one is the a 2×2 matrix that has all the same integer entries. Will not have a fundamental theorem of arithmetic, I think the only unique factorization is a matrix of -1 or 1. There is a paper in the MAA Journal math monthly for more information about matrix number theory.
 
e2m2a said:
Summary:: What does it mean that there are some number systems where the prime factorization theorem does not hold?

If you go to "The Abel Prize Interview 2016 with Andrew Wiles" on YouTube, there is a statement made by Andrew Wiles beginning at about 4:10 and ending about 4:54 where he mentions there are some new number systems possible where the fundamental theorem of arithmetic does not hold. I don't understand how this is possible. Can someone please explain what he meant by this and what number systems he is talking about?
The example given by @fresh_42 is exactly what Wiles is talking about. The rings of integers in number fields do not always have unique factorization. If they did Fermat's last thereom would have been much easier to prove.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 35 ·
2
Replies
35
Views
5K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 32 ·
2
Replies
32
Views
5K