Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

p. 2 — a subring A ≠ ℤ of ℝ contains a countable dense subring

Proved
Monod.exists_countable_dense_subring_of_ne_bot

by dbenbenn · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

amenabilitygroup-theorypiecewise-projective

If AAA is a subring of R\mathbf{R}R other than Z\mathbf{Z}Z, there is a subring A′⊆AA' \subseteq AA′⊆A that is countable and dense in R\mathbf{R}R.

Preamble
import Mathlib
Formal statement
namespace Monod

theorem exists_countable_dense_subring_of_ne_bot {A : Subring ℝ} (hA : A ≠ ⊥) :
    ∃ A' : Subring ℝ, A' ≤ A ∧ Countable A' ∧ Dense (A' : Set ℝ) := by
  sorry

end Monod
Source
Monod, N., Groups of piecewise projective homeomorphisms, Proc. Natl. Acad. Sci. USA 110 (2013) 4524–4527, https://doi.org/10.1073/pnas.1218426110 (arXiv:1209.5229v2, whose page numbers are used), p. 2, proof of Theorem 1
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Read-back

Setting. Throughout, R\mathbb{R}R is the field of real numbers with its usual ring structure and its usual topology (the one induced by the metric d(x,y)=∣x−y∣d(x,y)=|x-y|d(x,y)=∣x−y∣). A subring of R\mathbb{R}R here means a subset that contains 000 and 111 and is closed under addition, negation and multiplication (subrings are unital: they always contain 111).

The smallest subring of R\mathbb{R}R is the set of integers

Z={ n⋅1:n∈Z }⊆R,\mathbb{Z} = \{\, n\cdot 1 : n \in \mathbb{Z}\,\} \subseteq \mathbb{R},Z={n⋅1:n∈Z}⊆R,

i.e. the image of the canonical map Z→R\mathbb{Z}\to\mathbb{R}Z→R. Every subring of R\mathbb{R}R contains it.

Statement. Let AAA be a subring of R\mathbb{R}R, and assume

A≠Z,A \neq \mathbb{Z},A=Z,

that is, AAA is not the subring consisting of exactly the integers. (Since every subring contains Z\mathbb{Z}Z, this is the same as saying that AAA contains at least one real number that is not an integer.)

Then there exists a subring A′A'A′ of R\mathbb{R}R such that all three of the following hold:

  1. A′⊆AA' \subseteq AA′⊆A (containment as sets, not necessarily proper; A′=AA' = AA′=A is allowed);
  2. A′A'A′ is countable, meaning there is an injective map A′→NA' \to \mathbb{N}A′→N (finite sets would also qualify; neither finiteness nor infiniteness is stated);
  3. A′A'A′ is dense in R\mathbb{R}R: every real number lies in the closure of A′A'A′, equivalently every nonempty open interval of R\mathbb{R}R meets A′A'A′.

Remarks on the quantifiers and edge cases.

  • The only hypothesis is A≠ZA \neq \mathbb{Z}A=Z; there are no further assumptions on AAA (it may be countable or uncountable, and may be all of R\mathbb{R}R).
  • The hypothesis is satisfiable (for example by A=RA = \mathbb{R}A=R), so it is not vacuous.
  • Nothing is asserted about uniqueness of A′A'A′, about A′A'A′ being finitely generated, or about any relation between A′A'A′ and AAA beyond A′⊆AA' \subseteq AA′⊆A.
Human review
  • Endorsed by Shuze Chen · Sep 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by dbenbenn · Sep 30, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me