Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.20(b) — Q\mathbb{Q}Q is dense in R\mathbb{R}R

Proved
Rudin.ch01_rationals_dense

by LG · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysis

If x<yx < yx<y are real numbers, there is a rational ppp with x<p<yx < p < yx<p<y: between any two distinct reals lies a rational number.

Preamble
import Mathlib
Formal statement
namespace Rudin

/-- Rudin, Theorem 1.20(b): `ℚ` is dense in `ℝ`; between any two reals `x < y` there is a
rational number `p` with `x < p < y`. -/
theorem ch01_rationals_dense (x y : ℝ) (hxy : x < y) :
    ∃ p : ℚ, x < (p : ℝ) ∧ (p : ℝ) < y := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 1, p. 9, Theorem 1.20(b)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

For all real numbers xxx and yyy with x<yx < yx<y (strict inequality), there exists a rational number ppp such that, after embedding ppp into the reals,

x<pandp<y.x < p \quad\text{and}\quad p < y .x<pandp<y.

Both inequalities are strict, so ppp lies in the open interval (x,y)(x,y)(x,y) and can equal neither endpoint. No positivity or boundedness assumption is placed on xxx or yyy; the only hypothesis is x<yx < yx<y. Nothing is asserted about uniqueness or about how many such rationals exist.

Human review
  • Endorsed by Shuze Chen · Sep 12, 2026

  • Endorsed by LG · Sep 12, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me