Cancellation property for etale morphisms

Reference: Milne etale cohomology (book, not lecture notes) cor 3.6

In my posts I tend to emphasize how much I enjoy geometric arguments and intuition. After all, who doesn’t like a good picture? Often I dislike purely algebraic arguments because I feel that they “don’t tell me anything about why it’s true.”

But there are certain times where I find some kind of asthetic beauty in algebra, diagram chasing, etc. In some sense they “dont tell us why it’s true.” But in some ways this is because it’s true purely formally, so there isn’t even a need to say “why” it’s true. That is, they tell us that there is really no mystery to the statement.

Here is one such example. Say we have , a morphism of -schemes, with the map being . Then if is etale and is unramified then is etale. In particular if is etale and is etale then is etale.

The key fact is that a morphism is unramified iff the embedding of the diagonal is an open immersion.

The key “trick” is to base change the emebedding of the diagonal via . Note that this is cartesian: intuitively, it’s the pairs of and such that . In other words, it’s parameterized by , with parameterization given by .

Since open immersions are etale, the diagonal on the right is etale. Since etale is stable under base change, the graph is therefore etale. But note that is precisely the composition of the graph and the projection to . This is etale, because it can once again be viewed as the base change of an etale map: Since the composition of etale is etale, we are done.

One pattern I am noticing is that considering the graph of a function, while not a very complicated idea, seems to lead to these really elegant proofs (or, what I view as really elegant, idk). Other than this argument, another argument that comes to mind is the proof of the Lefshetz fixed point formula. The key insight there is that fixed points correspond to the intersection of the diagonal and the graph. The rest of the proof is “merely” computations, once you realize this.

No comment found.

Add a comment

You must log in to post a comment.