TheoremBase

Proof of The Rational Numbers are Dense in the Real Numbers

theoremthm:rationals-dense-real-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: First published proof of thm:rationals-dense-real-2026a.

Proof

Let N\mathbb{N} be the natural numbers, ι\iota the canonical map of R\mathbb{R}, and Z\mathbb{Z} the integers. Every step below in which the same quantity is added to both sides of an inequality, or both sides are multiplied by a positive quantity, is justified by the elementary order arithmetic in an ordered field.

Claim 1. Let x<yx<y in R\mathbb{R}, so 0<yx0<y-x. By claim 3 of the Archimedean property there is NNN\in\mathbb{N} such that ι(N)1\iota(N)^{-1} exists and

0<ι(N)1<yx.0<\iota(N)^{-1}<y-x .

By claim 3 of the properties of the canonical map, 0<ι(N)0<\iota(N).

Let n=ι(N)xn=\lfloor\iota(N)\,x\rfloor be the integer part of ι(N)x\iota(N)x, so that

nι(N)x<n+1,n\le\iota(N)\,x<n+1 ,

and put q=(n+1)ι(N)1q=(n+1)\,\iota(N)^{-1}. Both n+1n+1 and ι(N)\iota(N) are integers, by claim 2 of the arithmetic lemma for the integers and by the definition of Z\mathbb{Z} respectively, and ι(N)0\iota(N)\ne0; hence qQq\in\mathbb{Q} by the definition of the rational numbers.

Multiplying the strict inequality ι(N)x<n+1\iota(N)x<n+1 by the positive number ι(N)1\iota(N)^{-1} preserves it, and ι(N)1(ι(N)x)=x\iota(N)^{-1}\bigl(\iota(N)x\bigr)=x, so

x<(n+1)ι(N)1=q.x<(n+1)\,\iota(N)^{-1}=q .

Multiplying nι(N)xn\le\iota(N)x by the positive ι(N)1\iota(N)^{-1} gives nι(N)1xn\,\iota(N)^{-1}\le x, so

q=(n+1)ι(N)1=nι(N)1+ι(N)1x+ι(N)1<x+(yx)=y.q=(n+1)\,\iota(N)^{-1}=n\,\iota(N)^{-1}+\iota(N)^{-1}\le x+\iota(N)^{-1}<x+(y-x)=y .

Hence x<q<yx<q<y.

Claim 2. Let xRx\in\mathbb{R} and let ε>0\varepsilon>0 be real. Then x<x+εx<x+\varepsilon, so claim 1 provides qQq\in\mathbb{Q} with x<q<x+εx<q<x+\varepsilon. Then 0<qx<ε0<q-x<\varepsilon, so xq=qx=qx<ε|x-q|=|q-x|=q-x<\varepsilon by the definition of the absolute value.

Claim 3. By the identification of the Euclidean distance on the real line with the absolute value metric, d(s,t)=std(s,t)=|s-t| for all s,tRs,t\in\mathbb{R}, so for xRx\in\mathbb{R} and real ε>0\varepsilon>0 the open ball of centre xx and radius ε\varepsilon is {sR:sx<ε}\{s\in\mathbb{R}:|s-x|<\varepsilon\}. By the theorem that metric open sets form a topology, the collection Td\mathcal{T}_{d} of metric open subsets of R\mathbb{R} is a topology, so the closure of a subset of R\mathbb{R} is defined.

By the characterization of the closure in a metric space by open balls, a point xRx\in\mathbb{R} belongs to the closure of Q\mathbb{Q} if and only if every open ball of centre xx and positive radius contains a point of Q\mathbb{Q}. Let xRx\in\mathbb{R} and let ε>0\varepsilon>0 be real; claim 2 supplies qQq\in\mathbb{Q} with xq<ε|x-q|<\varepsilon, and this qq lies in the open ball of centre xx and radius ε\varepsilon. Hence every xRx\in\mathbb{R} belongs to the closure of Q\mathbb{Q}, so that closure is R\mathbb{R} itself, which is precisely the assertion that Q\mathbb{Q} is dense in (R,Td)(\mathbb{R},\mathcal{T}_{d}).

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…