Maths Olympiad Prep

Track / Stage 8 / 111 of 180 #1811 of 1964

Problem 1811

IMO Shortlist mid-range; USAMO P2/P5
Algebra Difficulty 8.3 Prove it

Let R R be an infinite ring such that every subring of R R different from {0} \{0 \} has a finite index in R R. (By the index of a subring, we mean the index of its additive group in the additive group of R R.) Prove that the additive group of R R is cyclic.

L. Lovasz, J. Pelikan

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

To prove that the additive group of R R is cyclic, we will proceed through a series of lemmas and logical steps.

### Part 1: Existence of a Generator

1. **Lemma 1: ∀p∈℘,pR≠{0} \forall p \in \wp, pR \neq \{0\}

- Proof:** Suppose pR={0} pR = \{0\} for some prime p p . Then Rp={a∈R∣pa=0} R_p = \{ a \in R \mid pa = 0 \} is a subring of R R . Since R R is infinite and Rp≠{0} R_p \neq \{0\} , the index ∣R/Rp∣ |R/R_p| must be finite. This contradicts the assumption that every non-zero subring has finite index. Hence, pR≠{0} pR \neq \{0\} .

2. **Lemma 2: ∀p∈℘,pR≠R \forall p \in \wp, pR \neq R

- Proof:** Suppose pR=R pR = R for some prime p p . Then there exists a∈R a \in R such that 1=pa 1 = pa . This implies R R is a finite ring, which contradicts the assumption that R R is infinite. Hence, pR≠R pR \neq R .

3. **Lemma 3: ∀p∈℘,∣R/pR∣=pn \forall p \in \wp, |R/pR| = p^n for some positive integer n n

- Proof:** Construct a chain of subrings pR=R0⊆R1⊆R2⊆⋯⊆Rk−1⊆Rk=R pR = R_0 \subseteq R_1 \subseteq R_2 \subseteq \cdots \subseteq R_{k-1} \subseteq R_k = R such that each Ri+1/Ri R_{i+1}/R_i is a finite ring over the field Z/pZ \mathbb{Z}/p\mathbb{Z} . By the structure theorem for finitely generated modules over a principal ideal domain, ∣Ri+1/Ri∣=pmi |R_{i+1}/R_i| = p^{m_i} for some mi m_i . Thus, ∣R/pR∣=pn |R/pR| = p^n where n=∑mi n = \sum m_i .

4. **Lemma 4: ∀p≠q,p,q∈℘,pR∩qR≠pR \forall p \neq q, p, q \in \wp, pR \cap qR \neq pR

- Proof:** Suppose pR⊆qR pR \subseteq qR . Then pn=∣R/pR∣=∣R/qR∣⋅∣qR/pR∣=qm⋅∣qR/pR∣ p^n = |R/pR| = |R/qR| \cdot |qR/pR| = q^m \cdot |qR/pR| . This implies pn=qm⋅k p^n = q^m \cdot k for some integer k k , which is a contradiction since p p and q q are distinct primes. Hence, pR∩qR≠pR pR \cap qR \neq pR .

5. **Lemma 5: ∀a∈R,∃N>0:∀p∈℘,p>N,a∉pR \forall a \in R, \exists N > 0: \forall p \in \wp, p > N, a \notin pR

- Proof:** Suppose there exists an infinite sequence of primes {pi}i=1∞ \{p_i\}_{i=1}^{\infty} such that a∈piR a \in p_iR for all i i . Then ∩ipiR=R℘≠{0} \cap_i p_iR = R^{\wp} \neq \{0\} . Since R℘ R^{\wp} is a subring of R R with finite index, ∣R/R℘∣ |R/R^{\wp}| must be finite. However, ∣R/R℘∣≥pi |R/R^{\wp}| \geq p_i for all i i , which is a contradiction. Hence, ∃N>0 \exists N > 0 such that ∀p>N,a∉pR \forall p > N, a \notin pR .

6. **Lemma 6: ∀p≠q,p,q∈℘,pR∩qR=pqR \forall p \neq q, p, q \in \wp, pR \cap qR = pqR

- Proof:** Clearly, pqR⊆pR∩qR pqR \subseteq pR \cap qR . Suppose x∈pR∩qR x \in pR \cap qR . Then x=pr=qs x = pr = qs for some r,s∈R r, s \in R . Since p p and q q are distinct primes, x∈pqR x \in pqR . Hence, pR∩qR=pqR pR \cap qR = pqR .

7. **Lemma 7: If e1,e2∈PR e_1, e_2 \in P_R and a∈R a \in R such that a=p1k1p2k2⋯pikie1 a = p_1^{k_1} p_2^{k_2} \cdots p_i^{k_i} e_1 and a=q1l1q2l2⋯qjlje2 a = q_1^{l_1} q_2^{l_2} \cdots q_j^{l_j} e_2 , then e1=e2 e_1 = e_2 , i=j i = j , qv=pv q_v = p_v , and lv=kv l_v = k_v

- Proof:** From the properties of prime factorization and the uniqueness of e∈PR e \in P_R , it follows that e1=e2 e_1 = e_2 , i=j i = j , qv=pv q_v = p_v , and lv=kv l_v = k_v .

8. **Lemma 8: If p∈℘ p \in \wp and pR⊆R∗⊆R pR \subseteq R^* \subseteq R , then R∗=pR R^* = pR or R∗=R R^* = R

- Proof:** Suppose R∗≠R R^* \neq R . Then ∀a∈R∗,∃λ∈Z,ξ∗∈PR∗ \forall a \in R^*, \exists \lambda \in \mathbb{Z}, \xi^* \in P_{R^*} such that a=λξ∗ a = \lambda \xi^* . Since ξ∗=μξ \xi^* = \mu \xi for some μ∈Z \mu \in \mathbb{Z} and ξ∈PR \xi \in P_R , it follows that a=λμξ a = \lambda \mu \xi . Hence, R∗=pR R^* = pR .

9. **Lemma 9: ∀p∈℘,∣R/pR∣=p \forall p \in \wp, |R/pR| = p

- Proof:** Consider the ring R/pR R/pR . If there exists f∈R/pR f \in R/pR such that f2=0 f^2 = 0 , then R/pR={0,f,2f,…,(p−1)f} R/pR = \{0, f, 2f, \ldots, (p-1)f \} and ∣R/pR∣=p |R/pR| = p . If ∀g∈R/pR,g2≠0 \forall g \in R/pR, g^2 \neq 0 , then the multiplicative group G=R/pR∖{0} G = R/pR \setminus \{0\} has an element e e such that e2=e e^2 = e . Hence, R/pR={0,e,2e,…,(p−1)e} R/pR = \{0, e, 2e, \ldots, (p-1)e \} and ∣R/pR∣=p |R/pR| = p .

10. **Lemma 10: If R′ R' is a subring of R R , then there exists n∈Z n \in \mathbb{Z} such that R′=nR R' = nR

- Proof:** Let n=∣R/R′∣ n = |R/R'| . Then nR⊆R′ nR \subseteq R' and ∣R/nR∣=n=∣R/R′∣ |R/nR| = n = |R/R'| . Hence, R′=nR R' = nR .

### Conclusion

From Lemma 10, we know that for any subring R′ R' of R R , there exists n∈Z n \in \mathbb{Z} such that R′=nR R' = nR . Now, take ξ∈PR \xi \in P_R and consider the subring R1={r1ξ+r2ξ2+⋯+rkξk+⋯ }r1,r2,…,rk,…∈Z R_1 = \{ r_1 \xi + r_2 \xi^2 + \cdots + r_k \xi^k + \cdots \}_{r_1, r_2, \ldots, r_k, \ldots \in \mathbb{Z}} . By Lemma 10, there exists n∈Z n \in \mathbb{Z} such that R1=nR R_1 = nR . Since ξ∈PR \xi \in P_R , we have n=1 n = 1 and R=R1 R = R_1 . This implies that R R is generated by ξ \xi , and hence the additive group of R R is cyclic.

■\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.