Solving Quadratic Field Problems with Quick Tips - PhysicsForums

  • Thread starter Thread starter Brimley
  • Start date Start date
  • Tags Tags
    Field Quadratic
Brimley
Messages
76
Reaction score
0
Hello PhysicsForums!

I had posted a question earlier today in another thread and I had a follow up question to it (the question in nature isn't extremely related, but the link can be found https://www.physicsforums.com/showthread.php?p=2964009#post2964009").

In the previous example, it was listed that \lambda = (3+\sqrt{-3})/2 \in \mathbb{Q}[\sqrt{3}].

The text states the following:

"x,y, and z are quadratic integers in \mathbb{Q}[\sqrt{-3}], where x^3 + y^3 = z^3." From here it can be shown that \lambda can divide one of x,y, or z.

Can anyone help explain this? I don't know if reducing the equation modula \lambda^3 would help, but its my first guess.

Thanks -- Brim
 
Last edited by a moderator:
Physics news on Phys.org
Brimley said:
Hello PhysicsForums!

I had posted a question earlier today in another thread and I had a follow up question to it (the question in nature isn't extremely related, but the link can be found https://www.physicsforums.com/showthread.php?p=2964009#post2964009").

In the previous example, it was listed that \lambda = (3+\sqrt{-3})/2 \in \mathbb{Q}[\sqrt{3}].

The text states the following:

"x,y, and z are quadratic integers in \mathbb{Q}[\sqrt{-3}], where x^3 + y^3 = z^3." From here it can be shown that \lambda can divide one of x,y, or z.

Can anyone help explain this? I don't know if reducing the equation modula \lambda^3 would help, but its my first guess.

Thanks -- Brim

What book are you reading anyway? And you're trying to learn algebraic number theory without solid background in abstract algebra, particularly galois theory. Of course you run into troubles.

If you're not doing these for homework and have no time-constraint, then I suggest you get some solid background in abstract algebra first, then read good intro books like cassels & frohlich's algebraic number theory, neukirch's algebraic number theory, lang's, etc.

hint: you can factor x^3 + y^3 = (x + y)(x + yw)(x + yw^2), where w is the primitive 3rd root of unity, and gcd(x+y, x+yw^i) = gcd(x+y, 1 - w) for any i != 0 (mod 3) (direct computation). Also, 3 totally ramifies in the ring Z[w] as (3) = (1 - w)^2.

The above remarks are all one needs. I will not say more than the above hint, but others can feel free to expand / give more details.
 
Last edited by a moderator:
hochs said:
What book are you reading anyway? And you're trying to learn algebraic number theory without solid background in abstract algebra, particularly galois theory. Of course you run into troubles.

If you're not doing these for homework and have no time-constraint, then I suggest you get some solid background in abstract algebra first, then read good intro books like cassels & frohlich's algebraic number theory, neukirch's algebraic number theory, lang's, etc.

hint: you can factor x^3 + y^3 = (x + y)(x + yw)(x + yw^2), where w is the primitive 3rd root of unity, and gcd(x+y, x+yw^i) = gcd(x+y, 1 - w) for any i != 0 (mod 3) (direct computation). Also, 3 totally ramifies in the ring Z[w] as (3) = (1 - w)^2.

The above remarks are all one needs. I will not say more than the above hint, but others can feel free to expand / give more details.

Hochs, I would like to finish this same example so I can have it to reference when I do read up on things, however it is kind of pointless for me to have come this far with this same problem to quit near the end, spend months reading up, then having to come back and revisit all of this and resurrect a dead thread. For this reason, I would really like to finish this example.

Back to the problem: I know that \lambda = 1 - w = (3+\sqrt{-3})/2. Looking at your factoring and use of the GCD, the lost variable here is the z^3. Where does this play in? Which one does \lambda then divide into?
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top