Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add proof that O_K is a free module, and small changes #236

Merged
merged 1 commit into from
Apr 15, 2024

Conversation

user202729
Copy link
Contributor

@user202729 user202729 commented Apr 15, 2024

The things that are presented should be memorable and worth caring about. For that reason, proofs that would be included for completeness in any ordinary textbook are often omitted here, unless there is some idea in the proof which I think is worth seeing.

--- the book's introduction.

(This proof seems worth seeing for me, but writing in such a way to convince other people of it is generally a difficult task to do, I think. If anything, I think I've been relying on the book's introduction alone to convince myself the content is interesting...)

(I learnt that sending a 5000-line-diff pull request is a sure way to make sure it never gets reviewed, so here we go. Actually I also got one more for open mapping theorem...)

Re "chain map": actually there's only one more location in the book that calls it "chain map", but it's shorter and commonly used in the literature anyway, so why not.

Which makes $(x, y) \mapsto \TrK(x \cdot y)$ \emph{almost} an inner product
(see \Cref{ch:inner_product_spaces}),
except that it is not positive definite (for example, in $\CC$, we have $\Tr((1+i)^2) = 0$).
But having the matrix invertible suffices to do the following:
Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This "feels" a bit silly that we're proving it the "wrong" way (the book so throughoutly uses the basis-less ("Math 55a") approach; in fact before this pull request there's exactly one more position in the book that transposes a matrix instead of taking the dual of a linear transformation), but for some reason the normal proof (the bilinear form (x, y) ↦ Tr(xy) is nondegenerate so we're done) doesn't really sink in for me, and Napkin didn't define what is a nondegenerate bilinear form anyway.

If the field is an imaginary quadratic field, visualizing the class of an ideal is really easy:
because multiplication by a complex number corresponds to a combination of a scaling and a
rotation (i.e. it preserves angles), two ideals belong to the same class if they are similar,
that is, you can overlap one onto the another using rotation and scaling.
Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Is this what "similar" normally mean? (Note that reflection is excluded. Although I haven't checked including reflection causes problem...)

@vEnhance
Copy link
Owner

This looks nice, thanks.

@vEnhance vEnhance merged commit e280e27 into vEnhance:main Apr 15, 2024
1 check passed
@user202729
Copy link
Contributor Author

Also: I'm pretty sure about the correctness of the last proof although I can't find it in any book or reference. Most books use the second proof (dual lattice), only Neukirch use the first proof (divide by determinant), and nothing uses the third proof (technically Oggier's note tries to do that but that proof was pointed out to be broken)

@user202729 user202729 deleted the alg-nt-fix branch August 9, 2024 07:56
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants