Let K be a Galois extension of the rationals with degree n. The Chebotarev Density Theorem guarantees that the rational primes that split completely in K have density 1/n and thus there are infinitely many such primes. As Kevin Buzzard pointed out to me in a comment, there is a simpler way to see that there are infinitely many rational primes that split completely in K, namely that the Dedekind zeta-function ζ_K(s) has a simple pole at s = 1. While this result is certainly much easier to prove than Chebotarev's Theorem, it is still not an elementary proof.

Is there a known elementary proof of the fact that there are infinitely many rational primes that split completely in K?

Selberg's elementary proof of Dirichlet's Theorem for primes in arithmetic progressions handles the case where Gal(K/Q) is Abelian. I don't know anything about the general case. Since Dirichlet's Theorem is stronger than required, it is possible that an simpler proof exists even in the Abelian case.

Remarks on the meaning of elementary. I am aware that there is no uniformly recognized definition of "elementary proof" in number theory. While I am not opposed to alternate definitions, my personal definition is a proof which can be carried out in first-order arithmetic, i.e. without quantification over real numbers or higher-type objects. Obviously, I don't require it to be explicitly formulated in that way — even logicians don't do that! Odds are that whatever you believe is elementary is also elementary in my sense.

Kurt Gödel observed that proofs of (first-order) arithmetical facts can be much, much shorter in second-order arithmetic than in first-order arithmetic. This observation explains some of the effectiveness of analytic number theory, which is implicitly second-order. In view of Gödel's observation, it is possible that we have encountered arithmetical facts with a reasonably short second-order proof (i.e. could be found in an analytic number theory textbook) but no reasonable first-order proof (i.e. the production of any such proof would necessarily exhaust all of our natural resources). The above is unlikely to be such, but it is interesting to know that beasts of this type could exist...

Let $K$ be a Galois extension of the rationals with degree $n$. The Chebotarev Density Theorem guarantees that the rational primes that split completely in $K$ have density $1/n$ and thus there are infinitely many such primes. As Kevin Buzzard pointed out to me in a comment, there is a simpler way to see that there are infinitely many rational primes that split completely in $K$, namely that the Dedekind zeta-function $\zeta_K(s)$ has a simple pole at $s = 1$. While this result is certainly much easier to prove than Chebotarev's Theorem, it is still not an elementary proof.

Is there a known elementary proof of the fact that there are infinitely many rational primes that split completely in $K$?

Selberg's elementary proof of Dirichlet's Theorem for primes in arithmetic progressions handles the case where $\text{Gal}(K/\mathbb{Q})$ is Abelian. I don't know anything about the general case. Since Dirichlet's Theorem is stronger than required, it is possible that an simpler proof exists even in the Abelian case.

Remarks on the meaning of elementary. I am aware that there is no uniformly recognized definition of "elementary proof" in number theory. While I am not opposed to alternate definitions, my personal definition is a proof which can be carried out in first-order arithmetic, i.e. without quantification over real numbers or higher-type objects. Obviously, I don't require it to be explicitly formulated in that way — even logicians don't do that! Odds are that whatever you believe is elementary is also elementary in my sense.

Kurt Gödel observed that proofs of (first-order) arithmetical facts can be much, much shorter in second-order arithmetic than in first-order arithmetic. This observation explains some of the effectiveness of analytic number theory, which is implicitly second-order. In view of Gödel's observation, it is possible that we have encountered arithmetical facts with a reasonably short second-order proof (i.e. could be found in an analytic number theory textbook) but no reasonable first-order proof (i.e. the production of any such proof would necessarily exhaust all of our natural resources). The above is unlikely to be such, but it is interesting to know that beasts of this type could exist...

Let K be a Galois extension of the rationals with degree n. The Chebotarev Density Theorem guarantees that the rational primes that split completely in K have density 1/n and thus there are infinitely many such primes. As Kevin Buzzard pointed out to me in a comment, there is a simpler way to see that there are infinitely many rational primes that split completely in K, namely that the Dedekind zeta-function ζ_K(s) has a simple pole at s = 1. While this result is certainly much easier to prove than Chebotarev's Theorem, it is still not an elementary proof.

Is there a known elementary proof of the fact that there are infinitely many rational primes that split completely in K?

Selberg's elementary proof of Dirichlet's Theorem for primes in arithmetic progressions handles the case where Gal(K/Q) is Abelian. I don't know anything about the general case. Since Dirichlet's Theorem is stronger than required, it is possible that an simpler proof exists even in the Abelian case.

Remarks on the meaning of elementary. I am aware that there is no uniformly recognized definition of "elementary proof" in number theory. While I am not opposed to alternate definitions, my personal definition is a proof which can be carried out in first-order arithmetic, i.e. without quantification over real numbers or higher-type objects. Obviously, I don't require it to be explicitly formulated in that way — even logicians don't do that! Odds are that whatever you believe is elementary is also elementary in my sense.

Kurt Gödel observed that proofs of (first-order) arithmetical facts can be much, much shorter in second-order arithmetic than in first-order arithmetic. This observation explains some of the effectiveness of analytic number theory, which is implicitly second-order. In view of Gödel's observation, it is possible that we have encountered arithmetical facts with a reasonably short second-order proof (i.e. could be found in an analytic number theory textbook) but no reasonable first-order proof (i.e. the production of any such proof would necessarily exhaust all of our natural resources). The above is unlikely to be such, but it is interesting to know that beasts of this type could exist...

Let K be a Galois extension of the rationals with degree n. The Chebotarev Density Theorem guarantees that the rational primes that split completely in K have density 1/n and thus there are infinitely many such primes. As Kevin Buzzard pointed out to me in a comment, there is a simpler way to see that there are infinitely many rational primes that split completely in K, namely that the Dedekind zeta-function ζ_K(s) has a simple pole at s = 1. While this result is certainly much easier to prove than Chebotarev's Theorem, it is still not an elementary proof.

Is there a known elementary proof of the fact that there are infinitely many rational primes that split completely in K?

Selberg's elementary proof of Dirichlet's Theorem for primes in arithmetic progressions handles the case where Gal(K/Q) is Abelian. I don't know anything about the general case. Since Dirichlet's Theorem is stronger than required, it is possible that an simpler proof exists even in the Abelian case.

Remarks on the meaning of elementary. I am aware that there is no uniformly recognized definition of "elementary proof" in number theory. While I am not opposed to alternate definitions, my personal definition is a proof which can be carried out in first-order arithmetic, i.e. without quantification over real numbers or higher-type objects. Obviously, I don't require it to be explicitly formulated in that way — even logicians don't do that! Odds are that whatever you believe is elementary is also elementary in my sense.

Kurt Gödel observed that proofs of (first-order) arithmetical facts can be much, much shorter in second-order arithmetic than in first-order arithmetic. This observation explains some of the effectiveness of analytic number theory, which is implicitly second-order. In view of Gödel's observation, it is possible that we have encountered arithmetical facts with a reasonably short second-order proof (i.e. could be found in an analytic number theory textbook) but no reasonable first-order proof (i.e. the production of any such proof would necessarily exhaust all of our natural resources). The above is unlikely to be such, but it is interesting to know that beasts of this type could exist...