p. 2 — a subring A ≠ ℤ of ℝ contains a countable dense subring
ProvedMonod.exists_countable_dense_subring_of_ne_botIf is a subring of other than , there is a subring that is countable and dense in .
import Mathlib
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 MonodRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back
Setting. Throughout, is the field of real numbers with its usual ring structure and its usual topology (the one induced by the metric ). A subring of here means a subset that contains and and is closed under addition, negation and multiplication (subrings are unital: they always contain ).
The smallest subring of is the set of integers
i.e. the image of the canonical map . Every subring of contains it.
Statement. Let be a subring of , and assume
that is, is not the subring consisting of exactly the integers. (Since every subring contains , this is the same as saying that contains at least one real number that is not an integer.)
Then there exists a subring of such that all three of the following hold:
- (containment as sets, not necessarily proper; is allowed);
- is countable, meaning there is an injective map (finite sets would also qualify; neither finiteness nor infiniteness is stated);
- is dense in : every real number lies in the closure of , equivalently every nonempty open interval of meets .
Remarks on the quantifiers and edge cases.
- The only hypothesis is ; there are no further assumptions on (it may be countable or uncountable, and may be all of ).
- The hypothesis is satisfiable (for example by ), so it is not vacuous.
- Nothing is asserted about uniqueness of , about being finitely generated, or about any relation between and beyond .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.