Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Setting (pp. 191--194). Let f(x)=0f(x)=0 be an irreducible normal equation of degree nn with roots x1,…,xnx_1,\ldots,x_n, and let GG be its Galois group, which has order nn. For a prime ideal P\mathfrak P of the field generated by the roots that divides the rational prime pp but not the discriminant of the equation, Satz 1 (p. 193) gives congruences xip≡xαi(modP)x_i^p\equiv x_{\alpha_i}\pmod{\mathfrak P} for i=1,…,ni=1,\ldots,n, and the substitution SS sending ii to αi\alpha_i lies in GG (Satz 2). Then P\mathfrak P belongs to SS (Definition 1); the class of SS is the set of all T−1STT^{-1}ST with T∈GT\in G (Definition 2); and, since the conjugates of P\mathfrak P belong to the conjugates of SS (Satz 3), pp belongs to the class of SS (Definition 3). The density of a set of primes is the value of lim⁡s=1∑pp−s/lg⁡1s−1\lim_{s=1}\sum_p p^{-s}/\lg\frac1{s-1}, the sum running over the primes of the set (Definition 7, p. 194; also (3), p. 191).

Theorem (§ 5, pp. 216--225; result (99), p. 225). Let the irreducible normal equation (77) of degree nn have in its group a substitution SλS_\lambda of order fλf_\lambda (78), and let nλn_\lambda be the number of distinct substitutions in the class of SλS_\lambda (notation of p. 194). Write p1p_1 for the primes belonging to the class of SλS_\lambda. Then (p. 225, display (99), quoted)

lim inf⁡s=1∑pp1−slg⁡1s−1=lim sup⁡s=1∑pp1−slg⁡1s−1=lim⁡s=1∑pp1−slg⁡1s−1=nλn,\liminf_{s=1}\frac{\sum_p p_1^{-s}}{\lg\frac1{s-1}} =\limsup_{s=1}\frac{\sum_p p_1^{-s}}{\lg\frac1{s-1}} =\lim_{s=1}\frac{\sum_p p_1^{-s}}{\lg\frac1{s-1}} =\frac{n_\lambda}{n},

"und somit ist die gesuchte Dichtigkeit gefunden": the set of primes belonging to the class of SλS_\lambda has density nλ/nn_\lambda/n. The print writes the limits as s=1s=1; since lg⁡1s−1\lg\frac1{s-1} is real only for s>1s>1, they are read here as s→1+s\to1^+.

Context. The Hauptsatz of § 1 (p. 195), with its formula (20) (p. 198), is Frobenius's result as the paper re-proves it: the primes belonging to the Abteilung (division) of SλS_\lambda, the set of all TSλiT−1TS_\lambda^iT^{-1} with T∈GT\in G and ii prime to the order of SλS_\lambda (Definition 5, p. 194), have density kλnλ/nk_\lambda n_\lambda/n, where kλk_\lambda is the number of classes in that Abteilung. The paper records (p. 198) that Frobenius did not succeed in showing that a single class has density nλ/nn_\lambda/n; (99) supplies this. On p. 213 the paper notes, in § 4, that once the main result of § 5 is obtained the word "Abteilung" may be replaced everywhere by "Klasse".

Proof pointer

§ 5, pp. 216--225. Choose kk primes l1,…,lkl_1,\ldots,l_k of the form fλx+1f_\lambda x+1, prime to the discriminant DD, and adjoin to the field of the roots kk cyclic fields of degree fλf_\lambda built from the lil_i-th roots of unity (79); these are disjoint from one another and from the field of the roots, and the compositum is normal of degree n⋅fλkn\cdot f_\lambda^k (p. 216). The primes of the Abteilung of SλS_\lambda are distributed over the fλkf_\lambda^k residue "complexes" of § 2, using the uniform-distribution Hauptsatz of § 3 (p. 211, its proof completed in § 4, p. 215) and Sätze 10--13. Counting the primes of the single class of SλS_\lambda that lie in the primitive parts of the rays gives the lower bound (92) with a factor 1−a/Qk1-a/Q^k, and letting kk grow gives (93): the liminf is at least nλ/nn_\lambda/n for every class of the Abteilung (pp. 223--224). Frobenius's formula (96) for the whole Abteilung, with (93) applied to the other kλ−1k_\lambda-1 classes, gives the limsup bound (97), and (98) closes the gap (pp. 224--225). Not reconstructed here.

Read depth

Claims checked: the setting on pp. 191--195, the Hauptsatz of § 1 and (20), the opening of § 5 and the displays (93) to (99) were read clause by clause on the page images of the print. The intermediate steps of § 5 and the proofs of §§ 2--4 were read for structure only. Nothing here is independently reviewed.

Dependencies

None in the corpus. The paper uses Frobenius's 1896 results (Sätze 1--4, quoted from his Berlin Academy paper), Kronecker's formula (Satz 5, proof cited from Landau) and Dirichlet's theorem on primes in progressions.

Source. N. Tschebotareff, Die Bestimmung der Dichtigkeit einer Menge von Primzahlen, welche zu einer gegebenen Substitutionsklasse gehören, Math. Ann. 95 (1926), 191--228, doi:10.1007/BF01206606; the edition read is named on the source card.

Bears on

None: the paper mentions no Erdős problem, and no problem page cites it.