Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm working on the following problem with no luck.

Let $A$ be a domain. If $0 \neq f \in A$, then prove that $$A_{f} = \bigcap_{P \in\operatorname{Spec}(A), f \not\in P} { A_{P}}$$ and conclude that $A_{f}$ depends only on the open subset of $\operatorname{Spec}(A)$ that contains $f$.

I'm thinking about the fact that the primes of $A_{f}$ are in correspondence with the primes of $A$ that do not contain $p$, however I don't see it... probably it's more complicated than that...

Help please, thank you!

share|cite|improve this question
Note that the proof given in the answer below is false, since it uses arguments that could be used to show a false statement. A correct proof can be found here:… – MooS Jul 4 at 12:41
up vote 2 down vote accepted

Since $A$ is an integral domain, we can embed $A$ and all its localisations into $K = \operatorname{Frac} A$. By construction, $$A[1/f] \subseteq \bigcap_{\substack{\mathfrak{p} \in \operatorname{Spec} A \\ f \notin \mathfrak{p}}} A_\mathfrak{p}$$ because $f$ is invertible in $A_\mathfrak{p}$ whenever $f \notin \mathfrak{p}$. Since the primes not containing $f$ correspond naturally to the primes of $A_f$, we may assume without loss of generality that $f$ is already invertible in $A$, in which case it is enough to prove that $$A = \bigcap_{\mathfrak{p} \in \operatorname{Spec} A} A_\mathfrak{p}$$ whenever $A$ is an integral domain. But if $a \in A$ and $a \notin \mathfrak{p}$ for all primes $\mathfrak{p}$, then $(a)$ cannot be contained in any maximal ideal, so Krull's theorem on maximal ideals implies $(a) = A$, i.e. $a$ is already invertible in $A$. Therefore the equation holds.

share|cite|improve this answer
got it, thanks a lot! – Dquik Oct 7 '12 at 5:15

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.